Adaptive Node Distribution via Probability Density Functions for Birkhoff Pseudospectral Trajectory Optimisation
math.OC, cs.SY, eess.SY
Submitted: 2026-10-09
Updated: 2026-10-09
Comments: 28 pages, 9 figures, 4 tables
License: http://creativecommons.org/licenses/by/4.0/
The gist: Pseudospectral methods are a powerful framework for spacecraft trajectory optimisation that rely on fixed, problem-independent collocation nodes such as Legendre-Gauss-Lobatto (LGL) nodes.
Abstract
Pseudospectral methods are a powerful framework for spacecraft trajectory optimisation that rely on fixed, problem-independent collocation nodes such as Legendre-Gauss-Lobatto (LGL) nodes. These nodes are located according to polynomial root distributions, which can result in insufficient resolution in regions of high dynamical activity, such as those encountered during collision avoidance manoeuvres. This paper presents an adaptive node distribution strategy for Birkhoff pseudospectral trajectory optimisation, where the collocation nodes are placed according to a probability density function derived from the thrust magnitude profile of the spacecraft. By concentrating nodes in regions of high dynamical variation, the proposed method simultaneously achieves feasibility preservation and improved convergence with fewer nodes in a collision avoidance case study when compared to the universal Birkhoff method, with Model Predictive Control serving as an independent validation comparator. The case study highlights the practical consequences of inter-node constraint violations and validates the adaptive node scheme as a robust and efficient alternative for fuel-optimal spacecraft manoeuvre design.
Sources
Related papers
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
- Incremental Learning in Mirror Flows
- Second-Order Optimization with Asynchronous Curvature
- Online Control via Counterfactual Tracking
- Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability