Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
-
Updated
Oct 13, 2024 - C++
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)
A user-friendly implementation of the DARP algorithm for multi-agent coverage path planning (MCPP).
Fault-Tolerant Offline Multi-Agent Path Planning (AAAI-23)
Multi-agent Pathfinding through Team Coordination on Graphs with Risky Edges and Support Nodes i.e TCGRE problem (IROS-2023).
Decentralized multi-agent path planning via immitation learning.
Add a description, image, and links to the multi-agent-path-planning topic page so that developers can more easily learn about it.
To associate your repository with the multi-agent-path-planning topic, visit your repo's landing page and select "manage topics."