Research map / Multi-agent systems and games / Human-AI and goal-conditioned
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 high-level focal search with EES using online cost-to-go estimates | ECBS · random-32-32-20 | runtime and success rate | Helped |
| Add all four improvements: bypassing, conflict prioritization, symmetry reasoning, and WDG | EECBS · six MAPF benchmark maps | runtime and success rate | Helped |
| Add all four improvements | EECBS · random map, 1,081 instances solved by both | average solution cost: 1,967 -> 1,958 | No clear effect |
| Use relaxed instead of standard CBS bypassing conditions (ablation) | EECBS · random-32-32-20 | runtime | Helped |
| Prioritize cardinal and semi-cardinal conflicts (ablation) | EECBS · random-32-32-20 | runtime | Helped |
| Add symmetry reasoning (ablation) | EECBS · random-32-32-20 | runtime | Helped |
| Add adaptive WDG rather than omit WDG (ablation) | EECBS · random-32-32-20 | lower-bound improvement Δlb: 36.1 -> 54.8 | Helped |
| Compute WDG adaptively rather than for all CT nodes (ablation) | EECBS · random-32-32-20, w=1.04 | runtime spent computing WDG: 87.9% -> 77.6% | Helped |
| Add adaptive WDG (ablation) | EECBS · random-32-32-20 | runtime | Mixed |
| Use EECBS+ rather than ECBS | MAPF algorithms · random map, 2,000 instances | instances solved only by each algorithm: 444 instances are solved only by EECBS+; 0 instances are solved only by ECBS | Helped |
Closest papers by meaning
- Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding (AAAI 2022 · similarity 0.95)
- Multi-Agent Path Finding for Large Agents (AAAI 2019 · similarity 0.91)
- Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (AAAI 2024 · similarity 0.89)
- Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic (AAAI 2025 · similarity 0.88)
- Decentralized Monte Carlo Tree Search for Partially Observable Multi-Agent Pathfinding (AAAI 2024 · similarity 0.88)
- Inapproximability of Optimal Multi-Agent Pathfinding Problems (AAAI 2025 · 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.