Global optimization of space mission concept of operations and systems design via mixed-integer nonlinear programming

Simultaneously optimizing space mission Concepts of Operations (ConOps) and spacecraft systems design involves discrete choices and nonconvex systems design models. This paper formulates the problem as a mixed-integer nonlinear program (MINLP) and presents both a heuristic approach based on augmented Lagrangian decomposition and a global optimization scheme that exploits concave structures commonly found in space systems. Specifically, we consider a crewed Mars mission case study developed in collaboration with NASA’s Advanced Concepts Office. To efficiently find feasible solutions to this MINLP, a decomposition framework from our prior work is modified and applied, where a series of convex mixed-integer quadratic programs and nonconvex nonlinear programs are iteratively solved. To identify globally optimal solutions, the proposed scheme incorporates the decomposition method as an upper bounding heuristic, constructs tight relaxations via piecewise linear underestimators, and applies variable domain reduction to close the optimality gap. The case study results demonstrate high computational efficiency and robust convergence behavior for both approaches. In particular, the proposed global optimization scheme converges to the same solution found by a state-of-the-art MINLP solver with substantially reduced computational cost, often by a few orders of magnitude. These results indicate the potential of the proposed framework as a practical and scalable alternative for solving nonconvex MINLPs in space mission and ConOps optimization coupled with systems design. • Space mission ConOps and systems design are co-optimized as a MINLP. • A decomposition method is used to efficiently generate high-quality feasible solutions. • A global optimization scheme is proposed for MINLPs involving concave functions. • Global optimality is achieved with significantly reduced computational cost. • Mars mission case study shows strong coupling between ConOps and systems.

Authors

Institutions

Publication Details

Journal
Acta Astronautica
Published
2025-11-20
DOI
https://doi.org/10.1016/j.actaastro.2025.11.043
Primary Topic
Spacecraft Dynamics and Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Global optimization of space mission concept of operations and systems design via mixed-integer nonlinear programming

Nick Gollins, Koki Ho, Masafumi Isaji
Acta Astronautica
Spacecraft Dynamics and Control
article

Global optimization of space mission concept of operations and systems design via mixed-integer nonlinear programming

Nick Gollins, Koki Ho, Masafumi Isaji
article en

Abstract

Simultaneously optimizing space mission Concepts of Operations (ConOps) and spacecraft systems design involves discrete choices and nonconvex systems design models. This paper formulates the problem as a mixed-integer nonlinear program (MINLP) and presents both a heuristic approach based on augmented Lagrangian decomposition and a global optimization scheme that exploits concave structures commonly found in space systems. Specifically, we consider a crewed Mars mission case study developed in collaboration with NASA’s Advanced Concepts Office. To efficiently find feasible solutions to this MINLP, a decomposition framework from our prior work is modified and applied, where a series of convex mixed-integer quadratic programs and nonconvex nonlinear programs are iteratively solved. To identify globally optimal solutions, the proposed scheme incorporates the decomposition method as an upper bounding heuristic, constructs tight relaxations via piecewise linear underestimators, and applies variable domain reduction to close the optimality gap. The case study results demonstrate high computational efficiency and robust convergence behavior for both approaches. In particular, the proposed global optimization scheme converges to the same solution found by a state-of-the-art MINLP solver with substantially reduced computational cost, often by a few orders of magnitude. These results indicate the potential of the proposed framework as a practical and scalable alternative for solving nonconvex MINLPs in space mission and ConOps optimization coupled with systems design. • Space mission ConOps and systems design are co-optimized as a MINLP. • A decomposition method is used to efficiently generate high-quality feasible solutions. • A global optimization scheme is proposed for MINLPs involving concave functions. • Global optimality is achieved with significantly reduced computational cost. • Mars mission case study shows strong coupling between ConOps and systems.

Acta AstronauticaVol. 242
Georgia Institute of Technology (US)
Openalex Percentile: Top 54%
Spacecraft Dynamics and Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.