Spacecraft Constrained Maneuver Planning Using Positively Invariant Constraint Admissible Sets (Postprint)

Abstract

The paper considers spacecraft motion planning based on the use of safe positively invariant sets. In this approach, a connectivity graph is constructed between a set of forced equilibria, forming a virtual net that is centered around a nominal orbital position. The connectivity between two equilibria is determined based on safe positively invariant sets in order to guarantee that transitions between equilibria can be effected while spacecraft actuator limits are adhered to and debris collisions are avoided. A graph search algorithm is implemented to find the shortest path around the debris. Simulation results are presented that illustrate this approach.

Open PDF

Document Details

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

Entities

People

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

Organizations

  • University of Michigan

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Circular Orbits
  • Collision Avoidance
  • Collisions
  • Computations
  • Equations
  • Governments
  • Kalman Filters
  • Maneuvers
  • Motion Planning
  • Relative Motion
  • Simulations
  • Spacecraft
  • Spacecraft Trajectories
  • Vehicles

Readers

  • Graph Algorithms and Convex Optimization.
  • Robotics and Automation.
  • Space Exploration and Orbital Mechanics.

Technology Areas

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