A declarative method for dynamic multi-agent path finding

Boğatarkan, Aysu and Patoğlu, Volkan and Erdem, Esra (2019) A declarative method for dynamic multi-agent path finding. In: 5th Global Conference on Artificial Intelligence (GCAI 2019), Bolzano, Italy

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 such that no two agents collide with each other. We study a dynamic variant of MAPF, called D-MAPF, which allows changes in the environment (e.g., some existing obstacles may be removed from the environment or moved to some other location, or new obstacles may be included in the environment), and/or changes in the team (e.g., some existing agents may leave and some new agents may join the team) at different times. We introduce a new method to solve D-MAPF, using answer set programming.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: Answer Set Programming, declarative problem solving, Knowledge Representation and Reasoning, multi-agent path finding
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Esra Erdem
Date Deposited: 23 Dec 2020 18:05
Last Modified: 01 Aug 2023 14:51
URI: https://research.sabanciuniv.edu/id/eprint/41292

Actions (login required)

View Item
View Item