Semi-discrete Optimal Transport for Time-Varying Multi-Agent Coverage Control

arXiv:2601.21753 · eess.SY, cs.SY, math.OC · Submitted 2026-01-29 · Read on arXiv

eess.SY, cs.SY, math.OC

Submitted: 2026-01-29

Updated: 2026-09-08

Terminology

• Optimal Transport — 23× in this paper · explained in 5 episodes
• Wasserstein Distance — 10× in this paper · explained in 4 episodes
• Quantization — 3× in this paper · explained in 12 episodes
• Robustness — 3× in this paper · explained in 5 episodes
• Multi-Agent System — 2× in this paper · explained in 6 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Closed-Loop System — 1× in this paper · explained in 4 episodes
• Clustering — 1× in this paper · explained in 2 episodes
• Convergence Guarantees — 1× in this paper · explained in 3 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Lyapunov function — 1× in this paper · explained in 2 episodes
• Optimal Transport (OT) — 1× in this paper · explained in 4 episodes
• Redundancy — 1× in this paper · explained in 2 episodes

Related papers

• One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
• A Geometric Decision Procedure for STL Feasibility and Repair
• Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
• Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model
• Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration
• Decentralized Power-Optimal Coordination for Spacecraft Swarms Using Time-Varying Magnetorquer Actuation