Dynamic Path Planning for Multiple UAVs with Incomplete Information

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

To address the dynamic path planning for multiple UAVs using incomplete information, this paper studies real-time conflict detection and intelligent resolution methods. When the UAVs execute the task under the condition of incomplete information, the mission strategy of different UAVs may conflict with each other due to the difference in target, departure place, time and other factors. Based on the multi-agent deep deterministic policy gradient algorithm (MADDPG), we designed new global reward and partial local reward functions for the UAVs’ path planning and named the improved algorithm as a complex memory driver-MADDPG (CMD-MADDPG). Thus, the trained UAVs can effectively and efficiently perform path planning tasks in conditions of incomplete information (each UAV does not know its reward function and so on). Finally, the simulation verifies that the proposed method can realize fast and accurate dynamic path planning for multiple UAVs.

Cite

CITATION STYLE

APA

Xue, J., Zhu, J., Du, J., Kang, W., & Xiao, J. (2023). Dynamic Path Planning for Multiple UAVs with Incomplete Information. Electronics (Switzerland), 12(4). https://doi.org/10.3390/electronics12040980

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free