Distributed Optimization Approach for Multi-Agent Optimal Coverage Problem with Application to Satellite Constellation Reconfiguration

A game-based distributed decision approach is proposed to solve the multi-agent optimal coverage problem, where the equivalence between the equilibrium of the game and the extreme value of the global performance objective is proven. A distributed algorithm is developed to obtain the global near-optimal coverage using only local information, and its convergence is analyzed and proved. The proposed method is applied to maximize the covering time of a satellite constellation for a target.