.png){kind=icon}
返回
Minimum time learning model predictive control
.png){kind=icon}
OA
AI
DOI：10.1002/rnc.5284.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a Learning Model Predictive Control (LMPC) strategy for linear and nonlinear time optimal control problems. Our work builds on existing LMPC methodologies and it guarantees finite time convergence properties for the closed-loop system. We show how to construct a time varying safe set and terminal cost function using closed-loop data. The resulting LMPC policy is time varying and it guarantees recursive constraint satisfaction and non-decreasing performance. Computational efficiency is obtained by convexifing the time-varying safe set and time-varying terminal cost function. We demonstrate that, for a class of nonlinear system and convex constraints, the convex LMPC formulation guarantees recursive constraint satisfaction and nondecreasing performance. Finally, we illustrate the effectiveness of the proposed strategies on minimum time obstacle avoidance and racing examples.
Keyword:
iterative improvement
learning model predictive control
minimum time
predictive control
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.2
论文数:
7.0K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
分享收藏CasADi: a software framework for nonlinear optimization and optimal controlCasADi: 非线性优化和最优控制的软件框架
PREAI
分享收藏
查看更多内容