Optical Dynamic Assignment for Low Earth Orbit Satellite Constellations

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 14, 2005
Accession Number
ADA439013

Entities

People

  • Alexander Melin
  • K. S. Erwin
  • Vijaysekhar Chellaboina

Organizations

  • University of Tennessee

Tags

DTIC Thesaurus Topics

  • Air Force Research Laboratories
  • Algorithms
  • Artificial Satellites
  • Attitude Control Systems
  • Computer Networks
  • Constellations
  • Earth Orbits
  • Graph Theory
  • Heuristic Methods
  • Linear Programming
  • Low Earth Orbits
  • Orbits
  • Satellite Constellations
  • Simulations
  • Spacecraft
  • Time Intervals
  • Vehicles

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Distributed Systems and Data Platform Development
  • Naval Personnel Management

Technology Areas

  • Space
  • Space - Satellites
  • Space - Spacecraft Maneuvers