Atiq, Basem Alqera and Patoğlu, Volkan and Erdem, Esra (2020) Dynamic multi-agent path finding based on conflict resolution using answer set programming. In: 36th International Conference on Logic Programming (ICLP 2020), Virtual
This is the latest version of this item.
Official URL: http://dx.doi.org/10.4204/EPTCS.325.27
Abstract
We study a dynamic version of multi-agent path finding problem (called D-MAPF) where existing agents may leave and new agents may join the team at different times. We introduce a new method to solve D-MAPF based on conflict-resolution. The idea is, when a set of new agents joins the team and there are conflicts, instead of replanning for the whole team, to replan only for a minimal subset of agents whose plans conflict with each other. We utilize answer set programming as part of our method for planning, replanning and identifying minimal set of conflicts.
| Item Type: | Papers in Conference Proceedings |
|---|---|
| Divisions: | Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng. Faculty of Engineering and Natural Sciences |
| Depositing User: | Esra Erdem |
| Date Deposited: | 07 Sep 2021 23:07 |
| Last Modified: | 04 Aug 2023 14:01 |
| URI: | https://research.sabanciuniv.edu/id/eprint/42338 |
Available Versions of this Item
-
Dynamic multi-agent path finding based on conflict resolution using answer set programming. (deposited 26 Sep 2020 09:53)
- Dynamic multi-agent path finding based on conflict resolution using answer set programming. (deposited 07 Sep 2021 23:07) [Currently Displayed]
Actions (login required)
- View Item