arXiv Machine Learning

Pretrained Approximators for Low-Thrust Trajectory Cost and Reachability

arXiv:2605. 26790v3 Announce Type: replace Abstract: Low-thrust trajectory design relies heavily on repeated evaluations of fuel consumption and transfer feasibility, which require expensive optimal control solutions.

arXiv Machine Learning
1d ago

Reachability-Informed Reinforcement Learning for Multi-Impulse Interplanetary Transfers

The paper introduces Reachability Analysis-Informed Reinforcement Learning (RARL) for designing deterministic multi‑impulse interplanetary transfers. RARL uses local first‑order reachability maps to bound velocity perturbations and selects intermediate waypoints, which are then translated into maneuvers via Lambert reconstruction and a terminal two‑impulse solution. Numerical experiments on an Earth‑Mars benchmark show that RARL achieves a mean maneuver cost only 1.72% above a validated convex programming reference and can be trained once to handle a wide range of departure states, achieving 100% feasibility on 10,000 held‑out Monte Carlo departures.

By Yashdeep Chaudhary, Roberto Armellin, Harry Holt
arXiv Machine Learning
Jul 7

Optimality-Informed Neural Networks for Lunar Landing Trajectory Optimization

arXiv:2607. 02741v1 Announce Type: cross Abstract: This paper develops an Optimality-Informed Neural Network (OINN) approach for the energy-optimal, free-final-time powered descent of a lunar lander from any initial position, velocity, and mass within a bounded operating envelope to a fixed landing site with zero terminal velocity.

By Zhenbo Wang
arXiv Machine Learning
Sep 16

Neural Operator Learning for Collision-Aware Trajectory Planning of Spacecraft Swarms

The paper presents a permutation‑equivariant neural operator that learns to generate collision‑free, fuel‑efficient trajectories for spacecraft swarms by mapping distributions of initial and target states, as well as obstacle states, to trajectory outputs. The operator is self‑supervised and, when paired with a batched Gauss‑Newton step, enforces exact orbital dynamics and further reduces fuel consumption. Trained on ten spacecraft, the model generalizes zero‑shot to swarms of 1,000 spacecraft and 11,000 obstacles, achieving accuracy comparable to a per‑agent optimal control solver while maintaining collision avoidance.

By Sidhdharth D. Sikka, Suyi Gao, Zehui Lu, Rongjie Lai, Shaoshuai Mou
arXiv Machine Learning
Aug 11

Satellite Trajectory Optimization via Proximal Policy Optimization for Space Debris Avoidance

arXiv:2608. 09628v1 Announce Type: new Abstract: Collision avoidance systems are commonly used to avoid fragmentation events occurring in Low-Earth Orbit (LEO) and Geosynchronous Equatorial Orbit (GEO).

By Logan Luna (Georgia Institute of Technology), Juan Ortiz Couder (Embry-Riddle Aeronautical University), Raul Alejandro Vargas-Acosta (Embry-Riddle Aeronautical University)
arXiv Machine Learning
Aug 4

Neural operator learning for collision-aware trajectory planning of spacecraft swarms

arXiv:2608. 00320v1 Announce Type: new Abstract: Autonomous spacecraft swarms must plan fuel-efficient, collision-free maneuvers in increasingly congested orbits, yet classical trajectory optimization scales poorly as pairwise safety constraints multiply with swarm size, and learning-based planners rarely transfer across swarm sizes or debris densities.

By Sidhdharth D. Sikka, Suyi Gao, Zehui Lu, Rongjie Lai, Shaoshuai Mou
arXiv AI
Jun 17

Transformer-Based Warm-Starting for Feasible and Optimal Terminal Approach to Tumbling Objects with Space Manipulators

arXiv:2606. 17317v1 Announce Type: cross Abstract: Real-time trajectory generation for on-orbit robotic servicing is challenging due to the nonlinear coupling between spacecraft bus motion, manipulator dynamics, visibility cone, and trajectory-level safety constraints.

By Yuji Takubo, Maximilian Adang, Mac Schwager, Simone D'Amico
arXiv Machine Learning
Aug 24

Actively Learning Joint Contours of Multiple Computer Experiments

The paper introduces a joint contour location (jCL) method for actively learning input configurations that simultaneously achieve specified responses across multiple computer experiments. By employing two distinct acquisition schemes—one for exploration and one for exploitation—along with a decision rule, the approach balances learning across multiple response surfaces and provides a natural stopping criterion when no solution exists. The method is demonstrated with Gaussian processes, multitask GPs, and deep GPs, outperforming existing single-response contour location strategies and optimization-based alternatives.

By Shih-Ni Prim, Kevin R. Quinlan, Paul Hawkins, Jagadeesh Movva, Annie S. Booth