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.

Time-optimal velocity planning by a bound-tightening technique / Cabassi, Federico; Consolini, Luca; Locatelli, Marco. - In: COMPUTATIONAL OPTIMIZATION AND APPLICATIONS. - ISSN 0926-6003. - 70:1(2018), pp. 61-90. [10.1007/s10589-017-9978-6]

Time-optimal velocity planning by a bound-tightening technique

Cabassi, Federico;Consolini, Luca;Locatelli, Marco
2018

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.
Time-optimal velocity planning by a bound-tightening technique / Cabassi, Federico; Consolini, Luca; Locatelli, Marco. - In: COMPUTATIONAL OPTIMIZATION AND APPLICATIONS. - ISSN 0926-6003. - 70:1(2018), pp. 61-90. [10.1007/s10589-017-9978-6]
File in questo prodotto:
File Dimensione Formato  
Time-optimal velocity planning by a bound-tightening technique.pdf

accesso aperto

Descrizione: Articolo in preprint
Tipologia: Documento in Pre-print
Licenza: Creative commons
Dimensione 455.21 kB
Formato Adobe PDF
455.21 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11381/2841131
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 6
social impact