Convergence analysis of spatial-sampling-based algorithms for time-optimal smooth velocity planning
From MaRDI portal
Publication:2302843
DOI10.1007/s10957-019-01626-4zbMath1433.49042OpenAlexW2994768220WikidataQ126526102 ScholiaQ126526102MaRDI QIDQ2302843
Luca Consolini, Federico Cabassi, M. Laurini, Marco Locatelli
Publication date: 26 February 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01626-4
Numerical mathematical programming methods (65K05) Convex programming (90C25) Discrete approximations in optimal control (49M25)
Related Items (max. 100)
Minimum-time velocity profile planning for planar motion considering velocity, acceleration and jerk constraints ⋮ Time-optimal velocity planning by a bound-tightening technique
Uses Software
Cites Work
- Unnamed Item
- A unified framework for the numerical solution of optimal control problems using pseudospectral methods
- Minimum-time travel for a vehicle with acceleration limits: Theoretical analysis and receding-horizon implementation
- Semi-analytical minimum time solutions with velocity constraints for trajectory following of vehicles
- Time-optimal velocity planning by a bound-tightening technique
- An optimal complexity algorithm for minimum-time velocity planning
- Lectures on Modern Convex Optimization
- Rate of convergence for the Legendre pseudospectral optimal control of feedback linearizable systems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- The pseudospectral Legendre method for discretizing optimal control problems
- Time-Optimal Path Tracking for Robots: A Convex Optimization Approach
- Pseudospectral Methods for Optimal Motion Planning of Differentially Flat Systems
- Minimum-time speed optimisation over a fixed path
This page was built for publication: Convergence analysis of spatial-sampling-based algorithms for time-optimal smooth velocity planning
