An Efficient Multi-Agent Path Finding Solver for Car-Like Robots
-
Updated
Jul 31, 2023 - C++
An Efficient Multi-Agent Path Finding Solver for Car-Like Robots
Conflict-based search for multi-agent path finding (MAPF)
Code accompanying the RA-L / ICRA 2020 paper: "Online Trajectory Generation with Distributed Model Predictive Control for Multi-Robot Motion Planning"
A trajectory planning framework for multiple robots: paper accepted in IEEE T-RO
Conflict-based search for multi-agent path finding
Repository associated with paper titled "AMSwarm: An Alternating Minimization Approach for Safe Motion Planning of Quadrotor Swarms in Cluttered Environments", presented at IEEE ICRA 2023.
The multiagent extension for the PDDL parser
Stochastic Conflict-Based Allocation
Total War Battle simulator for AI research
naive implementations of Multi-Agent Path Finding algorithms
Scalable MCTS for team scenarios
Open-source framework for adaptive manufacturing processes scheduling
Multiboat minimum makespan formation planning
Conflict-based search for optimal multi-agent pathfinding
Factored Interactive POMDP solver based on symbolic Perseus.
multi-agent moving target pursuit in an unknown 4-connected grid world with persistent coverage planning
The ProSeCo Planning C++ library
Code for the paper "Planning Not to Talk: Multiagent Systems that are Robust to Communication Loss".
Board-and-card games are those which involve higher level of uncertainty as it includes the probability of getting the right card and the moves made by other players. We look to model such games as Markov Games and find an optimal policy through the Minimax – Q algorithm. This will also be a test for the Minimax – Q algorithm to check how it per…
Add a description, image, and links to the multiagent-planning topic page so that developers can more easily learn about it.
To associate your repository with the multiagent-planning topic, visit your repo's landing page and select "manage topics."