An optimal complexity algorithm for minimum-time velocity planning

DOI10.1016/j.sysconle.2017.02.001zbMath1370.93179OpenAlexW2604921123MaRDI QIDQ2407231

Andrea Minari, Aurelio Piazzi, Luca Consolini, Marco Locatelli

Publication date: 29 September 2017

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2017.02.001

zbMATH Keywords

optimizationmotion planninghidden convexityminimum-time problems

Mathematics Subject Classification ID

Related Items (6)

Graph-based algorithms for the efficient solution of optimization problems involving monotone functions ⋮ A curvature-segmentation-based minimum time algorithm for autonomous vehicle velocity planning ⋮ A solution of the minimum-time speed planning problem based on lattice theory ⋮ Time-optimal velocity planning by a bound-tightening technique ⋮ Convergence analysis of spatial-sampling-based algorithms for time-optimal smooth velocity planning ⋮ Shortest path with acceleration constraints: complexity and approximation algorithms

Cites Work

• Unnamed Item

This page was built for publication: An optimal complexity algorithm for minimum-time velocity planning