Search Results for author:
Found 2 papers, 0 papers with code
Flexible and Explainable Solutions for Multi-Agent Path Finding Problems
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.
Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming
Our earlier studies on mMAPF have focused on the former challenge of flexibility.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
