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

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 c...

Full description

Saved in:

Bibliographic Details
Published in:	Theory and practice of logic programming Vol. 20; no. 6; pp. 974 - 989
Main Authors:	BOGATARKAN, AYSU, ERDEM, ESRA
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.11.2020
Subjects:	Combinatorial analysis Declarative programming Flexibility Mathematical programming Multiagent systems Optimization Original Article Resource utilization Warehouses
ISSN:	1471-0684, 1475-3081
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!