IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0331986.html
   My bibliography  Save this article

Deep reinforcement learning-based multi-lane mixed traffic ramp merging strategy

Author

Listed:
  • Tong Zhou
  • Yuzhao Huang
  • Yudan Tian
  • Hua Huang
  • Minghui Ou
  • Tao Lin

Abstract

Due to concentrated conflicts, on-ramp merging is an important scenario in the study of new hybrid traffic control. Current research mainly focuses on optimizing the vehicle passage sequence of ramp vehicles merging with mainline vehicles in single-lane scenarios, neglecting the coordination problem of vehicles in multiple mainline lanes. Therefore, an Improved Dueling Double DQN (D3QN) On-ramp Merging Strategy (IDS stands for the initials of Improved, D3QN, and Strategy) combined with a sine function is proposed, establishing a Vehicle Coordination System (VCS) to guide the merging of vehicles in multi-lane mainline traffic. This strategy uses the improved D3QN algorithm combined with the excellent smoothness of the sine function to evaluate driving safety, helping vehicles find suitable gaps in traffic flow. An action masking mechanism was deployed during the strategy exploration phase to prevent unsafe actions. The proposed VCS + IDS strategy was tested in SUMO simulations of on-ramp merging under different density of vehicle flow. Under a traffic flow of 1200 vehicles per lane per hour, the on-ramp merging completion rate of VCS + IDS reached 98.62%, and the task completion rate was 98.11%, which increased by 11.08% and 10.79% compared to traditional D3QN, respectively, validating the effectiveness of this method.

Suggested Citation

  • Tong Zhou & Yuzhao Huang & Yudan Tian & Hua Huang & Minghui Ou & Tao Lin, 2025. "Deep reinforcement learning-based multi-lane mixed traffic ramp merging strategy," PLOS ONE, Public Library of Science, vol. 20(9), pages 1-19, September.
  • Handle: RePEc:plo:pone00:0331986
    DOI: 10.1371/journal.pone.0331986
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0331986
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0331986&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0331986?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
    ---><---

    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:plo:pone00:0331986. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.