Non-linear model predictive control with adaptive time-mesh refinement

Ciro Potena, Bartolomeo Della Corte, D. Nardi, G. Grisetti, A. Pretto
{"title":"Non-linear model predictive control with adaptive time-mesh refinement","authors":"Ciro Potena, Bartolomeo Della Corte, D. Nardi, G. Grisetti, A. Pretto","doi":"10.1109/SIMPAR.2018.8376274","DOIUrl":null,"url":null,"abstract":"In this paper, we present a novel solution for real-time, Non-Linear Model Predictive Control (NMPC) exploiting a time-mesh refinement strategy. The proposed controller formulates the Optimal Control Problem (OCP) in terms of flat outputs over an adaptive lattice. In common approximated OCP solutions, the number of discretization points composing the lattice represents a critical upper bound for real-time applications. The proposed NMPC-based technique refines the initially uniform time horizon by adding time steps with a sampling criterion that aims to reduce the discretization error. This enables a higher accuracy in the initial part of the receding horizon, which is more relevant to NMPC, while keeping bounded the number of discretization points. By combining this feature with an efficient Least Square formulation, our solver is also extremely time-efficient, generating trajectories of multiple seconds within only a few milliseconds. The performance of the proposed approach has been validated in a high fidelity simulation environment, by using an UAV platform. We also released our implementation as open source C++ code.","PeriodicalId":156498,"journal":{"name":"2018 IEEE International Conference on Simulation, Modeling, and Programming for Autonomous Robots (SIMPAR)","volume":"62 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Simulation, Modeling, and Programming for Autonomous Robots (SIMPAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMPAR.2018.8376274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, we present a novel solution for real-time, Non-Linear Model Predictive Control (NMPC) exploiting a time-mesh refinement strategy. The proposed controller formulates the Optimal Control Problem (OCP) in terms of flat outputs over an adaptive lattice. In common approximated OCP solutions, the number of discretization points composing the lattice represents a critical upper bound for real-time applications. The proposed NMPC-based technique refines the initially uniform time horizon by adding time steps with a sampling criterion that aims to reduce the discretization error. This enables a higher accuracy in the initial part of the receding horizon, which is more relevant to NMPC, while keeping bounded the number of discretization points. By combining this feature with an efficient Least Square formulation, our solver is also extremely time-efficient, generating trajectories of multiple seconds within only a few milliseconds. The performance of the proposed approach has been validated in a high fidelity simulation environment, by using an UAV platform. We also released our implementation as open source C++ code.
具有自适应时间网格细化的非线性模型预测控制
在本文中,我们提出了一种利用时间网格优化策略的实时非线性模型预测控制(NMPC)的新解决方案。该控制器将最优控制问题(OCP)表述为自适应格上的平面输出。在常见的近似OCP解中,构成晶格的离散点的数量代表了实时应用的临界上界。提出的基于nmpc的技术通过增加时间步长和采样准则来改进初始均匀的时间范围,旨在减少离散化误差。这使得在后退地平线的初始部分具有更高的精度,这与NMPC更相关,同时保持离散点的数量有限。通过将此特征与有效的最小二乘公式相结合,我们的求解器也非常省时,在几毫秒内生成数秒的轨迹。利用无人机平台,在高保真仿真环境中验证了该方法的性能。我们还以开源c++代码的形式发布了我们的实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信