Congestion Mitigation Path Planning for Large-Scale Multi-Agent Navigation in Dense Environments
Takuro Kato, Keisuke Okumura, Yoko Sasaki, Naoya Yokomachi

TL;DR
This paper introduces a congestion-aware path planning method for large-scale multi-agent navigation, embedding congestion costs into route optimization to improve efficiency and reduce local congestion in dense environments.
Contribution
It formulates the novel CMPP problem, develops scalable solvers including an exact and an approximate algorithm, and demonstrates significant performance improvements in multi-agent systems.
Findings
CMPP reduces local congestion in multi-agent navigation.
Augmenting collision-avoidance with CMPP improves throughput.
Scalable algorithms effectively handle large-scale instances.
Abstract
In high-density environments where numerous autonomous agents move simultaneously in a distributed manner, streamlining global flows to mitigate local congestion is crucial to maintain overall navigation efficiency. This paper introduces a novel path-planning problem, congestion mitigation path planning (CMPP), which embeds congestion directly into the cost function, defined by the usage of incoming edges along agents' paths. CMPP assigns a flow-based multiplicative penalty to each vertex of a sparse graph, which grows steeply where frequently-traversed paths intersect, capturing the intuition that congestion intensifies where many agents enter the same area from different directions. Minimizing the total cost yields a set of coarse-level, time-independent routes that autonomous agents can follow while applying their own local collision avoidance. We formulate the problem and develop…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
