Robust Multiagent Combinatorial Path Finding

Yehonatan Kidushim; Avraham Natan; Roni Stern; Meir Kalech

AAAI 2026technical0 citations

Robust Multiagent Combinatorial Path Finding

Yehonatan Kidushim, Avraham Natan, Roni Stern, Meir Kalech

Abstract

Consider a system of multiple physical agents tasked with collaboratively collecting a set of spatially distributed goals as quickly as possible while avoiding collisions with the environment and with each other. This type of problem, which involves Multi-Agent Path Finding (MAPF) and task allocation, is called Multi-Agent Combinatorial Path Finding (MCPF). Prior work on MCPF assumed each agent has a final goal it must reach, there are no orientation constraints on the agents

BibTeX

@inproceedings{aaai2026_robustmultiagent,
  title = {Robust Multiagent Combinatorial Path Finding},
  author = {Yehonatan Kidushim and Avraham Natan and Roni Stern and Meir Kalech},
  booktitle = {AAAI 2026},
  year = {2026}
}