.png){kind=icon}
Return
Convexifying State-Constrained Optimal Control Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2022.3221704.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article presents a method that convexifies state-constrained optimal control problems in the control-input space. The proposed method enables convex programming methods to find the globally optimal solution even if costs and control constraints are nonconvex in control and convex in state, dynamics is nonaffine in control and convex in state, and state constraints are convex in state. Under the above conditions, generic methods do not guarantee to find optimal solutions, but the proposed method does. The proposed approach is demonstrated in a 16-D navigation example.
Keywords:
Nonlinear control systems
optimal control
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations
Cited Papers
Lossless convexification of a class of optimal control problems with non-convex control constraints.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSaveAn Introduction to Trajectory Optimization: How to Do Your Own Direct CollocationSIAM REVIEW
OAAI
SIAM REVIEWIF6.1
OAAIShareSave View more