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

Research on Global Dynamic Path Planning Method Based on Improved A Algorithm

Author

Listed:
  • Chuanhu Niu
  • Aijuan Li
  • Xin Huang
  • Wei Li
  • Chuanyan Xu

Abstract

Aiming at the optimal path and planning efficiency of global path planning for intelligent driving, this paper proposes a global dynamic path planning method based on improved algorithm. First, this method improves the heuristic function of the traditional algorithm to improve the efficiency of global path planning. Second, this method uses a path optimization strategy to make the global path smoother. Third, this method is combined with the dynamic window method to improve the real-time performance of the dynamic obstacle avoidance of the intelligent vehicle. Finally, the global dynamic path planning method of the proposed improved algorithm is verified through simulation experiments and real vehicle tests. In the simulation analysis, compared with the modified algorithm and the traditional algorithm, the method in this paper shortens the path distance by 2.5%∼3.0%, increases the efficiency by 10.3%∼13.6% and generates a smoother path. In the actual vehicle test, the vehicle can avoid dynamic obstacles in real time. Therefore, the method proposed in this paper can be applied on the intelligent vehicle platform. The path planning efficiency is high, and the dynamic obstacle avoidance is good in real time.

Suggested Citation

  • Chuanhu Niu & Aijuan Li & Xin Huang & Wei Li & Chuanyan Xu, 2021. "Research on Global Dynamic Path Planning Method Based on Improved A Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-13, August.
  • Handle: RePEc:hin:jnlmpe:4977041
    DOI: 10.1155/2021/4977041
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/4977041.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/4977041.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/4977041?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:4977041. 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.