Research map / Multi-agent systems and games / Human-AI and goal-conditioned
Multi-Agent Corridor Reasoning for Multi-Agent Path Finding
Yiran Ni, Deshi Ye
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace pairwise corridor reasoning with multi-agent corridor reasoning | CBSH-RTC · maze maps | runtime (s), m=20: 22.5 -> 8.4 | Improved |
| replace pairwise corridor reasoning with multi-agent corridor reasoning | CBSH-RTC · maze maps | CT nodes, m=20: 267 -> 59 | Improved |
| replace pairwise corridor reasoning with multi-agent corridor reasoning | CBSH-RTC · Den312d m=60 | CT nodes: 2230 -> 683 | Improved |
| replace pairwise corridor reasoning with multi-agent corridor reasoning | CBSH-RTC · Warehouse m=120 | runtime (s): 39.6 -> 29.1 | Improved |
| replace pairwise corridor reasoning with multi-agent corridor reasoning | CBSH-RTC · room maps | corridor conflict share (%): 49.5% -> 31% | Improved |
| replace pairwise corridor reasoning with multi-agent corridor reasoning | CBSH-RTC · maze maps | expanded CT nodes: 519 -> 289 | Improved |
| replace pairwise corridor reasoning with multi-agent corridor reasoning | CBSH-RTC · empty maps | expanded CT nodes: 1610 -> 1610 | No clear effect |
| replace pairwise corridor reasoning with multi-agent corridor reasoning | CBSH-RTC · random maps | expanded CT nodes: 2602 -> 2548 | No clear effect |
| replace pairwise corridor reasoning with multi-agent corridor reasoning | CBSH-RTC · Room m=10 | runtime (s): 0.7 -> 0.6 | Improved |
| multi-agent corridor reasoning versus mutex propagation CBSH-MS | CBSH-MS · eight MAPF maps | success rate: peak improvement of 52% | Improved |
| multi-agent corridor reasoning versus CBSH-RTC | CBSH-RTC · eight MAPF maps | success rate: peak improvement of 40% | Improved |
Closest papers by meaning
- Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (AAAI 2024 · similarity 0.89)
- Learn to Follow: Decentralized Lifelong Multi-Agent Pathfinding via Planning and Learning (AAAI 2024 · similarity 0.88)
- Decentralized Monte Carlo Tree Search for Partially Observable Multi-Agent Pathfinding (AAAI 2024 · similarity 0.88)
- Windowed MAPF with Completeness Guarantees (AAAI 2025 · similarity 0.88)
- Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions (AAAI 2025 · similarity 0.88)
- Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution (AAAI 2024 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
