Exact Solutions to a Class of Constrained Optimal Control Problems via Lossless Convexification for Digital Control

Abstract

This article establishes a new numerically viable technique for solving a class of constrained, nonconvex, continuous-time optimal control problems (OCPs) for linear systems that commonly arise in aerial and aerospace applications. The lossless convexification technique is employed to translate the original nonconvex OCP with annular control magnitude constraints into a convex problem, and then by finitely parametrizing the control space with piecewise constant functions, an efficient numerical approach is established that guarantees exact solutions while ensuring the satisfaction of an uncountable family of constraints over a compact time interval. The effectiveness of the approach is demonstrated on a spacecraft landing problem involving three degrees of freedom (DoF), underscoring its potential for real-world aerospace guidance and control tasks.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…