A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites

Bianchessi, Nicola; Cordeau, Jean François; Desrosiers, Jacques; Laporte, Gilbert; Raymond, Vincent

doi:10.1016/j.ejor.2005.12.026

Cited by 199 publications

(114 citation statements)

References 9 publications

Supporting

Mentioning

112

Contrasting

Unclassified

Order By: Relevance

“…Since each task is neither disjunctive nor preemptive, a task can only be allocated to one resource, and be executed once. Thereby, we have the following constraint 1 C : …”

Section: Problem Formulationmentioning

confidence: 99%

See 1 more Smart Citation

Emergency Scheduling of Multiple Imaging Satellites with Dynamic Merging

Wang

Zhu

Qiu

2013

Space Operations: Experience, Mission Systems, and Advanced Concepts

View full text Add to dashboard Cite

Scheduling plays a significant role in improving observation effectiveness of imaging satellites. Although extensive satellite scheduling algorithms have been proposed, none of them focuses on emergency scheduling in dynamic environment. In this paper, a novel dynamic emergency scheduling model of multiple imaging satellites is established. To improve user's satisfaction ratio and resource utilization, we propose a novel task dynamic merging strategy, developing an alternative task set establishment (ATSE) algorithm used for dynamic merging. Besides, a novel dynamic emergency scheduling algorithm called DM-DES is presented, which considers the dynamic merging. To demonstrate the superiority of our DM-DES, we conduct extensive experiments by simulations to compare DM-DES with an existing algorithm--RBHA as well as a baseline algorithm--DES. The experimental results indicate that DM-DES improves the scheduling quality of others and is suitable for emergency scheduling.

show abstract

“…Since each task is neither disjunctive nor preemptive, a task can only be allocated to one resource, and be executed once. Thereby, we have the following constraint 1 C : …”

Section: Problem Formulationmentioning

confidence: 99%

“…1 Recently, taking photographs in emergency by imaging satellites has become a critical measure to get the first-hand information. 2 For example, when an earthquake occurs, the images of stricken areas can be obtained by imaging satellites.…”

Section: Introductionmentioning

confidence: 99%

Emergency Scheduling of Multiple Imaging Satellites with Dynamic Merging

Wang

Zhu

Qiu

2013

Space Operations: Experience, Mission Systems, and Advanced Concepts

View full text Add to dashboard Cite

show abstract

“…For the multicriteria methods, instead of building a complete set of nondominated solutions, the authors only searched for a decision close to the line with a specified slope on the objective function plane. In [6], the selecting and scheduling requests for the multi-satellite, multi-orbit, and multi-user were studied, and tabu search was used to solve the problem. The fairness was taken into account, but it was not considered as an objective function.…”

Section: Captured Photographmentioning

confidence: 99%

A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite

Tangpattanakul

Jozefowiez

López

2015

European Journal of Operational Research

125

View full text Add to dashboard Cite

This paper presents an indicator-based multi-objective local search (IBMOLS) to solve a multi-objective optimization problem. The problem concerns the selection and scheduling of observations for an agile Earth observing satellite. The mission of an Earth observing satellite is to obtain photographs of the Earth surface to satisfy user requirements. Requests from several users have to be managed before transmitting an order, which is a sequence of selected acquisitions, to the satellite. The obtained sequence has to optimize two objectives under operation constraints. The objectives are to maximize the total profit of the selected acquisitions and simultaneously to ensure the fairness of resource sharing by minimizing the maximum profit difference between users. Experiments are conducted on realistic instances. Hypervolumes of the approximate Pareto fronts are computed and the results from IBMOLS are compared with the results from the biased random-key genetic algorithm (BRKGA).

show abstract

“…This algorithm is often used as a working basis, for example in [16]. Different other methods are adapted and applied to the problem of mission planning, like Simulated Annealing [19], Tabu Search [3], or Genetic Algorithms [12], [18].…”

Section: B State Of the Artmentioning

confidence: 99%

Multi-satellite Mission Planning Using a Self-Adaptive Multi-agent System

Bonnet¹,

Gleizes

Kaddoum

et al. 2015

2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems

View full text Add to dashboard Cite

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. This is an author-deposited version published in : http://oatao.univ-toulouse.fr/ Eprints ID : 18173 Abstract-Mission planning for a constellation of Earth observation satellites is a complex problem raising significant technological challenges for tomorrow's space systems. The large numbers of customers requests and their dynamic introduction in the planning system result in a huge combinatorial search space with a potentially highly dynamical evolution requirements. The techniques used nowadays have several limitations, in particular, it is impossible to dynamically adapt the plan during its construction even for small modifications. Satellites of a constellation are planned in a chronological way instead of a more collective planning which can provide additional load balancing.In this paper, we propose to solve this difficult and highly dynamic problem using adaptive multi-agent systems, taking advantage from their self-adaptation and self-organization mechanisms. In the proposed system, the agents, through their local interactions, allow to dynamically reach a good solution, while ensuring a controlled distribution of tasks within the constellation of satellites. Finally, a comparison with a classical chronological greedy algorithm, commonly used in the spatial domain, highlights the advantages of the presented system.

show abstract

A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites

Cited by 199 publications

References 9 publications

Emergency Scheduling of Multiple Imaging Satellites with Dynamic Merging

Emergency Scheduling of Multiple Imaging Satellites with Dynamic Merging

A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite

Multi-satellite Mission Planning Using a Self-Adaptive Multi-agent System

Contact Info

Product

Resources

About