密度駆動最適制御:確率的LTIマルチエージェントシステムの収束保証
Density-Driven Optimal Control: Convergence Guarantees for Stochastic LTI Multi-Agent Systems
マルチエージェントの非一様領域被覆問題に対し、ワッサースタイン距離をコストにした確率的MPC的枠組みを提案し、時間平均経験分布が目標密度へ収束することを理論保証付きで示した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Kooktae Lee
分類: math.OC, cs.MA, cs.RO, cs.SY, eess.SY
原文アブストラクト
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.
