Python implementation of a bunch of multi-robot path-planning algorithms.
-
Updated
Apr 5, 2023 - Python
Python implementation of a bunch of multi-robot path-planning algorithms.
Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
Implementations of various algorithms used to solve the problem of Multi-Agent Pickup and Delivery (a generalization of Multi-Agent Path Finding).
A solution of Multi-Agent Path Finding problem
Minimal Python implementation of PIBT for MAPF
Minimal Python implementation of LaCAM* for MAPF
The Ranking Cost algorithm for multi-path routing of gridworld.(多智能体路径规划,电路规划)
MatrixWorld: A pursuit-evasion platform for safe multi-agent coordination and autocurricula
Multi Agent Path Finding openAI gym environment
Multi-agent Pathfinding through Team Coordination on Graphs with Risky Edges and Support Nodes i.e TCGRE problem (IROS-2023).
A collection of the ongoing research project into the Flatland competition.
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.
The game is a simulation of multiple agents with conflicting goals. The agents try to survive and move as many cells as they can. On the other hand their adversaries try to interrupt them.
UCL COMP0124 Multi-agent Artificial Intelligence (2023/24) Group Project
Pacman games with multi agents. Evaluating the performance of Pacman and the ghosts.
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."