Mon 17 Jan 2022 13:55 - 14:20 at Directors - Answer Set Programming Chair(s): Martin Gebser

Motivated by autonomous warehouse applications in the real world, we study a variant of Multi-Agent Path Finding (MAPF) problem where robots also need to pick and deliver some items on their way to their destination. We call this variant the Multi-Agent Pick and Delivery with Capacities (MAPDC) problem. In addition to the challenges of MAPF (i.e., finding collision-free plans for each robot from an initial location to a destination while minimizing the maximum makespan), MAPDC asks also for the allocation of the pick and deliver tasks among robots while taking into account their capacities (i.e., the maximum number of items one robot can carry at a time). We study this problem with two different approaches, action planning vs path finding, using Answer Set Programming with two different computation modes, single-shot vs multi-shot.

Mon 17 Jan

Displayed time zone: Eastern Time (US & Canada) change

13:30 - 14:45
Answer Set ProgrammingPADL at Directors
Chair(s): Martin Gebser University of Klagenfurt, Austria

Remote session chair

13:30
25m
Talk
Modelling the Outlier Detection Problem in QASPRemote
PADL
Pierpaolo Bellusci University of Calabria, Giuseppe Mazzotta University of Calabria, Fracesco Ricca University of Calabria
13:55
25m
Talk
Multi-Agent Pick and Delivery with Capacities: Action Planning vs Path FindingRemote
PADL
Nima Tajelipirbazari TED University, Çağrı Uluç Yıldırımoğlu Sabanci University, Orkunt Sabuncu TED University, Ali Can Arıcı Ekol Logistics, İdil Helin Özen Ekol Logistics, Volkan Patoğlu Sabanci University, Esra Erdem Sabanci University, Turkey
14:20
25m
Talk
Determining Action Reversibility in STRIPS Using Answer Set Programming with QuantifiersRemote
PADL
Wolfgang Faber University of Klagenfurt, Michael Morak University of Klagenfurt, Lukas Chrpa Czech Technical University in Prague