Accession Number:

ADA439013

Title:

Optical Dynamic Assignment for Low Earth Orbit Satellite Constellations

Descriptive Note:

Corporate Author:

TENNESSEE UNIV KNOXVILLE DEPT OF MECHANICAL AND AEROSPACE ENGINEERING

Report Date:

2005-09-14

Pagination or Media Count:

8.0

Abstract:

In this paper we investigate autonomous task assignment for a group or low-earth orbit satellites that dont 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.

Subject Categories:

  • Unmanned Spacecraft
  • Telemetry

Distribution Statement:

APPROVED FOR PUBLIC RELEASE