Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming

by   Aysu Bogatarkan, et al.

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. This paper is under consideration for acceptance in TPLP.


Flexible and Explainable Solutions for Multi-Agent Path Finding Problems

The multi-agent path finding (MAPF) problem is a combinatorial search pr...

Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming

We study a dynamic version of multi-agent path finding problem (called D...

Conflict-Based Search for Explainable Multi-Agent Path Finding

In the Multi-Agent Path Finding (MAPF) problem, the goal is to find non-...

Decentralised Approach for Multi Agent Path Finding

Multi Agent Path Finding (MAPF) requires identification of conflict free...

CL-MAPF: Multi-Agent Path Finding for Car-Like Robots with Kinematic and Spatiotemporal Constraints

Multi-Agent Path Finding has been widely studied in the past few years d...

Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search

Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem t...

Coordinated Multi-Agent Pathfinding for Drones and Trucks over Road Networks

We address the problem of routing a team of drones and trucks over large...