The Multi Agent Transportation Problem: Solvers, Evaluations, and Computer-Assisted Proofs
-
Updated
Sep 11, 2024 - C++
The Multi Agent Transportation Problem: Solvers, Evaluations, and Computer-Assisted Proofs
Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.
Conflict-based search for multi-agent path finding (MAPF)
naive implementations of Multi-Agent Path Finding algorithms
Add a description, image, and links to the conflict-based-search topic page so that developers can more easily learn about it.
To associate your repository with the conflict-based-search topic, visit your repo's landing page and select "manage topics."