Optical Dynamic Assignment for Low Earth Orbit Satellite Constellations

摘要

In this paper we investigate autonomous task assignment for a group or low-earth orbit satellites that don't necessarily have prior knowledge or the targets or interest. Specifically, we consider the optimal assignment problem for dynamic weighted bipartite graphs. First, we present necessary and sufficient conditions for the existence of a perfect matching in a given bipartite graph. Next, we present an algorithm to construct a virtual graph based on the original graph that guarantees the existence of a perfect matching. These results are then used to solve the optimal assignment problem for dynamic weighted bipartite graphs. Finally, we apply this algorithm to a constellation of low-earth orbit satellites.