arrow
Return

Convexifying State-Constrained Optimal Control Problem

delete2023-09-01
delete1
delete
OA
AI
D
Donggun Lee *
S
Shankar A. Deka
C
Claire J. Tomlin
DOI:10.1109/TAC.2022.3221704delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

IEEE Transactions on Automatic Control cover
IEEE Transactions on Automatic Control
IF:
7
Papers:
1.3W
Citations:
6.7W

Organization

U
University of California Berkeley
Scholars:
3.5W
Papers: 2.8W
Citations: 11.3W
R
Royal Institute of Technology
Scholars:
1.8W
Papers: 1.8W
Citations: 25
University of California System cover
University of California System
Scholars:
37.5W
Papers: 33.7W
Citations: 6.6K
researcher View more organizations