All You Need is Group Actions: Advancing Robust Autonomous Planning

TL;DR

This paper introduces a novel group theory-based method for optimizing satellite constellation planning, enhancing efficiency and reducing costs in dynamic, uncertain environments.

Contribution

The paper presents a new multi-agent constraint optimization technique inspired by group actions, specifically designed for satellite constellation planning.

Findings

Demonstrates improved computational efficiency in simulations.

Shows robustness under inter-satellite link uncertainties.

Reduces operational costs through optimized planning.

Abstract

Managing the plan of constellation of satellites for target observation requires optimal deployment and efficient operational strategies. In this paper, we introduce a new technique based on group theory tools through multi-agent constraint optimization techniques, designed for the dynamic landscapes of satellite operations. Inspired by group actions, our method models the planning problem for observing Earth targets as a cooperative game to achieve computational efficiency while simultaneously reducing computational complexity. Designed for the complex task of planning constellation of satellites, our methodology provides a feasible solution to the inherent challenges of multi-agent optimization under state constraints and subject to uncertainties. Our approach can offer avenues for improving mission efficiency and reducing costs. Through numerical simulations, we demonstrate the good performance of the approach in the presence of inter-satellite links.