Research map / Multi-agent systems and games / Human-AI and goal-conditioned
Symmetry Breaking for k-Robust Multi-Agent Path Finding
Zhe Chen, Daniel D. Harabor, Jiaoyang Li, Peter J. Stuckey
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 |
|---|---|---|---|
| Add symmetry-conflict reasoning to K-Robust CBS | K-Robust CBS · Benchmark maps | performance | Improved |
| Add symmetry-conflict reasoning to K-Robust CBS | K-Robust CBS · Flatland train scheduling problems | performance | Improved |
Closest papers by meaning
- Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding (AAAI 2019 · similarity 0.91)
- Windowed MAPF with Completeness Guarantees (AAAI 2025 · similarity 0.87)
- Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic (AAAI 2025 · similarity 0.87)
- Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology (AAAI 2024 · similarity 0.86)
- Decentralized Monte Carlo Tree Search for Partially Observable Multi-Agent Pathfinding (AAAI 2024 · similarity 0.86)
- LNS2+RL: Combining Multi-agent Reinforcement Learning with Large Neighborhood Search in Multi-agent Path Finding (AAAI 2025 · similarity 0.86)
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.
