mapf topic
Multi-Agent-Path-Finding
Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
CL-CBS
An Efficient Multi-Agent Path Finding Solver for Car-Like Robots
Continuous-CBS
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.
AA-SIPP-m
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 continuo...
mapf-IR
Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)
jaxmapp
JAX-based implementation for multi-agent path planning (MAPP) in continuous spaces.
pibt2
Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)
lacam
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
otimapp
Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)
pogema
POGEMA stands for Partially-Observable Grid Environment for Multiple Agents. This is a grid-based environment that was specifically designed to be flexible, tunable and scalable. It can be tailored to...