Time-optimal velocity planning by a bound-tightening technique
Federico Cabassi (federico.cabassi@studenti.unipr.it),
Luca Consolini (luca.consolini@unipr.it) and
Marco Locatelli (marco.locatelli@unipr.it)
Additional contact information
Federico Cabassi: Università di Parma
Luca Consolini: Università di Parma
Marco Locatelli: Università di Parma
Computational Optimization and Applications, 2018, vol. 70, issue 1, No 3, 90 pages
Abstract:
Abstract Range reduction techniques often considerably enhance the performance of algorithmic approaches for the solution of nonconvex problems. In this paper we propose a range reduction technique for a class of optimization problems with some special structured constraints. The procedure explores and updates the values associated to the nodes of a suitably defined graph. Convergence of the procedure and some efficiency issues, in particular related to the order into which the nodes of the graph are explored. The proposed technique is applied to solve problems arising from a relevant practical application, namely velocity planning along a given trajectory. The computational experiments show the efficiency of the procedure and its ability of returning solutions within times much lower than those of nonlinear solvers and compatible with real-time applications.
Keywords: Range reduction; Velocity planning; Minimum-time problems; Local search (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10589-017-9978-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:70:y:2018:i:1:d:10.1007_s10589-017-9978-6
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-017-9978-6
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).