EUVIMEDEUVIMED entdecken
Crossref

Multi-Agent Path Finding with Unassigned Agents (MAPFUA)

Ariel Felner, Roni Stern

Proceedings of the AAAI Conference on Artificial Intelligence · 14.03.2026 · 40 (46) · 39691-39698

DOI: 10.1609/aaai.v40i46.41322 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 14.03.2026. Verfasst von Ariel Felner und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In the Multi-Agent Path Finding (MAPF) problem, the aim is to find collision free paths for multiple agents. MAPF has many practical applications and has spawned massive research interest in the past two decades. Most MAPF research assumed that every agent is assigned a target it must reach. This assumption often does not hold in several key applications such as automated warehouses and parking lots, where some agents are assigned targets to reach, and others, denoted as unassigned agents, can either stay idle or move to clear the way for the assigned agents. In this paper we introduce this important problem, explain its uniqueness and encourage the entire community to work on it.

Zitieren

APA

Felner, A., & Stern, R. (2026). Multi-Agent Path Finding with Unassigned Agents (MAPFUA). Proceedings of the AAAI Conference on Artificial Intelligence, 40(46), 39691-39698. https://doi.org/10.1609/aaai.v40i46.41322

Vancouver

Felner A, Stern R. Multi-Agent Path Finding with Unassigned Agents (MAPFUA). Proceedings of the AAAI Conference on Artificial Intelligence. 2026;40(46):39691-39698. doi:10.1609/aaai.v40i46.41322

BibTeX
@article{Felner2026,
  author = {Felner, Ariel and Stern, Roni},
  title = {Multi-Agent Path Finding with Unassigned Agents (MAPFUA)},
  journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year = {2026},
  volume = {40},
  number = {46},
  pages = {39691--39698},
  doi = {10.1609/aaai.v40i46.41322}
}
Kostenlos starten →