Skip to content Skip to navigation

Real-Time Multi-Agent Planning

We develop algorithms for multi-agent motion planning in real-time dynamic environments. Our research investigates the use of novel discrete representations of the environment, and the use of anytime dynamic planners that harness multiple domains of representation. We port these algorithms on the GPU to exploit the benefits of massive parallelization, while preserving the original properties of the approach.