4 papers · 1 filter
Collisionless Multi-Agent Path Planning in the Hamilton-Jacobi Formulation
Christian Parkinson, Adan Baca, Huy Nguyen
We present a method for collisionless multi-agent path planning using the Hamilton-Jacobi-Bellman equation. Because the method is rooted in optimal control theory and partial diffe…
A Hopf-Lax Type Formula for Multi-Agent Path Planning with Pattern Coordination
Christian Parkinson, Adan Baca
We present an algorithm for a multi-agent path planning problem with pattern coordination based on dynamic programming and a Hamilton-Jacobi-Bellman equation. This falls broadly in…
A Scalable Method for Optimal Path Planning on Manifolds via a Hopf-Lax Type Formula
Edward Huynh, Christian Parkinson
We consider the problem of optimal path planning on a manifold which is the image of a smooth function. Optimal path-planning is of crucial importance for motion planning, image pr…
An Efficient Semi-Real-Time Algorithm for Path Planning in the Hamilton-Jacobi Formulation
Christian Parkinson, Kyle Polage
We present a semi-real-time algorithm for minimal-time optimal path planning based on optimal control theory, dynamic programming, and Hamilton-Jacobi (HJ) equations. Partial diffe…