Research map / Learning theory and algorithms / Combinatorial and search optimization
Solving Multiagent Planning Problems with Concurrent Conditional Effects
Daniel Furelos-Blanco, Anders Jonsson
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 the compilation instead of CJR | Maze planning · Maze | coverage (instances solved): 11 -> 6 | Hurt |
| Use the compilation instead of SB | BoxPushing planning · BoxPushing | coverage (instances solved): 18 -> 16 | Hurt |
| Allow unbounded joint-action size instead of using a bound of 2 (ablation) | Compilation · BoxPushing | coverage (instances solved): 9 -> 16 | Improved |
| Allow unbounded joint-action size instead of using a bound of 4 (ablation) | Compilation · BoxPushing | coverage (instances solved): 15 -> 16 | Improved |
| Bound joint-action size to 2 instead of allowing it to be unbounded (ablation) | Compilation · Maze | coverage (instances solved): 6 -> 13 | Improved |
| Bound joint-action size to 2 instead of allowing it to be unbounded (ablation) | Compilation · Workshop | coverage (instances solved): 13 -> 15 | Improved |
| Bound joint-action size to 4 instead of allowing it to be unbounded (ablation) | Compilation · TableMover | coverage (instances solved): 15 -> 12 | Hurt |
| Use affordance-based SB instead of the compilation | BoxPushing planning · BoxPushing | coverage (instances solved): 16 -> 18 | Improved |
| Represent each joint action through sequential selection, application, and reset phases | Concurrent multiagent planning compilation · Maze scalability | grounded actions: The naive approach cannot solve instances with 7 or more agents; our approach can solve instances with 100 agents. | Improved |
Closest papers by meaning
- An Effective Polynomial Technique for Compiling Conditional Effects Away (AAAI 2024 · similarity 0.86)
- Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions (AAAI 2025 · similarity 0.86)
- PathWise: Planning through World Model for Automated Heuristic Design via Self-Evolving LLMs (ICML 2026 · similarity 0.86)
- Agent-Oriented Planning in Multi-Agent Systems (ICLR 2025 · similarity 0.86)
- Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities (AAAI 2025 · similarity 0.85)
- Multiagent Gumbel MuZero: Efficient Planning in Combinatorial Action Spaces (AAAI 2024 · similarity 0.85)
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.
