IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/146070.html
   My bibliography  Save this article

A Cooperative -Learning Path Planning Algorithm for Origin-Destination Pairs in Urban Road Networks

Author

Listed:
  • Xiaoyong Zhang
  • Heng Li
  • Jun Peng
  • Weirong Liu

Abstract

As an important part of intelligent transportation systems, path planning algorithms have been extensively studied in the literature. Most of existing studies are focused on the global optimization of paths to find the optimal path between Origin-Destination (OD) pairs. However, in urban road networks, the optimal path may not be always available when some unknown emergent events occur on the path. Thus a more practical method is to calculate several suboptimal paths instead of finding only one optimal path. In this paper, a cooperative -learning path planning algorithm is proposed to seek a suboptimal multipath set for OD pairs in urban road networks. The road model is abstracted to the form that -learning can be applied firstly. Then the gray prediction algorithm is combined into -learning to find the suboptimal paths with reliable constraints. Simulation results are provided to show the effectiveness of the proposed algorithm.

Suggested Citation

  • Xiaoyong Zhang & Heng Li & Jun Peng & Weirong Liu, 2015. "A Cooperative -Learning Path Planning Algorithm for Origin-Destination Pairs in Urban Road Networks," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-10, October.
    • Handle: RePEc:hin:jnlmpe:146070
    DOI: 10.1155/2015/146070
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/146070.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2015/146070.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/146070?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:hin:jnlmpe:146070. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.