Research

All

dynamic environment

exploration

multi-agent planning

multi-objective planning

optimality bounds

resource constrained planning

state lattice planning

trajectory optimization

traveling salesman problems

This research is in collaboration with Anoop Bhat from Prof. Howie Choset’s group at CMU and Alle...

Multi-Agent Path Finding (MAPF) computes a set of collision-free paths for multiple agents from t...

Multi-robot systems prevail over the past decade. In particular, these systems provide an intelli...

Multi-Agent Path Finding (MAPF) computes a set of collision-free paths for multiple agents connec...

Robots have the potential to perform search for a variety of applications in different scenarios....

Given a graph with non-negative scalar edge costs, the well-known shortest path problem (SPP) req...

Autonomous exploration is crucial for applications where environments are often inaccessible or h...

Resource constrained path planning seeks an optimal path subject a variety of resource constraint...

For many motion planning problems, there is currently no algorithm available in the literature to...

Search-based planning that uses a state lattice has been successfully applied in many application...