Creative Commons Attribution 3.0 Unported license
Over time, Answer Set Programming (ASP) has gained traction as a versatile logic programming semantics with performant processing systems, used by a growing number of significant applications in academia and industry. However, this development is threatened by a lack of commonly accepted design patterns and techniques for ASP to address dynamic application on a real-world scale. To this end, we identified robotic intra-logistics as representative scenario, a major domain of interest in the context of the fourth industrial revolution. For this setting, we aim to provide a scalable and efficient ASP-based solutions by (1) stipulating a standardized test and benchmark framework; (2) leveraging existing ASP techniques through new design patterns; and (3) extending ASP with new functionalities. In this paper we will expand on the subject matter as well as detail our current progress and future plans.
@InProceedings{obermeier:OASIcs.ICLP.2018.24,
author = {Obermeier, Philipp},
title = {{Scalable Robotic Intra-Logistics with Answer Set Programming}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {24:1--24:5},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.24},
URN = {urn:nbn:de:0030-drops-98907},
doi = {10.4230/OASIcs.ICLP.2018.24},
annote = {Keywords: Answer Set Programming, Logistics, Planning}
}