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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithms Ročník 16; číslo 4; s. 216
Hlavní autoři:	Rajaratnam, David, Schaub, Torsten, Wanko, Philipp, Chen, Kai, Liu, Sirui, Son, Tran Cao
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Basel MDPI AG 01.04.2023
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!