Multi-modal multi-agent path finding with optimal resource utilization

Warning The system is temporarily closed to updates for reporting purpose.

Boğatarkan, Aysu and Erdem, Esra and Kleiner, Alexander and Patoğlu, Volkan (2020) Multi-modal multi-agent path finding with optimal resource utilization. In: 5th International Conference on the Industry 4.0 Model for Advanced Manufacturing (AMP 2020), Belgrade, Serbia

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1007/978-3-030-46212-3_24


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. We study a general version of MAPF, called mMAPF, that involves further challenges, such as multi-modal transportation modes, a set of waypoints to visit for each agent, and consumption of different types of resources. We introduce a declarative method to solve mMAPF, using answer set programming that provides a flexible formal framework to address all these challenges while optimizing multiple objectives.

Item Type:Papers in Conference Proceedings
ID Code:40887
Deposited By:Volkan Patoğlu
Deposited On:27 Sep 2020 10:16
Last Modified:27 Sep 2020 10:16

Repository Staff Only: item control page