Efficient and Scalable Path-Planning Algorithms for Curvature Constrained Motion in the Hamilton-Jacobi Formulation

arXiv2304.12377MaRDI QIDQ6509798FDOQ6509798

Abstract: We present a partial-differential-equation-based optimal path-planning framework for curvature constrained motion, with application to vehicles in 2- and 3-spatial-dimensions. This formulation relies on optimal control theory, dynamic programming, and a Hamilton-Jacobi-Bellman equation. Many authors have developed similar models and employed grid-based numerical methods to solve the partial differential equation required to generate optimal trajectories. However, these methods can be inefficient and do not scale well to high dimensions. We describe how efficient and scalable algorithms for solutions of high dimensional Hamilton-Jacobi equations can be developed to solve similar problems very efficiently, even in high dimensions, while maintaining the Hamilton-Jacobi formulation. We demonstrate our method with several examples.

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Applications of optimal control and differential games (49N90) Application models in control theory (93C95)

This page was built for publication: Efficient and Scalable Path-Planning Algorithms for Curvature Constrained Motion in the Hamilton-Jacobi Formulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509798)