EUVIMEDEUVIMED entdecken
Crossref

Multi-UAV Cooperative Trajectory Planning With Dynamic Programming

Jiaxin Yan, Zebo Zhou, Bei Chen

IEEE Transactions on Automation Science and Engineering · 2026 · 23 · 8800-8811

DOI: 10.1109/tase.2026.3676533 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Automation Science and Engineering, 2026. Verfasst von Jiaxin Yan und 2 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 57 Literaturangaben. Gefördert von: National Natural Science Foundation of China, System of Systems and Artificial Intelligence Key Laboratory of Sichuan Province Pioneer Fund.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper proposed a cooperative trajectory planning method with Dynamic Programming (DP) to address the real-time generation of safe trajectories for Multi-UAV in complex environments. The DP comprises three key components: 1) adaptive batch sampling of the state space to efficiently reduce computational complexity; 2) application of DP principles to compute feasible trajectories from the sampled states; 3) formulation of the trajectory optimization problem as a quadratic programming (QP) problem through spline curve parameterization, yielding optimal smooth trajectories. Extending the single-UAV planning paradigm, we introduce a distance-constrained information exchange for multi-UAV coordination. Through collaborative environmental sampling, each UAV gains access to extended spatial awareness beyond its individual sensor range, thereby expanding the solution space and enhancing the reliability and robustness of the planning outcomes. Experimental results demonstrate that our framework achieves real-time performance with computation times in the order of milliseconds. Comparative evaluations against state-of-the-art methods reveal superior trajectory quality, making it suitable for multi-UAV applications in complex environments. Note to Practitioners—The increasing use of UAVs in applications such as search and infrastructure inspection demand efficient trajectory planning methods. These methods must balance computational efficiency and trajectory quality, particularly in multi-UAV operations within complex environments. This work presents a practical solution through a novel collaborative trajectory planning framework. The key innovation lies in integrating adaptive state space sampling with dynamic programming principles tailored for multi-UAV scenarios. A distance-constrained information exchange mechanism enables UAVs to share critical environmental sampling data while minimizing communication overhead. This approach allows UAVs to generate high-quality trajectories efficiently while maintaining real-time performance. Practitioners in fields requiring multi-UAV planning may deploy the proposed method by integrating it into existing swarm frameworks (e.g., EGO-swarm), enabling rapid adoption. Current limitations include reliance on stable communication links for coordination. Future extensions may incorporate machine learning techniques to dynamically adapt sampling parameters in response to environmental changes.

Förderung

  • National Natural Science Foundation of China
  • System of Systems and Artificial Intelligence Key Laboratory of Sichuan Province Pioneer Fund

Zitieren

APA

Yan, J., Zhou, Z., & Chen, B. (2026). Multi-UAV Cooperative Trajectory Planning With Dynamic Programming. IEEE Transactions on Automation Science and Engineering, 23, 8800-8811. https://doi.org/10.1109/tase.2026.3676533

Vancouver

Yan J, Zhou Z, Chen B. Multi-UAV Cooperative Trajectory Planning With Dynamic Programming. IEEE Transactions on Automation Science and Engineering. 2026;23:8800-8811. doi:10.1109/tase.2026.3676533

BibTeX
@article{Yan2026,
  author = {Yan, Jiaxin and Zhou, Zebo and Chen, Bei},
  title = {Multi-UAV Cooperative Trajectory Planning With Dynamic Programming},
  journal = {IEEE Transactions on Automation Science and Engineering},
  year = {2026},
  volume = {23},
  pages = {8800--8811},
  doi = {10.1109/tase.2026.3676533}
}
Kostenlos starten →