Large-Scale Continual Scheduling and Execution for Dynamic Distributed Satellite Constellation Observation Allocation

Itai Zilberstein, Steve Chien

Keywords: Distributed constraint optimization, scheduling, satellite operations

TL;DR: New model and algorithms for scheduling observations for hundreds of satellites in a dynamic distributed constraint optimization problem with millions of variables.

Abstract: The size and capabilities of Earth-observing satellite constellations are rapidly increasing. Leveraging distributed onboard control, we can enable novel time-sensitive measurements and responses. However, deploying autonomy to satellites requires efficient computation and communication. This work tackles the challenge of efficiently scheduling observations for hundreds of satellites in a dynamic, large-scale problem with millions of variables. We present the Dynamic Multi-Satellite Constellation Observation Scheduling Problem (DCOSP), a new formulation of Dynamic Distributed Constraint Optimization Problems (DDCOP) that models integrated scheduling and execution. DCOSP has a novel optimality condition for which we construct an omniscient offline algorithm to compute. We also present the Dynamic Incremental Neighborhood Stochastic Search algorithm (D-NSS), an incomplete online decomposition-based DDCOP algorithm that repairs and solves sub-problems when problem dynamics occur. We show through simulation that D-NSS converges to near-optimal solutions and outperforms DDCOP baselines in terms of solution quality, computation time, and message volume. As part of the NASA FAME mission, DCOSP and D-NSS will be the foundation of the largest in-space demonstration of distributed multi-agent AI to date.

Area: Search, Optimization, Planning, and Scheduling (SOPS)

Generative A I: I acknowledge that I have read and will follow this policy.

Submission Number: 108