Fast, Safe, and Propellant-Efficient Spacecraft Planning under Clohessy-Wiltshire-Hill Dynamics
Joseph A. Starek, Edward Schmerling, Gabriel D. Maher, Brent W., Barbee, Marco Pavone

TL;DR
This paper introduces a real-time, propellant-efficient spacecraft trajectory planning algorithm that guarantees safety and performance, leveraging advanced robot motion planning techniques under the Clohessy-Wiltshire-Hill dynamics model.
Contribution
It adapts the Fast Marching Tree algorithm for spacecraft trajectory planning, incorporating safety constraints and robustness to thruster failures, with theoretical guarantees and real-time applicability.
Findings
Algorithm guarantees safety and performance.
Suitable for real-time autonomous planning.
Applicable to various space missions.
Abstract
This paper presents a sampling-based motion planning algorithm for real-time and propellant-optimized autonomous spacecraft trajectory generation in near-circular orbits. Specifically, this paper leverages recent algorithmic advances in the field of robot motion planning to the problem of impulsively-actuated, propellant-optimized rendezvous and proximity operations under the Clohessy-Wiltshire-Hill (CWH) dynamics model. The approach calls upon a modified version of the Fast Marching Tree (FMT*) algorithm to grow a set of feasible trajectories over a deterministic, low-dispersion set of sample points covering the free state space. To enforce safety, the tree is only grown over the subset of actively-safe samples, from which there exists a feasible one-burn collision avoidance maneuver that can safely circularize the spacecraft orbit along its coasting arc under a given set of potential…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
