Large region targets observation scheduling by multiple satellites using resampling particle swarm optimization
- 12 September 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. PP (00189251) , 1-16
Abstract
The last decades have witnessed a rapid increase of Earth observation satellites (EOSs), leading to the increasing complexity of EOSs scheduling. On account of the widespread applications of large region observation, this paper aims to address the EOSs observation scheduling problem for large region targets. A rapid coverage calculation method employing a projection reference plane and a polygon clipping technique is first developed. We then formulate a nonlinear integer programming model for the scheduling problem, where the objective function is calculated based on the developed coverage calculation method. A greedy initialization-based resampling particle swarm optimization (GI-RPSO) algorithm is proposed to solve the model. The adopted greedy initialization strategy and particle resampling method contribute to generating efficient and effective solutions during the evolution process. In the end, extensive experiments are conducted to illustrate the effectiveness and reliability of the proposed method. Compared to the traditional particle swarm optimization and the widely used greedy algorithm, the proposed GI-RPSO can improve the scheduling result by 5.42% and 15.86%, respectively.Keywords
All Related Versions
This publication has 39 references indexed in Scilit:
- Mission scheduling optimization of SAR satellite constellation for minimizing system response timeAerospace Science and Technology, 2015
- Resolution of an Antenna–Satellite assignment problem by means of Integer Linear ProgrammingAerospace Science and Technology, 2014
- Multi-satellite Observation Scheduling Algorithm Based on Hybrid Genetic Particle Swarm Optimization2012
- Industrial strength polygon clipping: A novel algorithm with applications in VLSI CADComputer-Aided Design, 2010
- Satellite scheduling considering maximum observation coverage time and minimum orbital transfer fuel costActa Astronautica, 2010
- A new algorithm for computing Boolean operations on polygonsComputers & Geosciences, 2009
- Selecting and scheduling observations of agile satellitesAerospace Science and Technology, 2002
- The particle swarm - explosion, stability, and convergence in a multidimensional complex spaceIEEE Transactions on Evolutionary Computation, 2002
- A Theoretical Framework for Sequential Importance Sampling with Resampling2001
- A generic solution to polygon clippingCommunications of the ACM, 1992