Time-Optimal Paths for Simple Cars with Moving Obstacles in the Hamilton-Jacobi Formulation
Optimization and Control
2021-11-22 v1
Abstract
We consider the problem of time-optimal path planning for simple nonholonomic vehicles. In previous similar work, the vehicle has been simplified to a point mass and the obstacles have been stationary. Our formulation accounts for a rectangular vehicle, and involves the dynamic programming principle and a time-dependent Hamilton-Jacobi-Bellman (HJB) formulation which allows for moving obstacles. To our knowledge, this is the first HJB formulation of the problem which allows for moving obstacles. We design an upwind finite difference scheme to approximate the equation and demonstrate the efficacy of our model with a few synthetic examples.
Keywords
Cite
@article{arxiv.2111.09951,
title = {Time-Optimal Paths for Simple Cars with Moving Obstacles in the Hamilton-Jacobi Formulation},
author = {Christian Parkinson and Madeline Ceccia},
journal= {arXiv preprint arXiv:2111.09951},
year = {2021}
}