Guilherme Daudt

k-Robust Conflict-Based Search with Continuous time for Multi-robot Coordination

Coordinating multiple robots is crucial for various real-life applications. Many Multi-Agent Path Finding (MAPF) algorithms have been proven to be successful in addressing this challenge. Nevertheless, some problems, such as unexpected delays during navigation, commonly arise when handling highlevel…