A Convex Optimization Approach to Solar Sail Station-Keeping Control in Halo Orbits

We present a convex optimization-based station-keeping control algorithm designed for long-term station keeping of unstable halo orbits using a solar sail. Our controller determines a sail orientation to minimize deviations from a nominal halo orbit. Traditional methods often linearize the solar-sail propulsion model around nominal angles that define the sail orientation, but this can lead to inaccuracies as the model deviates from the linearization point. Instead, we encode the set of possible thrust vectors generated by the nonlinear solar sail model as the boundary of a convex set, which we then relax to arrive at a convex optimization problem. We demonstrate em-pirically that this relaxation is tight in most cases (i.e. it produces feasible solutions to the original problem) in realistic simulation examples in the Earth-Moon system, validating the effectiveness of this propulsion-free method for long-term station keeping.

Authors

Institutions

Publication Details

Published
2025-03-01
DOI
https://doi.org/10.1109/aero63441.2025.11068645
Primary Topic
Spacecraft Dynamics and Control
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Convex Optimization Approach to Solar Sail Station-Keeping Control in Halo Orbits

Zachary Manchester, Fausto Vega
Spacecraft Dynamics and Control
article

A Convex Optimization Approach to Solar Sail Station-Keeping Control in Halo Orbits

Zachary Manchester, Fausto Vega
article en

Abstract

We present a convex optimization-based station-keeping control algorithm designed for long-term station keeping of unstable halo orbits using a solar sail. Our controller determines a sail orientation to minimize deviations from a nominal halo orbit. Traditional methods often linearize the solar-sail propulsion model around nominal angles that define the sail orientation, but this can lead to inaccuracies as the model deviates from the linearization point. Instead, we encode the set of possible thrust vectors generated by the nonlinear solar sail model as the boundary of a convex set, which we then relax to arrive at a convex optimization problem. We demonstrate em-pirically that this relaxation is tight in most cases (i.e. it produces feasible solutions to the original problem) in realistic simulation examples in the Earth-Moon system, validating the effectiveness of this propulsion-free method for long-term station keeping.

Carnegie Mellon University (US)
National Science Foundation
Affordable and clean energy
Openalex Percentile: Top 77%
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.