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

Celý popis

Podrobná bibliografia

Vydané v:	Theory and practice of logic programming Ročník 20; číslo 6; s. 974 - 989
Hlavní autori:	BOGATARKAN, AYSU, ERDEM, ESRA
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.11.2020
Predmet:	Combinatorial analysis Declarative programming Flexibility Mathematical programming Multiagent systems Optimization Original Article Resource utilization Warehouses
ISSN:	1471-0684, 1475-3081
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!