IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v17y2024i11p2762-d1409133.html
   My bibliography  Save this article

UAV Path Planning Based on Random Obstacle Training and Linear Soft Update of DRL in Dense Urban Environment

Author

Listed:
  • Yanfei Zhu

    (School of Automation, Guangdong University of Technology, Guangzhou 510006, China)

  • Yingjie Tan

    (School of Automation, Guangdong University of Technology, Guangzhou 510006, China)

  • Yongfa Chen

    (School of Automation, Guangdong University of Technology, Guangzhou 510006, China)

  • Liudan Chen

    (School of Automation, Guangdong University of Technology, Guangzhou 510006, China)

  • Kwang Y. Lee

    (Department of Electrical and Computer Engineering, Baylor University, Waco, TX 76798, USA
    Yonsei Frontier Lab, Yonsei University, Seoul 03722, Republic of Korea)

Abstract

The three-dimensional (3D) path planning problem of an Unmanned Aerial Vehicle (UAV) considering the effect of environmental wind in a dense city is investigated in this paper. The mission of the UAV is to fly from its initial position to its destination while ensuring safe flight. The dense obstacle avoidance and the energy consumption in 3D space need to be considered during the mission, which are often ignored in common studies. To solve these problems, an improved Deep Reinforcement Learning (DRL) path planning algorithm based on Double Deep Q-Network (DDQN) is proposed in this paper. Among the algorithms, the random obstacle training method is first proposed to make the algorithm consider various flight scenarios more globally and comprehensively and improve the algorithm’s robustness and adaptability. Then, the linear soft update strategy is employed to realize the smooth neural network parameter update, which enhances the stability and convergence of the training. In addition, the wind disturbances are integrated into the energy consumption model and reward function, which can effectively describe the wind disturbances during the UAV mission to achieve the minimum drag flight. To prevent the neural network from interfering with training failures, the meritocracy mechanism is proposed to enhance the algorithm’s stability. The effectiveness and applicability of the proposed method are verified through simulation analysis and comparative studies. The UAV based on this algorithm has good autonomy and adaptability, which provides a new way to solve the UAV path planning problem in dense urban scenes.

Suggested Citation

  • Yanfei Zhu & Yingjie Tan & Yongfa Chen & Liudan Chen & Kwang Y. Lee, 2024. "UAV Path Planning Based on Random Obstacle Training and Linear Soft Update of DRL in Dense Urban Environment," Energies, MDPI, vol. 17(11), pages 1-19, June.
  • Handle: RePEc:gam:jeners:v:17:y:2024:i:11:p:2762-:d:1409133
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/17/11/2762/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/17/11/2762/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Galán-García, José L. & Aguilera-Venegas, Gabriel & Galán-García, María Á. & Rodríguez-Cielos, Pedro, 2015. "A new Probabilistic Extension of Dijkstra’s Algorithm to simulate more realistic traffic flow in a smart city," Applied Mathematics and Computation, Elsevier, vol. 267(C), pages 780-789.
    2. Ge Chen & Tao Wu & Zheng Zhou, 2021. "Research on Ship Meteorological Route Based on A-Star Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-8, May.
    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. Hernando, Antonio & Roanes-Lozano, Eugenio & Garcia-Álvarez, Alberto, 2018. "A recommender system for train routing: When concatenating two minimum length paths is not the minimum length path," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 486-498.
    2. Yi, Tao & Cheng, Xiaobin & Peng, Peng, 2022. "Two-stage optimal allocation of charging stations based on spatiotemporal complementarity and demand response: A framework based on MCS and DBPSO," Energy, Elsevier, vol. 239(PC).

    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:jeners:v:17:y:2024:i:11:p:2762-:d:1409133. 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.