EUVIMEDEUVIMED entdecken
Crossref

An Efficient Conflict-Free Scheduling Algorithm for Large-Space Multi-Agent Pathfinding Problem in Multi-Robot Systems

Yangjun Sun, Ning Zhao, Longwei Tang

Complex System Modeling and Simulation · 2026-12 · 6 (4) · 393-409

DOI: 10.23919/csms.2025.0026 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Complex System Modeling and Simulation, 2026-12. Verfasst von Yangjun Sun und 2 weiteren Autor:innen. Die Arbeit nennt 48 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Sun, Y., Zhao, N., & Tang, L. (2026). An Efficient Conflict-Free Scheduling Algorithm for Large-Space Multi-Agent Pathfinding Problem in Multi-Robot Systems. Complex System Modeling and Simulation, 6(4), 393-409. https://doi.org/10.23919/csms.2025.0026

Vancouver

Sun Y, Zhao N, Tang L. An Efficient Conflict-Free Scheduling Algorithm for Large-Space Multi-Agent Pathfinding Problem in Multi-Robot Systems. Complex System Modeling and Simulation. 2026;6(4):393-409. doi:10.23919/csms.2025.0026

BibTeX
@article{Sun2026,
  author = {Sun, Yangjun and Zhao, Ning and Tang, Longwei},
  title = {An Efficient Conflict-Free Scheduling Algorithm for Large-Space Multi-Agent Pathfinding Problem in Multi-Robot Systems},
  journal = {Complex System Modeling and Simulation},
  year = {2026},
  volume = {6},
  number = {4},
  pages = {393--409},
  doi = {10.23919/csms.2025.0026}
}
Kostenlos starten →