Research map / Multi-agent systems and games / Human-AI and goal-conditioned
Dynamic Agent Grouping ECBS: Scaling Windowed Multi-Agent Path Finding with Completeness Guarantees
Tiannan Zhang, Rishi Veerapaneni, Shao-Hung Chan, Jiaoyang Li, Maxim Likhachev
Read the paperCheck your idea against 137,217 papers
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 |
|---|---|---|---|
| use DAG-ECBS instead of SS-CBS | windowed complete MAPF · MAPF benchmark maps (random-32-32-20, warehouse, ht_chantry, den520d) | max agents solved (>50% success) | Improved |
| add heuristic updates and agent grouping (DAG-ECBS vs windowed ECBS) | windowed ECBS · random-32-32-20 and warehouse (congested) | success rate | Improved |
| DAG-ECBS vs windowed ECBS at large windows (ablation) | windowed ECBS · ht_chantry and den520d (large maps) | success rate | Hurt |
| increase window size (ablation) | DAG-ECBS and windowed ECBS · MAPF benchmark maps (random-32-32-20, warehouse, ht_chantry, den520d) | per-iteration runtime | Hurt |
| increase window size (ablation) | DAG-ECBS (w=2) · warehouse | cost per agent | Improved |
| increase window size (ablation) | DAG-ECBS (w=2) · random, ht_chantry, den520d | cost per agent | Hurt |
| increase suboptimality w (ablation) | DAG-ECBS (W=4) · MAPF benchmark maps (random-32-32-20, warehouse, ht_chantry, den520d) | per-iteration runtime | Improved |
| increase suboptimality w (ablation) | DAG-ECBS (W=4) · MAPF benchmark maps (random-32-32-20, warehouse, ht_chantry, den520d) | solution cost | Hurt |
| increase suboptimality w above 1 (ablation) | windowed ECBS (W=4) · MAPF benchmark maps (random-32-32-20, warehouse, ht_chantry, den520d) | runtime and cost | No clear effect |
Closest papers by meaning
- Windowed MAPF with Completeness Guarantees (AAAI 2025 · similarity 0.93)
- Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions (AAAI 2025 · similarity 0.90)
- Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (AAAI 2024 · similarity 0.90)
- Decentralized Monte Carlo Tree Search for Partially Observable Multi-Agent Pathfinding (AAAI 2024 · similarity 0.89)
- Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution (AAAI 2024 · similarity 0.89)
- Speedup Techniques for Switchable Temporal Plan Graph Optimization (AAAI 2025 · similarity 0.89)
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.
