Selecting and scheduling observations of agile satellites

被引:453
作者
Lemaître, M
Verfaillie, G
Jouhaud, F
Lachiver, JM
Bataille, N
机构
[1] Off Natl Etud & Rech Aerosp, Dept Syst Control & Flight Dynam, F-31055 Toulouse 4, France
[2] CNES, Adv Observat Syst Dept, F-31401 Toulouse 4, France
关键词
Earth Observing Satellite; agile satellite; mission management; scheduling;
D O I
10.1016/S1270-9638(02)01173-2
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
This article concerns the problem of managing the new generation of Agile Earth Observing Satellites (AEOS). This kind of satellites is presently studied by the French Centre National d'Etudes Spatiales (PLEIADES project). The mission of an Earth Observing Satellite is to acquire images of specified areas on the Earth surface, in response to observation requests from customers. Whereas non-agile satellites such as SPOT5 have only one degree of freedom for acquiring images, the new generation satellites have three, giving opportunities for a more efficient use of the satellite imaging capabilities. Counterwise to this advantage, the selection and scheduling of observations becomes significantly more difficult, due to the larger search space for potential solutions. Hence, selecting and scheduling observations of agile satellites is a highly combinatorial problem. This article sets out the overall problem and analyses its difficulties. Then it presents different methods which have been investigated in order to solve a simplified version of the complete problem: a greedy algorithm, a dynamic programming algorithm, a constraint programming approach and a local search method. (C) 2002 Editions scientifiques et medicales Elsevier SAS. All rights reserved.
引用
收藏
页码:367 / 381
页数:15
相关论文
共 23 条
[1]  
AARTS E, 1997, LOCAL SEARCH COMBINA
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]  
Bensana E., 1996, P 4 INT S SPAC MISS
[4]  
Cormen T. H., 1990, INTRO ALGORITHMS
[5]   A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts [J].
Gabrel, V ;
Moulet, A ;
Murat, C ;
Paschos, VT .
ANNALS OF OPERATIONS RESEARCH, 1997, 69 (0) :115-134
[6]  
GABREL V, 1999, IMPROVED LINEAR PROG
[7]   MAXIMIZING THE VALUE OF A SPACE MISSION [J].
HALL, NG ;
MAGAZINE, MJ .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 78 (02) :224-241
[8]  
HARRISON SA, 1999, P 18 WORKSH UK PLANN, P64
[9]  
Harvey W. D., 1995, P IJCAI, V1, P607
[10]   An effective implementation of the Lin-Kernighan traveling salesman heuristic [J].
Helsgaun, K .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 126 (01) :106-130