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

DOI10.4230/LIPICS.FUN.2018.22zbMATH Open1489.68193MaRDI QIDQ3301010FDOQ3301010

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

Publication date: 11 August 2020

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

zbMATH Keywords

competitive analysisonline algorithmgeometric graphconnected dominating setrecharging stationsrobot warehouse

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the hardness of approximating minimization problems
• Title not available (Why is that?)
• Approximation algorithms for connected dominating sets
• Towards the price of leasing online
• The online set cover problem
• Online Node-Weighted Steiner Tree and Related Problems

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)