arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.07974eess.SYcs.SY
收藏

一种面向任何时间模型预测控制的凸可行性方法

A Convex Feasibility Approach to Anytime Model Predictive Control

IMT Institute for Advanced Studies Lucca(卢卡高等研究学院)

Alberto Bemporad, Daniele Bernardini, Panagiotis Patrinos

AI总结:

本文提出一种凸可行性方法,用于任何时间模型预测控制,通过分离性能优化与渐近收敛性,实现终端集收敛,同时根据可用资源优化计算时间,适用于线性MPC和不同终端集类型。

摘要:

本文提出将模型预测控制(MPC)中的性能优化与渐近收敛性分离,以实现终端集收敛,无论每次采样步骤中性能优化的程度如何。通过在MPC约束中嵌入显式递减条件,并借助本文提出的新型且易于实现的凸可行性求解器,可以在可行性求解器上运行外层性能优化算法,并根据当前采样步骤中可用的CPU资源优化所需时间(在极端情况下可能在某个采样步骤中切换为开环),仍能保证终端集收敛。尽管MPC设置和本文提出的求解器可以处理相当广泛的功能类,但本文强调了合成方法,并在线性MPC和椭球形和多面体终端集的情况下展示了数值结果。

英文摘要:

This paper proposes to decouple performance optimization and enforcement of asymptotic convergence in Model Predictive Control (MPC) so that convergence to a given terminal set is achieved independently of how much performance is optimized at each sampling step. By embedding an explicit decreasing condition in the MPC constraints and thanks to a novel and very easy-to-implement convex feasibility solver proposed in the paper, it is possible to run an outer performance optimization algorithm on top of the feasibility solver and optimize for an amount of time that depends on the available CPU resources within the current sampling step (possibly going open-loop at a given sampling step in the extreme case no resources are available) and still guarantee convergence to the terminal set. While the MPC setup and the solver proposed in the paper can deal with quite general classes of functions, we highlight the synthesis method and show numerical results in case of linear MPC and ellipsoidal and polyhedral terminal sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑