IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i11p2476-d1157632.html
   My bibliography  Save this article

Optimized-Weighted-Speedy Q-Learning Algorithm for Multi-UGV in Static Environment Path Planning under Anti-Collision Cooperation Mechanism

Author

Listed:
  • Yuanying Cao

    (School of Science, Wuhan University of Technology, Wuhan 430070, China)

  • Xi Fang

    (School of Science, Wuhan University of Technology, Wuhan 430070, China)

Abstract

With the accelerated development of smart cities, the concept of a “smart industrial park” in which unmanned ground vehicles (UGVs) have wide application has entered the industrial field of vision. When faced with multiple tasks and heterogeneous tasks, the task execution efficiency of a single UGV is inefficient, thus the task planning research under multi-UGV cooperation has become more urgent. In this paper, under the anti-collision cooperation mechanism for multi-UGV path planning, an improved algorithm with optimized-weighted-speedy Q-learning (OWS Q-learning) is proposed. The slow convergence speed of the Q-learning algorithm is overcome to a certain extent by changing the update mode of the Q function. By improving the selection mode of learning rate and the selection strategy of action, the relationship between exploration and utilization is balanced, and the learning efficiency of multi-agent in complex environments is improved. The simulation experiments in static environment show that the designed anti-collision coordination mechanism effectively solves the coordination problem of multiple UGVs in the same scenario. In the same experimental scenario, compared with the Q-learning algorithm and other reinforcement learning algorithms, only the OWS Q-learning algorithm achieves the convergence effect, and the OWS Q-learning algorithm has the shortest collision-free path for UGVS and the least time to complete the planning. Compared with the Q-learning algorithm, the calculation time of the OWS Q-learning algorithm in the three experimental scenarios is improved by 53.93%, 67.21%, and 53.53%, respectively. This effectively improves the intelligent development of UGV in smart parks.

Suggested Citation

  • Yuanying Cao & Xi Fang, 2023. "Optimized-Weighted-Speedy Q-Learning Algorithm for Multi-UGV in Static Environment Path Planning under Anti-Collision Cooperation Mechanism," Mathematics, MDPI, vol. 11(11), pages 1-28, May.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:11:p:2476-:d:1157632
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/11/2476/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/11/2476/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Tingzhong Wang & Binbin Zhang & Mengyan Zhang & Sen Zhang, 2021. "Multi-UAV Collaborative Path Planning Method Based on Attention Mechanism," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-8, September.
    2. Zengliang Han & Dongqing Wang & Feng Liu & Zhiyong Zhao, 2017. "Multi-AGV path planning with double-path constraints by using an improved genetic algorithm," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-16, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiaoqiu Shi & Wei Long & Yanyan Li & Dingshan Deng, 2020. "Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems," PLOS ONE, Public Library of Science, vol. 15(5), pages 1-23, May.
    2. Vinícius Antonio Battagello & Nei Yoshihiro Soma & Rubens Junqueira Magalhães Afonso, 2020. "Computational load reduction of the agent guidance problem using Mixed Integer Programming," PLOS ONE, Public Library of Science, vol. 15(6), pages 1-45, June.
    3. Yubang Liu & Shouwen Ji & Zengrong Su & Dong Guo, 2019. "Multi-objective AGV scheduling in an automatic sorting system of an unmanned (intelligent) warehouse by using two adaptive genetic algorithms and a multi-adaptive genetic algorithm," PLOS ONE, Public Library of Science, vol. 14(12), pages 1-21, December.

    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:gam:jmathe:v:11:y:2023:i:11:p:2476-:d:1157632. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.