skip to main content
10.1145/3653081.3653161acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiotaaiConference Proceedingsconference-collections
research-article

UAV path planning based on improved TD3 algorithm

Published:03 May 2024Publication History

ABSTRACT

For the UAV path planning problem in complex unknown environments, a dual delayed deep deterministic policy gradient algorithm based on composite experience replay is proposed. First, the TD3 algorithm and LSTM neural network are combined, and then the experience replay mechanism and reward function are improved to allow better obstacle avoidance in both dynamic and static environments. By building an environment for simulation experiments, the results show that the algorithm is more efficient and stable in obstacle avoidance compared with the original algorithm, and can help UAVs perform better path planning in unknown environments where multiple obstacles exist.

References

  1. YU H, LI G, ZHANG W, The unmanned aerial vehicle benchmark: object detection, tracking and base line [J]. International Journal of Computer Vision, 2020 (128):1141-1159.Google ScholarGoogle Scholar
  2. PEREIRA D S, MORAIS M R D, NASCIMENTO L B P, Zigbee protocol-based communication network for multi-unmanned aerial vehicle networks [J]. IEEE Access, 2020, 8:57762-57771.Google ScholarGoogle ScholarCross RefCross Ref
  3. BASILICO N, CARPIN S. Deploying teams of heterogeneous UAVs in cooperative two-level surveillance missions [C]//2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, Hamburg, Germany, 2015: 610-615.Google ScholarGoogle Scholar
  4. KOREN Y, BORENSTEIN J. Potential field methods and their inherent limitations for mobile robot navigation [C] // Proceedings of the IEEE International Conference on Robotics and Automation. Piscataway: IEEE, 1991: 1398-1404.Google ScholarGoogle Scholar
  5. LOZANOPEREZ T, WESLEY M A. An algorithm for planning collision-free paths among polyhedral obstacles [J]. Communications of the Association for Computing Machinery, 1979, 22(10):560-570.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. CASTILLO O, TRUJILLO L, MELIN P. Multiple objective genetic algorithms for path-planning optimization in autonomous mobile robots [J]. Soft Computing, 2007, 11(3):269-279.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. KIM I, SHIN S, WU J, Obstacle avoidance path planning for UVA using reinforcement learning under simulated environment[C]//IASER 3rd International Conference on Electronics, Electrical Engineering. Piscataway: IEEE, 2017: 34-36.Google ScholarGoogle Scholar
  8. WATKINS C, CHRISTOPHER J, DAYAN P. Q-learning [J]. Machine Learning, 1992, 8(3/4): 279-292.Google ScholarGoogle ScholarCross RefCross Ref
  9. HART P E, NILSSON N J, RAPHAEL B. A formal basis for the heuristic determination of minimum cost paths [J]. IEEE Transactions on Systems Science and Cybernetics, 1968, 4(2):100-107Google ScholarGoogle ScholarCross RefCross Ref
  10. FUJIMOTOS, HOOFH, MEGERD. Addressing function approximation error in actor-critic methods [J]. arXiv:1802.09477, 2018.Google ScholarGoogle Scholar

Index Terms

  1. UAV path planning based on improved TD3 algorithm

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      IoTAAI '23: Proceedings of the 2023 5th International Conference on Internet of Things, Automation and Artificial Intelligence
      November 2023
      902 pages
      ISBN:9798400716485
      DOI:10.1145/3653081

      Copyright © 2023 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 May 2024

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited
    • Article Metrics

      • Downloads (Last 12 months)2
      • Downloads (Last 6 weeks)2

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format