A Combinatorial Optimal Control Problem for Spacecraft Formation Reconfiguration
Taeyoung Lee, N. Harris McClamroch, Melvin Leok
Abstract
We consider a spacecraft formation reconfiguration problem in the case of identical spacecraft. This introduces in the optimal reconfiguration problem a permutational degree of freedom, in addition to the choice of individual spacecraft trajectories. We approach this using a coupled combinatorial and continuous optimization framework, in which the inner loop consists of computing the costs associated with a particular assignment by using a geometrically exact and numerically efficient discrete optimal control method based on Lie group variational integrators. In the outer optimization loop, combinatorial techniques are used to determine the optimal assignments based on the costs computed in the inner loop. The proposed method is demonstrated on the optimal reconfiguration problem for 5 identical spacecraft to go from an inline configuration to one equally spaced on a circle.
Create a lesson
Related papers
Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates
David Martínez-Rubio, Cristóbal Guzmán
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.
Complexity Of Output Feedback Stabilization
Amir Ali Ahmadi, Abraar Chaudhry, Ijay Narang et al.
Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization
Didier Henrion, Mohab Safey El Din
Geometry and Convergence of Quadratically Regularized Optimal Transport I
Alberto González-Sanz, Marcel Nutz
Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems
Julian Niederer, Christoph Hansknecht, Andreas Potschka et al.