Multiple agile Earth observation satellites, oversubscribed targets scheduling using complex networks theory
Xinwei Wang, Chao Han, Rui Zhang, Yi Gu

TL;DR
This paper proposes a complex network-based heuristic for scheduling multiple agile Earth observation satellites with oversubscribed targets, improving efficiency in complex observation mission planning.
Contribution
It introduces a novel complex network model and an improved heuristic algorithm for scheduling multiple agile satellites with oversubscribed targets.
Findings
The heuristic outperforms constructive and genetic algorithms in simulations.
The approach effectively manages complex scheduling with multiple observations.
Validation on a real Chinese satellite constellation demonstrates efficiency improvements.
Abstract
The Earth observation satellites (EOSs) scheduling is of great importance to achieve efficient observation missions. The agile EOSs (AEOS) with stronger attitude maneuvering capacity can greatly improve observation efficiency while increasing scheduling complexity. The multiple AEOSs, oversubscribed targets scheduling problem with multiple observations are addressed, and the potential observation missions are modeled as nodes in the complex networks. To solve the problem, an improved feedback structured heuristic is designed by defining the node and target importance factors. On the basis of a real world Chinese AEOS constellation, simulation experiments are conducted to validate the heuristic efficiency in comparison with a constructive algorithm and a structured genetic algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
