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

面向可并行化的基于采样的非线性模型预测控制

Towards parallelizable sampling-based Nonlinear Model Predictive Control

Eindhoven University of Technology(埃因霍温理工大学)

R. V. Bobiti, M. Lazar

AI总结:

本文提出一种基于采样的非线性MPC算法,其复杂度与预测时间N平方相关,与样本数线性相关。通过利用前一时间步的预测输入序列作为初始值,逐步更新序列元素,实现一定程度的并行化,保证递归可行性、稳定性及改进的成本函数,适用于实时应用。

摘要:

本文提出了一种新的基于采样的非线性模型预测控制(MPC)算法,其复杂度与预测时间N平方相关,与样本数线性相关。该算法通过利用前一时间步的预测输入序列作为初始值,并逐步更新序列元素,从最后一个预测输入开始,到第一个预测输入结束,以实现一定程度的并行化。这种策略类似于动态规划原理,能够产生一种次优的非线性MPC算法,具有保证的递归可行性、稳定性和每次迭代中改进的成本函数,适用于实时实现。该算法在预测时间步中的复杂度仅取决于时间跨度、样本数和并行线程数,与测量系统状态无关。在基准示例中与fmincon非线性优化求解器的比较表明,随着模拟时间的推进,所提算法迅速收敛到“最优”解,即使使用少量样本也是如此。

英文摘要:

This paper proposes a new sampling-based nonlinear model predictive control (MPC) algorithm, with a bound on complexity quadratic in the prediction horizon N and linear in the number of samples. The idea of the proposed algorithm is to use the sequence of predicted inputs from the previous time step as a warm start, and to iteratively update this sequence by changing its elements one by one, starting from the last predicted input and ending with the first predicted input. This strategy, which resembles the dynamic programming principle, allows for parallelization up to a certain level and yields a suboptimal nonlinear MPC algorithm with guaranteed recursive feasibility, stability and improved cost function at every iteration, which is suitable for real-time implementation. The complexity of the algorithm per each time step in the prediction horizon depends only on the horizon, the number of samples and parallel threads, and it is independent of the measured system state. Comparisons with the fmincon nonlinear optimization solver on benchmark examples indicate that as the simulation time progresses, the proposed algorithm converges rapidly to the "optimal" solution, even when using a small number of samples.

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

↑