simple multi-agent pathfinding (MAPF) visualizer for research usage
-
Updated
May 22, 2024 - C++
simple multi-agent pathfinding (MAPF) visualizer for research usage
A collection of the ongoing research project into the Flatland competition. Check the murphy-dev branch for efforts that are currently being explored.
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
Multi-agent pathfinding via Conflict Based Search
Multi-agent Pathfinding through Team Coordination on Graphs with Risky Edges and Support Nodes i.e TCGRE problem (IROS-2023).
A solution of Multi-Agent Path Finding problem
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
Pacman games with multi agents. Evaluating the performance of Pacman and the ghosts.
A Rust implementation of Continuous Conflict-Based Search for Multi-Agent Path Finding
Minimal Python implementation of LaCAM* for MAPF
Minimal Python implementation of PIBT for MAPF
Multi-agent Simulation Software for Crowd Crush Prevention and Store Layout Optimizer
MatrixWorld: A pursuit-evasion platform for safe multi-agent coordination and autocurricula
Python implementation of a bunch of multi-robot path-planning algorithms.
BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)
Add a description, image, and links to the multi-agent-path-finding topic page so that developers can more easily learn about it.
To associate your repository with the multi-agent-path-finding topic, visit your repo's landing page and select "manage topics."