Python implementation of a bunch of multi-robot path-planning algorithms.

Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*

BCP-MAPF – branch-and-cut-and-price for multi-agent path finding

Conflict-based search for multi-agent path finding (MAPF)

Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)

LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)

Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.

Multi-agent pathfinding via Conflict Based Search

Implementations of various algorithms used to solve the problem of Multi-Agent Pickup and Delivery (a generalization of Multi-Agent Path Finding).

simple multi-agent pathfinding (MAPF) visualizer for research usage

Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)

Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)

Minimal Python implementation of PIBT for MAPF

Based on David Silver's paper "Cooperative Pathfinding"

The Ranking Cost algorithm for multi-path routing of gridworld.(多智能体路径规划，电路规划)

A solution of Multi-Agent Path Finding problem

Minimal Python implementation of LaCAM* for MAPF

The backend of Hive system for smart automated warehouses.

MAPF Version 2.

Godot Engine Multi-Agent Pathfinding