Research map / Multi-agent systems and games / Human-AI and goal-conditioned
Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem
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 |
|---|---|---|---|
| allow package exchange operations between adjacent robots (PERR instead of MAPF) | multi-robot routing · small benchmark maps | makespan: 8 -> 6 (String, CBS) | Helped |
| use flow-based ILP solver instead of adapted CBS | PERR solving · 20x15 grid maps | scalability | Mixed |
| use flow-based ILP solver instead of adapted CBS | PERR solving · brc202d game map | instances solved | Hurt |
Closest papers by meaning
- Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (AAAI 2024 · similarity 0.89)
- The Multi-Agent Transportation Problem (AAAI 2023 · similarity 0.88)
- Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery (AAAI 2019 · similarity 0.86)
- Inapproximability of Optimal Multi-Agent Pathfinding Problems (AAAI 2025 · similarity 0.85)
- Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology (AAAI 2024 · similarity 0.85)
- Heterogeneous Multi-Robot Graph Coverage with Proximity and Movement Constraints (AAAI 2025 · 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.