ASP-Based Time-Bounded Planning for Logistics Robots

Manufacturing industries are undergoing a major paradigm shift towards more autonomy. Automated planning and scheduling then becomes a necessity. The Planning and Execution Competition for Logistics Robots in Simulation held at ICAPS is based on this scenario and provides an interesting testbed. However, the posed problem is challenging as also demonstrated by the somewhat weak results in 2017. The domain requires temporal reasoning and dealing with uncertainty. We propose a novel planning system based on Answer Set Programming and the Clingo solver to tackle these problems and incentivize robot cooperation. Our results show a significant performance improvement, both, in terms of lowering computational requirements and better game metrics.

Metadaten
Verfasserangaben:	Björn Schäpers, Tim Niemueller, Gerhard Lakemeyer ORCiD, Martin Gebser ORCiD GND, Torsten H. Schaub ORCiD GND
ISSN:	2334-0835
ISSN:	2334-0843
Titel des übergeordneten Werks (Englisch):	Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)
Verlag:	ASSOC Association for the Advancement of Artificial Intelligence
Verlagsort:	Palo Alto
Publikationstyp:	Sonstiges
Sprache:	Englisch
Jahr der Erstveröffentlichung:	2018
Erscheinungsjahr:	2018
Datum der Freischaltung:	16.02.2022
Seitenanzahl:	9
Erste Seite:	509
Letzte Seite:	517
Fördernde Institution:	German National Science Foundation (DFG) research unit FOR 1513 on Hybrid Reasoning for Intelligent SystemsGerman Research Foundation (DFG)
Organisationseinheiten:	Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science
DDC-Klassifikation:	0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke