arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.18503math.OCcs.MAcs.RO
收藏

计算高效的密度驱动最优控制:通过分析KKT缩减和收缩MPC

Computationally Efficient Density-Driven Optimal Control via Analytical KKT Reduction and Contractive MPC

Department of Mechanical Engineering, New Mexico Institute of Mining and Technology(机械工程系,新墨西哥采矿与技术研究院)

Julian Martinez, Kooktae Lee

AI总结:

本文提出通过分析KKT缩减和收缩MPC实现计算高效的密度驱动最优控制,解决大规模多智能体系统中集体空间分布协调问题,显著降低计算复杂度。

摘要:

高效协调集体空间分布是多智能体系统中的基本挑战。先前的密度驱动最优控制(D2OC)建立了将智能体轨迹匹配到期望空间分布的框架。然而,将其作为预测控制器实施需要求解大规模Karush-Kuhn-Tucker(KKT)系统,其计算复杂度随预测时间范围呈立方增长。为解决此问题,我们提出了一种分析性结构缩减,将T时间范围的KKT系统转换为压缩的二次规划(QP)。此方法实现了O(T)线性可扩展性,显著降低了与传统O(T^3)方法相比的在线计算负担。此外,为确保动态环境中的严格收敛性,我们引入了收缩Lyapunov约束,并证明了闭环系统对参考传播漂移的输入到状态稳定性(ISS)。数值模拟验证了所提方法在实现快速密度覆盖的同时具有显著的计算加速,使大规模多智能体群体的长时间预测控制成为可能。

英文摘要:

Efficient coordination for collective spatial distribution is a fundamental challenge in multi-agent systems. Prior research on Density-Driven Optimal Control (D2OC) established a framework to match agent trajectories to a desired spatial distribution. However, implementing this as a predictive controller requires solving a large-scale Karush-Kuhn-Tucker (KKT) system, whose computational complexity grows cubically with the prediction horizon. To resolve this, we propose an analytical structural reduction that transforms the T-horizon KKT system into a condensed quadratic program (QP). This formulation achieves O(T) linear scalability, significantly reducing the online computational burden compared to conventional O(T^3) approaches. Furthermore, to ensure rigorous convergence in dynamic environments, we incorporate a contractive Lyapunov constraint and prove the Input-to-State Stability (ISS) of the closed-loop system against reference propagation drift. Numerical simulations verify that the proposed method facilitates rapid density coverage with substantial computational speed-up, enabling long-horizon predictive control for large-scale multi-agent swarms.

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

↑