arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.02433eess.SYcs.SYmath.OC
收藏

基于低秩矩阵更新的约束zonotope情形显式MPC

Explicit MPC for the constrained zonotope case with low-rank matrix updates

Stefan S. Mihai, Florin Stoican, Martin Monnigmann, Bogdan D. Ciubotaru

AI总结:

针对显式MPC计算量随维度和时域指数增长的问题,利用constrained-zonotope几何特性,在提升生成空间中通过二阶最优性条件求解,采用低秩矩阵更新和候选有效集解析枚举加速显式解计算。

摘要:

求解显式模型预测控制(MPC)问题需要枚举所有临界区域及其相关反馈律,该任务的计算量随系统维度和预测时域呈指数级增长。当问题约束为boxes或zonotopes时,可行域允许采用紧凑的constrained-zonotope表示。基于此,我们利用等效constrained-zonotope重构的几何特性来加速显式解的计算。具体而言,我们在提升的生成空间中构建多参数问题并利用二阶最优性条件求解,采用低秩矩阵更新以减少计算时间,并引入候选有效集的解析枚举,最终以树状形式输出显式解。

英文摘要:

Solving the explicit Model Predictive Control (MPC) problem requires enumerating all critical regions and their associated feedback laws, a task that scales exponentially with the system dimension and the prediction horizon, as well. When the problem's constraints are boxes or zonotopes, the feasible domain admits a compact constrained-zonotope representation. Building on this insight, we exploit the geometric properties of the equivalent constrained-zonotope reformulation to accelerate the computation of the explicit solution. Specifically, we formulate the multi-parametric problem in the lifted generator space and solve it using second-order optimality conditions, employ low-rank matrix updates to reduce computation time, and introduce an analytic enumeration of candidate active sets that yields the explicit solution in tree form.

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

↑