Mutation particle swarm optimization for earth observation satellite mission planning

Earth observation satellite mission planning is the core issue of multisatellite and multitask to coordinate control and scheduling problem. In this paper, the 0-1 integer programming model for satellite mission planning problem was constructed. We discussed the discrete particle swarm optimization (DPSO), designed decimal encoding operator of DPSO and decoding method based on the utilization of satellite resources, proposed DPSO with mutation operator (MDPSO). This algorithm not only optimizes effectively, but also has overcome the premature convergence of the particle swarm algorithm. The MDPSO can resolve the satellite mission planning effectively. Finally, we designed two sets of experiments. The first one analyzed the algorithm parameters' influence on the optimization results. Then comparing with the genetic algorithm, we verified the effectiveness of the MDPSO, and confirmed that the optimization results had been significantly improved for at least 7.8%.

[1]  Yuejin Tan,et al.  Scheduling of imaging satellites based on improved ant colony algorithm: Scheduling of imaging satellites based on improved ant colony algorithm , 2012 .

[2]  Luo Kai-ping.  Planning overall high-resolution earth observation system mission in the perspective of systems science , 2011 .

[3]  Tan Yue-jin.  Scheduling of imaging satellites based on improved ant colony algorithm , 2011 .

[4]  Wu Xiao-yue.  Satellite Data Transmission Scheduling Problem Based on Velocity Controllable Particle Swarm Optimization , 2010 .

[5]  Yuqiang Feng,et al.  Support System for Predicting Online Auction End Prices , 2009 .

[6]  Ali Husseinzadeh Kashan,et al.  A discrete particle swarm optimization algorithm for scheduling parallel machines , 2009, Computers & industrial engineering.

[7]  Wu Xiao-yue.  Satellite data transmission task scheduling based on advanced particle swarm optimization , 2009 .

[8]  He Ren-jie.  Optimization algorithm based on decomposition for satellites observation scheduling problem , 2009 .

[9]  Yuelin Gao,et al.  Adaptive Particle Swarm Optimization Algorithm With Genetic Mutation Operation , 2007, Third International Conference on Natural Computation (ICNC 2007).

[10]  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..

[11]  Ren Zi-hui.  Adaptive Particle Swarm Optimization algorithm with mutation operator , 2007 .

[12]  Piero P. Bonissone,et al.  Evolutionary algorithms + domain knowledge = real-world evolutionary computation , 2006, IEEE Transactions on Evolutionary Computation.

[13]  Zhong Yi-wen.  Pseudo Greedy Discrete Particle Swarm Optimization Algorithm for TSP Problem , 2006 .

[14]  Gilbert Laporte,et al.  Maximizing the value of an Earth observation satellite orbit , 2005, J. Oper. Res. Soc..

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

[16]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[17]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[18]  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..

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

[20]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[21]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.