Flexible, Lifelong, Explainable, and Robust Solutions for Multi-Agent Path Finding Problems

Aysu Bogatarkan

AAAI 2026technical0 citations

Flexible, Lifelong, Explainable, and Robust Solutions for Multi-Agent Path Finding Problems

Abstract

The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents in an environment without collisions, subject to constraints on the lengths of paths. The real-world applications of MAPF require flexible, lifelong, robust and explainable solutions. In this study, these challenges are being addressed.

BibTeX

@inproceedings{aaai2026_flexiblelifelong,
  title = {Flexible, Lifelong, Explainable, and Robust Solutions for Multi-Agent Path Finding Problems},
  author = {Aysu Bogatarkan},
  booktitle = {AAAI 2026},
  year = {2026}
}