One of the primary challenges for autonomous robotics in uncertain and dynamic
environments is planning and executing a collision-free path. Hybrid dynamic obstacles …

We present a novel approach for interactive navigation and planning of multiple agents in
crowded scenes with moving obstacles. Our formulation uses a precomputed roadmap that …

We present a novel algorithm for navigating a large number of independent agents in
complex and dynamic environments. We compute adaptive roadmaps to perform global path …

We present novel randomized algorithms for solving global motion planning problems that
exploit the computational capabilities of many-core GPUs. Our approach uses thread and …

We consider a local planner that utilizes model predictive control to locally deviate from a
prescribed global path in response to dynamic environments, taking into account the system …

We present a novel k-nearest neighbor search algorithm (KNNS) for proximity computation
in motion planning algorithm that exploits the computational capabilities of many-core GPUs …

Multi-agent pathfinding is the problem of finding collision-free paths for a set of agents.
Solving this problem optimally is computationally hard, therefore many techniques based on …

In this paper, we propose an indoor data model named Indoor Navigation Space Model
(INSM). It is designed to support automatic derivation of the connectivity graph of a building …

We present a novel algorithm for collision-free navigation of a large number of independent
agents in complex and dynamic environments. We introduce adaptive roadmaps to perform …

A central problem in games is planning high-quality paths for characters avoiding obstacles
in the environment. Current games require a path planner that is fast (to ensure real-time …