EUVIMEDEUVIMED entdecken
Crossref

An improved competition of tribes and cooperation of members algorithm for three-dimensional multi-UAV geometric path planning in complex urban low-altitude environments

Guoqing Yang, Qinxiao Zhang, Wanxiang Yao, Yongkang Gao, Yingjie Li

Intelligent Service Robotics · 2026-11 · 19 (6)

DOI: 10.1007/s11370-026-00754-x ↗

Kurz gefasst

Fachartikel in der Zeitschrift Intelligent Service Robotics, online erschienen am 28.09.2026. Verfasst von Guoqing Yang und 4 weiteren Autor:innen. Die Arbeit nennt 41 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Young Expert of Taishan Scholars of Shandong Province, Natural Science Foundation of Shandong Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China
  • Young Expert of Taishan Scholars of Shandong Province
  • Natural Science Foundation of Shandong Province

Zitieren

APA

Yang, G., Zhang, Q., Yao, W., Gao, Y., & Li, Y. (2026). An improved competition of tribes and cooperation of members algorithm for three-dimensional multi-UAV geometric path planning in complex urban low-altitude environments. Intelligent Service Robotics, 19(6). https://doi.org/10.1007/s11370-026-00754-x

Vancouver

Yang G, Zhang Q, Yao W, Gao Y, Li Y. An improved competition of tribes and cooperation of members algorithm for three-dimensional multi-UAV geometric path planning in complex urban low-altitude environments. Intelligent Service Robotics. 2026;19(6). doi:10.1007/s11370-026-00754-x

BibTeX
@article{Yang2026,
  author = {Yang, Guoqing and Zhang, Qinxiao and Yao, Wanxiang and Gao, Yongkang and Li, Yingjie},
  title = {An improved competition of tribes and cooperation of members algorithm for three-dimensional multi-UAV geometric path planning in complex urban low-altitude environments},
  journal = {Intelligent Service Robotics},
  year = {2026},
  volume = {19},
  number = {6},
  doi = {10.1007/s11370-026-00754-x}
}
Kostenlos starten →