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*

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

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

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

Multi-agent pathfinding via Conflict Based Search

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

Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.

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

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

Based on David Silver's paper "Cooperative Pathfinding"

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

A solution of Multi-Agent Path Finding problem

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

Minimal Python implementation of PIBT for MAPF

The purpose of this simulator is simulates and allows visualization of the evacuation process of people located in buildings during emergencies.

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

Minimal Python implementation of LaCAM* for MAPF

Godot Engine Multi-Agent Pathfinding

Multi Agent Path Finding openAI gym environment