[IROS 2024] EPH: Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding
-
Updated
Oct 8, 2024 - Python
[IROS 2024] EPH: Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding
CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces (AAMAS-22)
Learnable MAPF. “Distributed Heuristic Multi-Agent Path Finding with Communication” (DHC) algorithm from ICRA 2021 is implemented and benchmarked in out-of-distribution (OOD) scenarios. A new robust training loop to handle communication failures is introduced.
Multiagent Pathfinding Problem for agricultural swarm agents. Used CBS algorithm for search. To know more, refer to the report attached in the link below.
Multi-agent Pathfinding through Team Coordination on Graphs with Risky Edges and Support Nodes i.e TCGRE problem (IROS-2023).
This repository collects reference implementations for training and evaluating reinforcement learning agents on multi-agent pathfinding problems. The environments explicitly support deadlocks so that agents must cooperate to resolve them.
Add a description, image, and links to the multi-agent-pathfinding topic page so that developers can more easily learn about it.
To associate your repository with the multi-agent-pathfinding topic, visit your repo's landing page and select "manage topics."