.png){kind=icon}
返回
Convexifying State-Constrained Optimal Control Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2022.3221704.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Nonlinear control systems
optimal control
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Control of connected and automated vehicles: State of the art and future challenges互联和自动驾驶车辆的控制: 最新技术和未来挑战
OAAI
OAAI分享收藏Lossless convexification of a class of optimal control problems with non-convex control constraints一类具有非凸控制约束的最优控制问题的无损凸化.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏An Introduction to Trajectory Optimization: How to Do Your Own Direct CollocationSIAM REVIEWOAAI
SIAM REVIEWIF6.1
OAAI分享收藏
查看更多内容