IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v11y2017i4p357-368.html
   My bibliography  Save this article

A real-time lane changing and line changing algorithm for driving simulators based on virtual driver behavior

Author

Listed:
  • H Naseri
  • A Nahvi
  • F Salimi Naneh Karan

Abstract

Driving simulators have become an essential tool for driver safety training, research and development of real-time warning devices, and evaluation of liabilities after vehicle accidents. Although simulation hardware has made much progress, there are still a huge number of deficiencies in simulation software. In this paper, lane changing and line changing maneuvers for virtual vehicles are presented. The presented algorithm consists of two main procedures: decision making and maneuver. First, a virtual vehicle decides when to change its lane/line. Then, it chooses its target lane and considers whether there is a sufficient gap to maneuver. If both conditions are satisfied, the virtual vehicle begins the maneuver. The desired path of the maneuver is created and the virtual vehicle follows the path using a path-following algorithm. As the path is followed, a collision-avoiding algorithm prevents the virtual vehicle from crashing into other virtual vehicles. To validate the behavior of the virtual vehicles, a few lane change scenarios were tested on ten drivers. The behavior of these subjects was compared to that of the virtual vehicle drivers operating under similar conditions. The results show that the decision making and the path of the virtual vehicle drivers are similar to those of the subjects by 84%.

Suggested Citation

  • H Naseri & A Nahvi & F Salimi Naneh Karan, 2017. "A real-time lane changing and line changing algorithm for driving simulators based on virtual driver behavior," Journal of Simulation, Taylor & Francis Journals, vol. 11(4), pages 357-368, November.
  • Handle: RePEc:taf:tjsmxx:v:11:y:2017:i:4:p:357-368
    DOI: 10.1057/s41273-017-0053-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41273-017-0053-1
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/s41273-017-0053-1?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:tjsmxx:v:11:y:2017:i:4:p:357-368. 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/tjsm .

    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.