Agents
Density-Driven Optimal Control: Convergence Guarantees for Stochastic LTI Multi-Agent Systems
arXiv:2604.08495v1 Announce Type: cross Abstract: This paper addresses the decentralized non-uniform area coverage problem for multi-agent systems, a critical task in missions with high spatial priori
arXiv:2604.08495v1 Announce Type: cross Abstract: 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.
Related
- Incorporating Social Awareness into Control of Unknown Multi-Agent Systems: A Real-Time Spatiotemporal Tubes Approach
- Robust Multi-Agent Target Tracking in Intermittent Communication Environments via Analytical Belief Merging
- Karma Mechanisms for Decentralised, Cooperative Multi Agent Path Finding
- Energy Saving for Cell-Free Massive MIMO Networks: A Multi-Agent Deep Reinforcement Learning Approach
Source: arXiv cs.RO | 2026-04-10