Optimality-Informed Neural Networks for Lunar Landing Trajectory Optimization
- URL: http://arxiv.org/abs/2607.02741v1
- Date: Thu, 02 Jul 2026 20:23:45 GMT
- Title: Optimality-Informed Neural Networks for Lunar Landing Trajectory Optimization
- Abstract summary: This paper develops an Optimality-Informed Neural Network (OINN) approach for the energy-final-time powered descent of a lunar lander.<n>Building on a framework that embeds Pontryagin's minimum principle and the Hamilton-Jacobman equation for general nonlinear optimal control, the proposed OINN approach specializes that idea.
- Score: 0.40611352512781873
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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. Building on a recent framework that jointly embeds Pontryagin's minimum principle and the Hamilton-Jacobi-Bellman equation for general nonlinear optimal control, the proposed OINN approach specializes that idea to a lunar landing problem with free time of flight and fixed terminal state. Every boundary and transversality condition is hard-encoded into the network architecture by construction, the closed-form Pontryagin-optimal thrust magnitude and direction law is substituted directly rather than learned, and the remaining state, costate, and an auxiliary value-function output are trained against a physics-residual loss formed entirely from the necessary conditions of optimality, with no precomputed optimal trajectories required. A preliminary theoretical analysis is explored, establishing a stochastic-optimization stationarity guarantee for the offline training procedure, an explicit bound translating the achieved training residual into bounds on touchdown position, touchdown velocity, and flight-time error, and a fixed, input-independent onboard computational and memory cost suitable for real-time deployment. Numerical simulations evaluate the trained policy, with no retraining, against an independently solved indirect-method boundary-value problem at six representative initial states spanning the operating envelope and against eighty additional Monte Carlo simulation runs, demonstrating close agreement with the indirect-method solution and consistently small dynamics and transversality residuals throughout the envelope.
Related papers
- From Atoms to Entropy: Optimal Noise Allocation for Diffusion Training in the Convex Regime [52.459513910242485]
We develop a general statistical framework for studying optimal noise-level allocation in diffusion training.<n>We show that the optimized training schedule admits an atomic minimizer, concentrated on finitely many noise levels.<n>We then evaluate the entropic schedule in larger-scale experiments, where full schedule optimization is currently intractable.
arXiv Detail & Related papers (2026-07-10T20:59:06Z) - Saturation-Aware Robust Trajectory Optimization for Reusable Launch Vehicles via Differentiable Physics [9.011250637911248]
High-angle-of-attack flip maneuver of reusable launch vehicles presents challenges for robust trajectory optimization.<n>This paper presents a differentiable physics framework for saturation-aware robust trajectory optimization.
arXiv Detail & Related papers (2026-07-02T14:30:37Z) - Dual-Network PINNs for Optimal Control: A Reproducible Benchmark on the Mass-Spring-Damper System [0.0]
This work presents a benchmark study of a direct dual-network Physics-Informed Neural Network (PINN) formulation for the optimal control of a mass-spring-damper system.<n>The PINN reproduces the classical optimal cost to four significant digits, satisfies the terminal state constraints exactly by construction, and produces pointwise state and control errors.
arXiv Detail & Related papers (2026-06-13T12:10:17Z) - Coordinated optimization of departure sequencing and section-track allocation in railway short-term concentrated departure scenarios based on qubo and hybrid quantum algorithms [3.045106532420546]
This study examines the coordinated optimization of departure sequencing and section-track allocation in railway short-term concentrated departure scenarios.<n>A quadratic unconstrained binary optimization model is formulated to represent departure-position assignment and section-track selection.<n>A simulation-based evaluation layer is introduced to assess section occupation, intermediate-station waiting, platform-capacity pressure, running-time fluctuations, and delay propagation.
arXiv Detail & Related papers (2026-06-04T06:23:13Z) - Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
arXiv Detail & Related papers (2026-05-27T14:02:20Z) - Language Generation as Optimal Control: Closed-Loop Diffusion in Latent Control Space [99.30250506439678]
This work reformulates language generation as an optimal control problem.<n>It provides a unified theoretical perspective to analyze autoregressive and diffusion models.
arXiv Detail & Related papers (2026-05-14T08:13:43Z) - The Ground Cost for Optimal Transport of Angular Velocity [1.143020642249583]
We revisit the optimal transport problem over angular velocity dynamics given by the controlled equation.<n>This is an instance of generalized optimal transport over a nonlinear dynamical system.
arXiv Detail & Related papers (2025-04-04T05:38:00Z) - Towards Continual Learning Desiderata via HSIC-Bottleneck
Orthogonalization and Equiangular Embedding [55.107555305760954]
We propose a conceptually simple yet effective method that attributes forgetting to layer-wise parameter overwriting and the resulting decision boundary distortion.
Our method achieves competitive accuracy performance, even with absolute superiority of zero exemplar buffer and 1.02x the base model.
arXiv Detail & Related papers (2024-01-17T09:01:29Z) - Stable Nonconvex-Nonconcave Training via Linear Interpolation [51.668052890249726]
This paper presents a theoretical analysis of linearahead as a principled method for stabilizing (large-scale) neural network training.
We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss landscape and show how linear can help by leveraging the theory of nonexpansive operators.
arXiv Detail & Related papers (2023-10-20T12:45:12Z) - Lattice real-time simulations with learned optimal kernels [49.1574468325115]
We present a simulation strategy for the real-time dynamics of quantum fields inspired by reinforcement learning.
It builds on the complex Langevin approach, which it amends with system specific prior information.
arXiv Detail & Related papers (2023-10-12T06:01:01Z) - Reinforcement Learning for Low-Thrust Trajectory Design of
Interplanetary Missions [77.34726150561087]
This paper investigates the use of reinforcement learning for the robust design of interplanetary trajectories in presence of severe disturbances.
An open-source implementation of the state-of-the-art algorithm Proximal Policy Optimization is adopted.
The resulting Guidance and Control Network provides both a robust nominal trajectory and the associated closed-loop guidance law.
arXiv Detail & Related papers (2020-08-19T15:22:15Z) - Neural Contraction Metrics for Robust Estimation and Control: A Convex
Optimization Approach [6.646482960350819]
This paper presents a new deep learning-based framework for robust nonlinear estimation and control using the concept of a Neural Contraction Metric (NCM)
The NCM uses a deep long short-term memory recurrent neural network for a global approximation of an optimal contraction metric.
We demonstrate how to exploit NCMs to design an online optimal estimator and controller for nonlinear systems with bounded disturbances utilizing their duality.
arXiv Detail & Related papers (2020-06-08T05:29:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.