IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v51y2020i12p2167-2180.html
   My bibliography  Save this article

Speed profile optimisation for intelligent vehicles in dynamic traffic scenarios

Author

Listed:
  • Zhuoyang Du
  • Dong Li
  • Kaiyu Zheng
  • Shan Liu

Abstract

In the autonomous navigation of intelligent vehicles, collision avoidance is essential for driving safety. Similar to the driving preference of human, the driving path and speed can be determined separately. This paper is concerned with speed profile optimisation problem for dynamic obstacle avoidance given the reference path. The optimisation consists of smoothness, risk, and efficiency terms with obstacle constraints. For task formulation, the s-t motion space is constructed to describe the motion of the ego vehicle and obstacles. Then the high-dimensional trajectory space is mapped to the low-dimensional s-t space for computational efficiency. The speed optimisation problem is transformed into a path searching problem considering collision avoidance and searching efficiency. RRT-based algorithm is proposed to search for the optimal speed profile in the s-t space asymptotically. In each searching step, node extension strategy is designed for the space exploring efficiency; then the tree structure is locally refined for asymptotic optimisation. The optimal speed profile is generated after the searching process converges and the speed profile is planned periodically. For performance evaluation, simulation tests in typical traffic conditions are conducted based on the SUMO (Simulation of Urban MObility) platform. Results show the effectiveness and efficiency of this method.

Suggested Citation

  • Zhuoyang Du & Dong Li & Kaiyu Zheng & Shan Liu, 2020. "Speed profile optimisation for intelligent vehicles in dynamic traffic scenarios," International Journal of Systems Science, Taylor & Francis Journals, vol. 51(12), pages 2167-2180, September.
  • Handle: RePEc:taf:tsysxx:v:51:y:2020:i:12:p:2167-2180
    DOI: 10.1080/00207721.2020.1793227
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2020.1793227
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2020.1793227?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tsysxx:v:51:y:2020:i:12:p:2167-2180. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.