Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)
-
Updated
Jan 14, 2023 - C++
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)
simple multi-agent pathfinding (MAPF) visualizer for research usage
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
Based on David Silver's paper "Cooperative Pathfinding"
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)
Multi agent path planning with A*
Multi-agent Simulation Software for Crowd Crush Prevention and Store Layout Optimizer
Multi Agent Path Finding assignment for CSCI-360 at USC.
The Multi Agent Transportation Problem: Solvers, Evaluations, and Computer-Assisted Proofs
A Qt frame work continuous mapf visualizer.
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."