Flexible and explainable solutions for multi-agent path finding problems

Boğatarkan, Aysu (2021) Flexible and explainable solutions for multi-agent path finding problems. In: 37th International Conference on Logic Programming (Technical Communications), ICLP 2021, Virtual, Porto

Full text not available from this repository. (Request a copy)


The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other, and subject to some constraints on the lengths of paths. The real-world applications of MAPF require flexibility (e.g., solving variations of MAPF) as well as explainability. In this study, both of these challenges are addressed and some flexible and explainable solutions for MAPF and its variants are introduced.
Item Type: Papers in Conference Proceedings
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Aysu Boğatarkan
Date Deposited: 28 Aug 2022 17:42
Last Modified: 28 Aug 2022 17:42
URI: https://research.sabanciuniv.edu/id/eprint/43792

Actions (login required)

View Item
View Item