Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding
Not on the map. Why?
Abstract (arXiv)
Multi-Agent Reinforcement Learning (MARL) based Multi-Agent Path Finding (MAPF) has recently gained attention due to its efficiency and scalability. Several MARL-MAPF methods choose to use communication to enrich the information one agent can perceive. However, existing works still struggle in structured environments with high obstacle density and a high number of agents. To further improve the performance of the communication-based MARL-MAPF solvers, we propose a new method, Ensembling Prioritized Hybrid Policies (EPH). We first propose a selective communication block to gather richer information for better agent coordination within multi-agent environments and train the model with a Q learning-based algorithm. We further introduce three advanced inference strategies aimed at bolstering performance during the execution phase. First, we hybridize the neural policy with single-agent expert guidance for navigating conflict-free zones. Secondly, we propose Q value-based methods for prioritized resolution of conflicts as well as deadlock situations. Finally, we introduce a robust ensemble method that can efficiently collect the best out of multiple possible solutions. We empirically evaluate EPH in complex multi-agent environments and demonstrate competitive performance against state-of-the-art neural methods for MAPF. We open-source our code at https://github.com/ai4co/eph-mapf.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 29 of its 50 references that are in the map. First posted on arXiv 12 Mar 2024.
Builds on
29 of 50 references.
References · 29
- 2017Attention Is All You Needcited by 59,932
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2015Prioritized Experience Replaycited by 1,070
- 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
- 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 266
- 2019Stabilizing Transformers for Reinforcement Learningcited by 262
- 2019Multi-Agent Pathfinding: Definitions, Variants, and Benchmarkscited by 197
- 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
- 2018PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learningcited by 89
17 more
- 2023GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-timecited by 82
- 2018Searching with Consistent Prioritization for Multi-Agent Path Findingcited by 80
- 2020Lifelong Multi-Agent Path Finding in Large-Scale Warehousescited by 79
- 2023DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimizationcited by 77
- 2023RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmarkcited by 70
- 2020EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Findingcited by 67
- 2020PRIMAL2: Pathfinding via Reinforcement and Imitation Multi-Agent Learning -- Lifelongcited by 61
- 2019Priority Inheritance with Backtracking for Iterative Multi-agent Path Findingcited by 55
- 2023SCRIMP: Scalable Communication for Reinforcement- and Imitation-Learning-Based Multi-Agent Pathfindingcited by 35
- 2021Learning Selective Communication for Multi-Agent Path Findingcited by 32
- 2021Distributed Heuristic Multi-Agent Path Finding with Communicationcited by 31
- 2017Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environmentscited by 21
- 2022Multi-Agent Path Finding with Prioritized Communication Learningcited by 17
- 2023SACHA: Soft Actor-Critic with Heuristic-Based Attention for Partially Observable Multi-Agent Path Findingcited by 6
- 2023Learning Team-Based Navigation: A Review of Deep Reinforcement Learning Techniques for Multi-Agent Pathfindingcited by 5
- 2023RDE: A Hybrid Policy Framework for Multi-Agent Path Finding Problemcited by 4
- 2024HiMAP: Learning Heuristics-Informed Policies for Large-Scale Multi-Agent Pathfindingcited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 5; 2026: 1.
7 papers.
- 2024Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large Scale Imitation Learning for MAPFcited by 10
- 2025Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuningcited by 5
- 2025Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfindingcited by 3
- 2025LLMDR: LLM-Driven Deadlock Detection and Resolution in Multi-Agent Pathfindingcited by 1
- 2025USPR: Learning a Unified Solver for Profiled Routingcited by 1
- 2026Learning to Communicate Locally for Large-Scale Multi-Agent Pathfindingcited by 1
- 2025Towards Information-Optimized Multi-Agent Path Finding: A Hybrid Framework with Reduced Inter-Agent Information Sharingcited by 0
- 2026Learning to Communicate Locally for Large-Scale Multi-Agent Pathfinding8 May 2026
- 2025Towards Information-Optimized Multi-Agent Path Finding: A Hybrid Framework with Reduced Inter-Agent Information Sharing10 Oct 2025
- 2025Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning30 Jun 2025
- 2025Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding25 May 2025
- 2025USPR: Learning a Unified Solver for Profiled Routing8 May 2025
- 2025LLMDR: LLM-Driven Deadlock Detection and Resolution in Multi-Agent Pathfinding2 Mar 2025
- 2024Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large Scale Imitation Learning for MAPF22 Sep 2024