Research map / Multi-agent systems and games / Human-AI and goal-conditioned
Solving Sum-of-Costs Multi-Agent Pathfinding with Answer-Set Programming
Rodrigo N. Gómez, Carlos Hernández, Jorge A. Baier
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 full encoding (grid-independent penalties, linear conflicts, Dijkstra pruning) instead of basic encoding (ablation) | ASP MAPF · Empty 8x8 grid | breaking point: 26 -> 32 | Improved |
| use full encoding instead of basic encoding (ablation) | ASP MAPF · Empty 16x16 grid | breaking point: 48 -> 70 | Improved |
| use full encoding instead of basic encoding (ablation) | ASP MAPF · Empty 32x32 grid | breaking point: 20 -> 78 | Improved |
| use ASP full encoding instead of ICBS-h | MAPF solver · Empty 8x8 grid | breaking point: 16 -> 32 | Improved |
| use ASP full encoding instead of ICBS-h | MAPF solver · Empty 32x32 grid | breaking point: 108 -> 78 | Hurt |
| use ASP full encoding instead of ICBS-h | MAPF solver · Empty 16x16 grid | breaking point: 52 -> 70 | Hurt |
| add cost-to-go (Dijkstra) pruning rule (CG) (ablation) | ASP-GI-LC · 20x20 random grids | average solving time: 1.74 times smaller | Improved |
| add cost-to-go (Dijkstra) pruning rule (CG) (ablation) | ASP-GI-LC · 20x20 random grids | grounding runtime: factor 1.98 decrease | Improved |
| linear conflict encoding instead of quadratic (ablation) | ASP · 20x20 random grids | success rate | Improved |
| grid-independent instead of grid-dependent penalties (ablation) | ASP · 20x20 random grids | success rate | No clear effect |
| grid-independent instead of grid-dependent penalties (ablation) | ASP · 8x8 random grids | success rate | Improved |
| use USC instead of branch-and-bound optimization in clingo (ablation) | ASP-GI-LC-CG · Warehouse | success rate | Improved |
Closest papers by meaning
- Decentralized Monte Carlo Tree Search for Partially Observable Multi-Agent Pathfinding (AAAI 2024 · similarity 0.87)
- Learn to Follow: Decentralized Lifelong Multi-Agent Pathfinding via Planning and Learning (AAAI 2024 · similarity 0.87)
- Inapproximability of Optimal Multi-Agent Pathfinding Problems (AAAI 2025 · similarity 0.87)
- Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions (AAAI 2025 · similarity 0.87)
- Windowed MAPF with Completeness Guarantees (AAAI 2025 · similarity 0.86)
- MAPF-GPT: Imitation Learning for Multi-Agent Pathfinding at Scale (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.
