BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
-
Updated
Oct 4, 2024 - C++
BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
Used Multi Agent Path Finding (MAPF) based on Conflict Based Search (CBS) with A* algorithm implementation to successfully navigate n number of agents through any map without any collision.
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
The Multi Agent Transportation Problem: Solvers, Evaluations, and Computer-Assisted Proofs
Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
A collection of the ongoing research project into the Flatland competition. Check the murphy-dev branch for efforts that are currently being explored.
Minimal Python implementation of LaCAM* for MAPF
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)
simple multi-agent pathfinding (MAPF) visualizer for research usage
Social navigation with Mixed Strategy Nash Equilibrium
A Qt frame work continuous mapf visualizer.
MatrixWorld: A pursuit-evasion platform for safe multi-agent coordination and autocurricula
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).
UCL COMP0124 Multi-agent Artificial Intelligence (2023/24) Group Project
A solution of Multi-Agent Path Finding problem
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
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."