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.

9 Figures and Tables

Cite this paper

@inproceedings{Baldwin2012SpacecraftCM, title={Spacecraft Constrained Maneuver Planning Using Positively Invariant Constraint Admissible Sets (postprint)}, author={Morgan Baldwin and Paul E. Hausgen and Ilya V. Kolmanovsky}, year={2012} }