Two-Archive2 Algorithm for Large-Scale Polygon Targets Observation Scheduling Problem

Abstract

In the case of observing a single polygon target for a specified period of time with multiple earth observation satellites, select different observation plans will result in different regional coverage effects. How to schedule the observing scheme, so that the observing activities can achieve the required coverage with less satellite resources, meanwhile minimize the revisit rate of observation area in the shortest time, is a major optimization problem. This paper explores the modeling and solving method of this optimization problem. Firstly, the basic mathematical model is established, including the constraint condition and four optimization objectives. After that, target discretization method is introduced to calculate the regional coverage. Two-Archive2 algorithm (i.e., Two_Arch2) is chosen as the multi-objective evolutionary algorithm to solve this problem. The model and the solution method is used for solving a practical multi-satellite regional observation problem. The validity of the model and the algorithm is verified by the experimental results.