Explanation generation for multi-modal multi-agent path finding with optimal resource utilization using answer set programming

Boğatarkan, Aysu and Erdem, Esra (2020) Explanation generation for multi-modal multi-agent path finding with optimal resource utilization using answer set programming. Theory and Practice of Logic Programming, 20 (6). pp. 974-989. ISSN 1471-0684 (Print) 1475-3081 (Online)

This is the latest version of this item.

[thumbnail of Acceptance letter] PDF (Acceptance letter)
TPLP_-_Decision_on_TPLP-OA-20-050.R1.pdf
Restricted to Repository staff only

Download (74kB) | Request a copy

Abstract

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. We consider a general version of MAPF, called mMAPF, that involves multi-modal transportation modes (e.g., due to velocity constraints) and consumption of different types of resources (e.g., batteries). The real-world applications of mMAPF require flexibility (e.g., solving variations of mMAPF) as well as explainability. Our earlier studies on mMAPF have focused on the former challenge of flexibility. In this study, we focus on the latter challenge of explainability, and introduce a method for generating explanations for queries regarding the feasibility and optimality of solutions, the nonexistence of solutions, and the observations about solutions. Our method is based on answer set programming.
Item Type: Article
Uncontrolled Keywords: logic programming, multi agent systems, multimodal transportation
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Esra Erdem
Date Deposited: 01 Sep 2021 00:50
Last Modified: 04 Aug 2023 22:37
URI: https://research.sabanciuniv.edu/id/eprint/42335

Available Versions of this Item

Actions (login required)

View Item
View Item