LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Convergence Analysis of Spatial-Sampling-Based Algorithms for Time-Optimal Smooth Velocity Planning

Photo from archive.org

For a vehicle on an assigned path, we consider the problem of finding the time-optimal speed law that satisfies kinematic and dynamic constraints, related to maximum speed and maximum tangential… Click to show full abstract

For a vehicle on an assigned path, we consider the problem of finding the time-optimal speed law that satisfies kinematic and dynamic constraints, related to maximum speed and maximum tangential and transversal acceleration. We show that the problem can be solved with an arbitrarily high precision by performing a finite element lengthwise path discretization and using a quadratic spline for interpolation. In particular, we show that an $$\epsilon $$ ϵ -optimal solution can be found in a time which is a polynomial function of $$\epsilon ^{-1}$$ ϵ - 1 , more precisely its eighth power.

Keywords: time optimal; time; convergence analysis; spatial sampling; sampling based; analysis spatial

Journal Title: Journal of Optimization Theory and Applications
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.