Satellite Constellation Multi-Target Robust Observation Method Based on Hypergraph Algebraic Connectivity and Observation Precision Theory

Jie Cao, Xiaogang Pan (), Yuanyuan Jiao, Bowen Sun and Yangyang Lu
Additional contact information
Jie Cao: National Key Laboratory of Information Systems Engineering, National University of Defense Technology, Changsha 410073, China
Xiaogang Pan: National Key Laboratory of Information Systems Engineering, National University of Defense Technology, Changsha 410073, China
Yuanyuan Jiao: National Key Laboratory of Information Systems Engineering, National University of Defense Technology, Changsha 410073, China
Bowen Sun: National Key Laboratory of Information Systems Engineering, National University of Defense Technology, Changsha 410073, China
Yangyang Lu: National Key Laboratory of Information Systems Engineering, National University of Defense Technology, Changsha 410073, China

Mathematics, 2025, vol. 13, issue 19, 1-30

Abstract: A multi-target robust observation method for satellite constellations based on hypergraph algebraic connectivity and observation precision theory is proposed to address the challenges posed by the surge in space targets and system failures. First, a precision metric framework is constructed based on nonlinear batch least squares estimation theory, deriving the theoretical precision covariance through cumulative observation matrices to provide a theoretical foundation for tracking accuracy evaluation. Second, multi-satellite collaborative observation is modeled as an edge-dependent vertex-weighted hypergraph, enhancing system robustness by maximizing algebraic connectivity. A constrained simulated annealing (CSA) algorithm is designed, employing a precision-guided perturbation strategy to efficiently solve the optimization problem. Simulation experiments are conducted using 24 Walker constellation satellites tracking 50 targets, comparing the proposed method with greedy algorithm, CBBA, and CSA-bipartite Graph methods across three scenarios: baseline, maneuvering, and failure. Results demonstrate that the CSA-hypergraph method achieves 0.089 km steady-state precision in the baseline scenario, representing a 41.4% improvement over traditional methods; in maneuvering scenarios, detection delay is reduced by 34.3% and re-achievement time is decreased by 47.4%; with a 30% satellite failure rate, performance degradation is only 9.8%, significantly outperforming other methods.

Keywords: multi-target tracking; hypergraph theory; algebraic connectivity; satellite constellation; precision metric; robust optimization; space situational awareness; constrained simulated annealing (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/19/3220/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/19/3220/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:19:p:3220-:d:1766387

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().