Reachability-Informed Reinforcement Learning for Multi-Impulse Interplanetary Transfers
Not on the map. Why?
Abstract (arXiv)
Reinforcement learning offers the prospect of a reusable sequential decision-making mechanism for spacecraft trajectory design, motivating policy interfaces that connect learned decisions to the underlying maneuver geometry. This paper develops Reachability Analysis-Informed Reinforcement Learning (RARL) for deterministic multi-impulse interplanetary transfers, placing intermediate waypoint selection at the center of the learned decision process. Local first-order reachability maps bounded velocity perturbations into an ellipsoidal set of next-node positions, within which the policy selects its waypoint. Lambert reconstruction then determines the corresponding maneuver to reach this selected waypoint along a dynamically consistent ballistic arc, coupling learned transfer-geometry selection with classical astrodynamics. A terminal two-impulse reconstruction completes the rendezvous, supported by a linear maneuver-demand assessment used for reward shaping. Numerical studies characterize this interface on a two-body Earth-Mars benchmark. Across three independent training runs, RARL achieves a mean maneuver cost of 10.23 km/s, 1.72% above a validated local sequential convex programming reference. Training over dispersed initial states extends policy reuse across a departure family with fixed target state and transfer duration. Each of the three independently trained multi-state policies completes all 10,000 held-out Monte Carlo departures without impulse-cap violations, compared with a mean feasibility rate of 6.49% for single-state policies. This broader sampled feasibility is accompanied by a 0.61% increase in mean nominal maneuver cost, without further training across departures. These results demonstrate that a reachability-informed decision interface supports benchmark-quality trajectory construction and policy reuse across dispersed departure conditions.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 44 references that are in the map. First posted on arXiv 1 Oct 2026.
Builds on
10 of 44 references.
References · 10
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
- 2017Hamilton-Jacobi Reachability: A Brief Overview and Recent Advancescited by 186
- 2017A Rewriting System for Convex Optimization Problemscited by 178
- 2023Iterative Reachability Estimation for Safe Reinforcement Learningcited by 33
- 2022Provably Safe Reinforcement Learning via Action Projection using Reachability Analysis and Polynomial Zonotopescited by 23
- 2018A Survey on Artificial Intelligence Trends in Spacecraft Guidance Dynamics and Controlcited by 13
- 2024Hamilton-Jacobi Reachability in Reinforcement Learning: A Surveycited by 11
- 2026Distribution-Agnostic Robust Trajectory Optimization via Chance-Constrained Reinforcement Learningcited by 1
Built on by
Not cited yet.