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

A new min-max methodology for computing optimised obstacle avoidance steering manoeuvres of ground vehicles

Author

Listed:
  • Stratis Kanarachos

Abstract

In this paper, a new methodology for computing optimised obstacle avoidance steering manoeuvres for ground vehicles is presented and discussed. Most of the existing methods formulate the obstacle avoidance problem as an optimal control problem which is hard to solve or as a numerical optimisation problem with a large number of unknowns. This method is based on a reformulation of Pontryagin's Maximum Principle and leads to the solution of an adjustable time optimal controller. The control input is significantly simplified and permits its application in a sample and hold sense. Furthermore, with the proposed approach the maximum tyre forces exerted during the manoeuvre are minimised. In this study, it is shown how to ‘warm start’ the proposed algorithm and which constraints to ‘relax’. Numerical examples and benchmark tests illustrate the performance of the proposed controller and compare it with other standard controllers. A sensitivity analysis for different vehicle parameters is performed and finally conclusions are drawn. A significant advantage of the method is the small computational complexity. The overall simplicity of the controller makes it attractive for application on autonomous vehicles.

Suggested Citation

  • Stratis Kanarachos, 2014. "A new min-max methodology for computing optimised obstacle avoidance steering manoeuvres of ground vehicles," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(5), pages 1042-1057, May.
  • Handle: RePEc:taf:tsysxx:v:45:y:2014:i:5:p:1042-1057
    DOI: 10.1080/00207721.2012.745020
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2012.745020?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:45:y:2014:i:5:p:1042-1057. 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.