EUVIMEDEUVIMED entdecken
Crossref

HOA-IAPF: a hiking optimization algorithm and improved artificial potential field for formation path planning for multi-mobile robots

Chan Liu, Jianhua Zhang, Na Geng, Houxin Sun, Bo Song

Intelligent Service Robotics · 2026-07 · 19 (4)

DOI: 10.1007/s11370-026-00717-2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Intelligent Service Robotics, online erschienen am 04.06.2026. Verfasst von Chan Liu und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 51 Literaturangaben. Gefördert von: Natural Science Research of Jiangsu Higher Education Institutions of China, Xuzhou Science and Technology Program, Graduate Research and Innovation Projects of Jiangsu Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Natural Science Research of Jiangsu Higher Education Institutions of China
  • Xuzhou Science and Technology Program
  • Graduate Research and Innovation Projects of Jiangsu Province
  • National Natural Science Foundation of China

Zitieren

APA

Liu, C., Zhang, J., Geng, N., Sun, H., & Song, B. (2026). HOA-IAPF: a hiking optimization algorithm and improved artificial potential field for formation path planning for multi-mobile robots. Intelligent Service Robotics, 19(4). https://doi.org/10.1007/s11370-026-00717-2

Vancouver

Liu C, Zhang J, Geng N, Sun H, Song B. HOA-IAPF: a hiking optimization algorithm and improved artificial potential field for formation path planning for multi-mobile robots. Intelligent Service Robotics. 2026;19(4). doi:10.1007/s11370-026-00717-2

BibTeX
@article{Liu2026,
  author = {Liu, Chan and Zhang, Jianhua and Geng, Na and Sun, Houxin and Song, Bo},
  title = {HOA-IAPF: a hiking optimization algorithm and improved artificial potential field for formation path planning for multi-mobile robots},
  journal = {Intelligent Service Robotics},
  year = {2026},
  volume = {19},
  number = {4},
  doi = {10.1007/s11370-026-00717-2}
}
Kostenlos starten →