An Integer Linear Programming Model for Earth Observation Missions

Abstract

This paper addresses an optimization problem in satellite observation mission planning, focusing on the challenges of decentralized decision-making among satellites, which is crucial for optimizing strategies in dynamic observation environments. The method integrates mathematical modeling using integer programming and time-varying communication graphs, which are essential for efficient task scheduling. Specifically, the approach utilizes distributed Lagrangian relaxation techniques to manage the complexity of the problem. Numerical simulations are conducted to explore the feasibility of the proposed approach for handling complex satellite operations under evolving communication dynamics.