Global Optimization Framework for Automated Low-Thrust Gravity-Assist Trajectory Design
Abstract
Gravity-assist trajectory design requires searching numerous leg combinations, but applying nonlinear programming (NLP) for low-thrust trajectory optimization to all combinations is computationally prohibitive. Therefore, conventional frameworks first perform broad search using lightweight trajectory models such as Lambert-based calculation and simplified deep-space maneuver models, while pruning infeasible candidates. However, to maintain efficiency, conventional approaches handle only low-dimensional formulations with limited constraints such as up to a couple of impulse maneuvers per leg. Consequently, they cannot accommodate the constrained multivariable optimization required for low-thrust design, running the risk of prematurely pruning viable trajectories. To address this, this paper introduces a convex pruning approach capable of solving constrained multivariable problems directly within broad search while retaining the computational efficiency. We then augment the broad search stage with a robust local low-thrust optimization algorithm based on thrust regularization, which together enable global exploration and optimization in an automated fashion. We apply the proposed framework in a BepiColombo-inspired scenario involving nine gravity assists, successfully demonstrating its broad search capability to discover a far greater number of solutions (36,335) compared to a conventional approach (4,664) while identifying a wider feasible launch window by one year.
Related
- An Improved Advanced Social Memory Optimization Framework for Global Optimization Problem and UAV Obstacle Avoidance Trajectory Planning
- From Corridor Selection to Earthwork: A Multi-Stage Framework for Automated Road Design via Steiner Trees and Convex Optimization
- Double Gravity-Assist Rendezvous Trajectory to Halley's Comet Using Deep-Space Low Thrust
- Cubature-Based Statistical Moment Steering for Nonlinear, Non-Gaussian Trajectory Optimization
- Learning-Accelerated Optimization-based Trajectory Planning for Cooperative Aerial-Ground Handover Missions
BibTeX
@misc{iijima2026global,
title = {{Global Optimization Framework for Automated Low-Thrust Gravity-Assist Trajectory Design}},
author = {Ryo Iijima and Kenshiro Oguri and Toshinori Kuwahara},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.09515},
eprint = {2609.09515},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.09515},
}
RIS
TY - UNPB
TI - Global Optimization Framework for Automated Low-Thrust Gravity-Assist Trajectory Design
AU - Ryo Iijima
AU - Kenshiro Oguri
AU - Toshinori Kuwahara
PY - 2026
DA - 2026/09/08
PB - arXiv
DO - 10.48550/arxiv.2609.09515
UR - https://arxiv.org/abs/2609.09515
AB - Gravity-assist trajectory design requires searching numerous leg combinations, but applying nonlinear programming (NLP) for low-thrust trajectory optimization to all combinations is computationally prohibitive. Therefore, conventional frameworks first perform broad search using lightweight trajectory models such as Lambert-based calculation and simplified deep-space maneuver models, while pruning infeasible candidates. However, to maintain efficiency, conventional approaches handle only low-dimensional formulations with limited constraints such as up to a couple of impulse maneuvers per leg. Consequently, they cannot accommodate the constrained multivariable optimization required for low-thrust design, running the risk of prematurely pruning viable trajectories. To address this, this paper introduces a convex pruning approach capable of solving constrained multivariable problems directly within broad search while retaining the computational efficiency. We then augment the broad search stage with a robust local low-thrust optimization algorithm based on thrust regularization, which together enable global exploration and optimization in an automated fashion. We apply the proposed framework in a BepiColombo-inspired scenario involving nine gravity assists, successfully demonstrating its broad search capability to discover a far greater number of solutions (36,335) compared to a conventional approach (4,664) while identifying a wider feasible launch window by one year.
ER -