Python implementation of a bunch of multi-robot path-planning algorithms.
-
Updated
Apr 5, 2023 - Python
Python implementation of a bunch of multi-robot path-planning algorithms.
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
Multi-agent pathfinding via Conflict Based Search
BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
simple multi-agent pathfinding (MAPF) visualizer for research usage
Conflict-based search for multi-agent path finding (MAPF)
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
Concrete Multi-Agent Path Planning Enabling Kinodynamically Aggressive Maneuvers (npj Robotics 2026)
Graph Attention-Guided Search for Dense Multi-Agent Pathfinding (AAAI-26)
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)
(IJRR) Mixed Strategy Nash Equilibrium for Crowd Navigation
A system for running Multi-Agent Path Finding (MAPF) experiments, with multiple implemented algorithms.
To associate your repository with the multi-agent-path-finding topic, visit your repo's landing page and select "manage topics."