arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.08495math.OCcs.MAcs.ROcs.SYeess.SY
收藏

密度驱动最优控制:随机线性时不变多智能体系统的收敛保证

Density-Driven Optimal Control: Convergence Guarantees for Stochastic LTI Multi-Agent Systems

New Mexico Institute of Mining and Technology(新墨西哥矿业与技术学院)

Kooktae Lee

AI总结:

本文提出随机密度驱动最优控制方法,通过拉格朗日框架实现多智能体系统非均匀区域覆盖,确保在随机LTI动态下时间平均经验分布收敛到非参数目标密度。

摘要:

本文针对多智能体系统的去中心化非均匀区域覆盖问题,提出随机密度驱动最优控制(D$^2$OC)。该方法基于拉格朗日框架,通过将最小化Wasserstein距离作为运行成本的随机MPC问题,确保在随机LTI动态下时间平均经验分布收敛到非参数目标密度。通过可达性分析建立了正式收敛保证,即使在存在过程和测量噪声的情况下也能提供有界跟踪误差。数值结果验证了随机D$^2$OC在鲁棒性和去中心化覆盖方面的优越性,优于以往的启发式方法在最优性和一致性方面。

英文摘要:

This paper addresses the decentralized non-uniform area coverage problem for multi-agent systems, a critical task in missions with high spatial priority and resource constraints. While existing density-based methods often rely on computationally heavy Eulerian PDE solvers or heuristic planning, we propose Stochastic Density-Driven Optimal Control (D$^2$OC). This is a rigorous Lagrangian framework that bridges the gap between individual agent dynamics and collective distribution matching. By formulating a stochastic MPC-like problem that minimizes the Wasserstein distance as a running cost, our approach ensures that the time-averaged empirical distribution converges to a non-parametric target density under stochastic LTI dynamics. A key contribution is the formal convergence guarantee established via reachability analysis, providing a bounded tracking error even in the presence of process and measurement noise. Numerical results verify that Stochastic D$^2$OC achieves robust, decentralized coverage while outperforming previous heuristic methods in optimality and consistency.

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

↑