arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.1369math.OC
收藏

控制MPC中的稀疏性级别

Controlling the level of sparsity in MPC

Daniel Axehill

摘要:

在用于在线模型预测控制(MPC)的优化例程中,线性系方程通常在每次迭代中求解。这对于有效集(AS)方法以及对于内点(IP)方法,以及对于线性MPC以及对于非线性MPC和混合MPC都是真实的。主要的计算工作是在求解这些线性系方程时花费的,因此,有效地求解它们是最感兴趣的。传统上,最优化问题可以用两种不同的方式来表述。其中一个导致稀疏的线性系的方程组,该方程组涉及在每次迭代中求解的相对多的变量,另一个导致密集的线性系的方程组,该方程组涉及相对少的变量。在这项工作中,它表明,它不仅可以考虑这两个不同的选择配方。相反,它表明,它是可能的,以创建一个完整的家庭的配方具有不同程度的稀疏性和变量的数量,并且可以利用这个额外的自由度,以获得更好的性能与软件和硬件在手。这一结果也提供了一个更好的答案,经常讨论的问题,在MPC中,应该使用稀疏或密集的配方。在这项工作中,它表明,这个问题的答案是,往往没有这些经典的选择是最好的选择,和一个更好的选择,实际上可以找到一个不同的稀疏水平。

英文摘要:

In optimization routines used for on-line Model Predictive Control (MPC), linear systems of equations are usually solved in each iteration. This is true both for Active Set (AS) methods as well as for Interior Point (IP) methods, and for linear MPC as well as for nonlinear MPC and hybrid MPC. The main computational effort is spent while solving these linear systems of equations, and hence, it is of greatest interest to solve them efficiently. Classically, the optimization problem has been formulated in either of two different ways. One of them leading to a sparse linear system of equations involving relatively many variables to solve in each iteration and the other one leading to a dense linear system of equations involving relatively few variables. In this work, it is shown that it is possible not only to consider these two distinct choices of formulations. Instead it is shown that it is possible to create an entire family of formulations with different levels of sparsity and number of variables, and that this extra degree of freedom can be exploited to get even better performance with the software and hardware at hand. This result also provides a better answer to an often discussed question in MPC; should the sparse or dense formulation be used. In this work, it is shown that the answer to this question is that often none of these classical choices is the best choice, and that a better choice with a different level of sparsity actually can be found.

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

↑