A Cooperative Autonomous Scheduling Approach for Multiple Earth Observation Satellites With Intensive Missions

Abstract

Autonomous mission scheduling of multiple earth observation satellites (multi-EOSs) is considered as a complicated combinatorial optimization problem, which requires simultaneous consideration of imaging needs, resource constraints (electricity and memory) and possible emergencies. However, EOS resources are extremely scarce relative to intensive mission observation demands and most of the existing algorithms seldom consider emergencies. To address these challenges, this paper proposes a complete multi-EOSs scheduling scheme composed of two coupling stages, including mission pre-planning and mission replanning. We aim to obtain the optimal scheduling scheme for each EOS at the same time by maximizing the observation profits and balancing the resource consumption of each EOS. In this study, the roles of solar energy and ground stations in multi-EOSs mission scheduling are also considered. In the first stage, based on the cooperation and competition mechanism as well as the dynamic adjustment approach, an evolutionary ant colony optimization (EACO) method is developed to obtain the optimal solution for multi-EOSs preplanning. In the second stage, using the results produced by EACO, we propose an interactive replanning approach to replan the missions that cannot be performed by faulty EOS in the event of unexpected accidents. Finally, several target scenarios are designed and numerical experiments are performed to show that the proposed algorithm presents better performance for large-scale multi-EOSs missions than other state-of-the-art algorithms.INDEX TERMS Multiple earth observation satellites, autonomous mission scheduling, evolutionary ant colony optimization, dynamic adjustment approach, interactive replanning approach

Study on the Fast Search Planning Problem of Lost Targets for Maritime Emergency Response Based on an Improved Adaptive Immunogenetic Algorithm

“…In addition, the IAIGA model proposed in this article demonstrates robust global search capabilities. Compared with the greedy algorithm [ 21 ], ant colony algorithm [ 22 ], genetic algorithm [ 15 ], and immunogenetic algorithm, which have been widely used in recent years, the IAIGA model’s innovation lies in its introduction of an adaptive mechanism and an immune mechanism. These mechanisms enable the algorithm to dynamically adjust its search strategy during the search process to accommodate changing environments and demands.…”

A reverse chain search algorithm for the resource constraint in deep space detectors

“…Many scholars have adopted intelligent algorithms to deal with resource constraint problems. Qi et al (2021) presented an evolutionary ant colony algorithm for addressing the challenge of having limited earth observation satellite resources but many observation missions, which can plan and replan satellite missions and obtain the optimal scheme of earth observations. Nevertheless, some limitations in the observations were not considered, and the method design did not account for potential solutions to issues such as inclement weather and cloud cover.…”

Optimized Load-Scheduling Algorithm for CubeSat's Electric Power System Management Considering Communication Link

“…Such scheduling problems have been referred to as "Earth Observing Satellites (EOS) Scheduling Problems". They included constraints related to power, thermal capacity, data capacity, and time [20] [21]. In addition to task scheduling, a task clustering technique was considered in [22].…”