IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v138y2008i2d10.1007_s10957-008-9381-7.html
   My bibliography  Save this article

Minimum-Time Travel for a Vehicle with Acceleration Limits: Theoretical Analysis and Receding-Horizon Implementation

Author

Listed:
  • E. Velenis

    (Brunel University
    Georgia Institute of Technology)

  • P. Tsiotras

    (Georgia Institute of Technology)

Abstract

A methodology is proposed to generate minimum-time optimal velocity profiles for a vehicle with prescribed acceleration limits along a specified path. The necessary optimality conditions are explicitly derived, allowing the construction of the optimal solution semianalytically. A receding horizon implementation is also proposed for the on-line implementation of the velocity optimizer. Robustness of the receding horizon algorithm is guaranteed by the use of an adaptive scheme that determines the planning and execution horizons. Application to a real-life scenario with a comparison between the infinite and finite receding horizon schemes provides a validation of the proposed methodology.

Suggested Citation

  • E. Velenis & P. Tsiotras, 2008. "Minimum-Time Travel for a Vehicle with Acceleration Limits: Theoretical Analysis and Receding-Horizon Implementation," Journal of Optimization Theory and Applications, Springer, vol. 138(2), pages 275-296, August.
    • Handle: RePEc:spr:joptap:v:138:y:2008:i:2:d:10.1007_s10957-008-9381-7
    DOI: 10.1007/s10957-008-9381-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-008-9381-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-008-9381-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Federico Cabassi & Luca Consolini & Marco Locatelli, 2018. "Time-optimal velocity planning by a bound-tightening technique," Computational Optimization and Applications, Springer, vol. 70(1), pages 61-90, May.
    2. Luca Consolini & Mattia Laurini & Marco Locatelli & Federico Cabassi, 2020. "Convergence Analysis of Spatial-Sampling-Based Algorithms for Time-Optimal Smooth Velocity Planning," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 1083-1108, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:138:y:2008:i:2:d:10.1007_s10957-008-9381-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.