Pick, pack, \& survive: charging robots in a modern warehouse based on online connected dominating sets

DOI10.4230/LIPICS.FUN.2018.22MaRDI QIDQ3301010zbMATH OpenFDO

Authors Heiko Hamann, Christine Markarian, Friedhelm Meyer auf der Heide, Mostafa Wahby

Publication date 11 August 2020

Full work available at URL https://doi.org/10.4230/LIPICS.FUN.2018.22

zbMATH Keywords

competitive analysisconnected dominating setgeometric graphonline algorithmrecharging stationsrobot warehouse

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27) Discrete location and assignment (90B80)

Recommendations

• Order picking optimization with rack-moving mobile robots and multiple workstations
• Parts-to-picker based order processing in a rack-moving mobile robots environment
• Picker routing in AGV-assisted order picking systems
• Order picking in an automatic warehouse: Solving online asymmetric TSPs
• Clustering-based order-picking sequence algorithm for an automated warehouse

Cites work

• Approximation algorithms for connected dominating sets
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256748 (Why is no real title available?)
• On the hardness of approximating minimization problems
• Online node-weighted Steiner tree and related problems
• The online set cover problem
• Towards the price of leasing online

This page was built for publication: Pick, pack, \& survive: charging robots in a modern warehouse based on online connected dominating sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301010)