The authors regret that the printed version lacks an assumption on Problem 5. Namely, we need to add the following conditions: Assumption (1): [Formula presented] The authors would like to apologize for any inconvenience caused.
Corrigendum to “An optimal complexity algorithm for minimum-time velocity planning” (Systems & Control Letters (2017) 103 (50–57) (S0167691117300245) (10.1016/j.sysconle.2017.02.001)) / Consolini, L.; Locatelli, M.; Minari, A.; Piazzi, A.. - In: SYSTEMS & CONTROL LETTERS. - ISSN 0167-6911. - 108:(2017), p. 80. [10.1016/j.sysconle.2017.09.006]
Corrigendum to “An optimal complexity algorithm for minimum-time velocity planning” (Systems & Control Letters (2017) 103 (50–57) (S0167691117300245) (10.1016/j.sysconle.2017.02.001))
Consolini L.
;Locatelli M.;Minari A.;Piazzi A.
2017-01-01
Abstract
The authors regret that the printed version lacks an assumption on Problem 5. Namely, we need to add the following conditions: Assumption (1): [Formula presented] The authors would like to apologize for any inconvenience caused.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
