Solving an Industrial-Scale Warehouse Delivery Problem with Answer Set Programming Modulo Difference Constraints

A warehouse delivery problem consists of a set of robots that undertake delivery jobs within a warehouse. Items are moved around the warehouse in response to events. A solution to a warehouse delivery problem is a collision-free schedule of robot movements and actions that ensures that all delivery...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithms Jg. 16; H. 4; S. 216
Hauptverfasser:	Rajaratnam, David, Schaub, Torsten, Wanko, Philipp, Chen, Kai, Liu, Sirui, Son, Tran Cao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Basel MDPI AG 01.04.2023
Schlagworte:	answer set programming answer set programming modulo theories Collision avoidance Declarative programming Graph theory hybrid reasoning Mathematical programming multi-agent path finding multi-agent planning Multiagent systems Pallets Robot dynamics Robots Scheduling Variables Warehouse stores Warehouses Germany
ISSN:	1999-4893, 1999-4893
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!