Spacecraft Constrained Maneuver Planning for Moving Debris Avoidance Using Positively Invariant Constraint Admissible Sets (Postprint)

Abstract

This paper extends our prior work on spacecraft debris avoidance based on positively invariant sets to the case of moving debris. In this approach, a time-varying connectivity graph is constructed between a set of forced equilibria, forming a virtual net that is centered around a nominal orbital position of the spacecraft. The connectivity between two equilibria is determined based on contractive sets in order to guarantee that collision-free transitions between equilibria can be effected within a giving time period. A graph search algorithm is implemented to find the shortest path around the debris, or through the debris path once it has moved on. Simulation results are presented that illustrate this approach.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 14, 2013
Accession Number
ADA592422

Entities

People

  • Avishai Weiss
  • Christopher Petersen
  • Ilya V. Kolmanovsky
  • Morgan Baldwin
  • R. S. Erwin

Organizations

  • Air Force Research Laboratory

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Collision Avoidance
  • Collisions
  • Computations
  • Debris
  • Governments
  • Kalman Filters
  • Maneuvers
  • Relative Motion
  • Simulations
  • Space Debris
  • Spacecraft
  • Trajectories
  • Transitions
  • Vehicles

Readers

  • Aerospace Engineering.
  • Graph Algorithms and Convex Optimization.
  • Plasma Physics / Magnetohydrodynamics

Technology Areas

  • Space
  • Space - Orbital Debris
  • Space - Spacecraft Maneuvers