A two-phase scheduling method with the consideration of task clustering for earth observing satellites

Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems. Although extensive scheduling algorithms have been proposed for the satellite observation scheduling problem (SOSP), the task clustering strategy has not been taken into account up to now. This paper presents a novel two-phase based scheduling method with the consideration of task clustering for solving SOSP. This method comprises two phases: a task clustering phase and a task scheduling phase. In the task clustering phase, we construct a task clustering graph model and use an improved minimum clique partition algorithm to obtain cluster-tasks. In the task scheduling phase, based on overall tasks and obtained cluster-tasks, we construct an acyclic directed graph model and utilize a hybrid ant colony optimization coming with a mechanism of local search, called ACO-LS, to produce optimal or near optimal schedules. Extensive experimental simulations demonstrate the efficiency of the proposed scheduling method.

[1]  Maged M. Dessouky,et al.  A genetic algorithm approach for solving the daily photograph selection problem of the SPOT5 satellite , 2010, Comput. Ind. Eng..

[2]  Jun Wang,et al.  A multi-objective imaging scheduling approach for earth observing satellites , 2007, GECCO '07.

[3]  William J. Wolfe,et al.  Three Scheduling Algorithms Applied to the Earth Observing Systems Domain , 2000 .

[4]  Guenther Fuellerer,et al.  Ant colony optimization for the two-dimensional loading vehicle routing problem , 2009, Comput. Oper. Res..

[5]  G. Verfaillie,et al.  METHODS FOR THE DAILY MANAGEMENT OF AN EARTH OBSERVATION SATELLITE , 1996 .

[6]  S. A. Harrison,et al.  Task Scheduling for Satellite Based Imagery , 1999 .

[7]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[8]  Da-Yin Liao,et al.  Imaging Order Scheduling of an Earth Observation Satellite , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[9]  Jianghan Zhu,et al.  Multi-satellite observation integrated scheduling method oriented to emergency tasks and common tasks , 2012 .

[10]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[11]  Jin-Kao Hao,et al.  A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite , 2001, Comput. Optim. Appl..

[12]  Gérard Verfaillie,et al.  How to Manage the New Generation of Agile Earth Observation Satellites , 2007 .

[13]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[14]  Gérard Verfaillie,et al.  Selecting and scheduling observations of agile satellites , 2002 .

[15]  Kim Jong Tae,et al.  New efficient clique partitioning algorithms for register-transfer synthesis of data paths , 2002 .

[16]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[17]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[18]  Dae-Woo Lee,et al.  Development of a scheduling algorithm and GUI for autonomous satellite missions , 2011 .

[19]  Giovanni Righini,et al.  Planning and scheduling algorithms for the COSMO-SkyMed constellation , 2008 .

[20]  Peter Norvig,et al.  Planning and Scheduling for Fleets of Earth Observing Satellites , 2001 .

[21]  Glaydston Mattos Ribeiro,et al.  Strong formulation for the spot 5 daily photograph scheduling problem , 2010, J. Comb. Optim..

[22]  Jin-Kao Hao,et al.  Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem , 2003, J. Comb. Optim..

[23]  Thomas Schiex,et al.  Russian Doll Search for Solving Constraint Optimization Problems , 1996, AAAI/IAAI, Vol. 1.

[24]  Daniel Vanderpooten,et al.  Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite , 2002, Eur. J. Oper. Res..

[25]  Grégory Beaumet,et al.  FEASIBILITY OF AUTONOMOUS DECISION MAKING ON BOARD AN AGILE EARTH‐OBSERVING SATELLITE , 2011, Comput. Intell..

[26]  John Gasch,et al.  A Photo Album of Earth Scheduling Landsat 7 Mission Daily Activities , 1998 .

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[28]  Gilbert Laporte,et al.  A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites , 2007, Eur. J. Oper. Res..

[29]  Peng Gao,et al.  A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation , 2011, Comput. Ind. Eng..

[30]  Djamal Habet,et al.  Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite , 2010, Comput. Optim. Appl..

[31]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[32]  Al Globus,et al.  A Comparison of Techniques for Scheduling Earth Observing Satellites , 2004, AAAI.

[33]  Wei-Cheng Lin,et al.  Daily imaging scheduling of an Earth observation satellite , 2003, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[34]  Al Globus,et al.  A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites , 2003 .

[35]  Cécile Murat,et al.  MATHEMATICAL PROGRAMMING FOR EARTH OBSERVATION SATELLITE MISSION PLANNING , 2003 .

[36]  Daniel P. Siewiorek,et al.  Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.