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

An Efficient Multi-Agent Path Finding Solver for Car-Like Robots

Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.

This is a multi-agent path planning(also known as Multi-Agent Path Finding, MAPF) algorithm package for ROS

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

Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allowed to follow any-angle path on the grid). Timeline is continuous, i.e. action durations are not explicitly discretized into timesteps. Different agents' size and moving speed are supported. Planning is carried…

📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)

Multi-agent pathfinding via Conflict Based Search

Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)

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

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

JAX-based implementation for multi-agent path planning (MAPP) in continuous spaces.

Multi-Agent Path Finding in C++ (WHCA*, iWHCA*, WCBS)

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

Multi-Agent Pickup and Delivery implementation

[IROS 2024] EPH: Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding

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

Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)

CBS, MA-CBS algorithms and evaluation of these algorithms.

Quick Multi-Robot Motion Planning by Combining Sampling and Search (IJCAI-23)