A tutorial on the use of graph coloring for some problems in robotics

We study the problem where a robot has to pick up items of different sizes which are stored along a corridor. A natural requirement is that the items have to be collected in decreasing order of their sizes. We deal with various systems according to the location of the Entry/Exit station where the ro...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2009, Vol.192 (1), p.41-55
Main Authors: Demange, Marc, Ekim, Tınaz, de Werra, Dominique
Format: Article
Language:English
Subjects:
AGV
Automated storage system
Generalized vertex coloring
Graph coloring
l-modal sequence
Materials handling
Optimization
Pallet loading problem
Permutation graphs
Pick up robots
Pick up robots AGV Automated storage system Pallet loading problem l-modal sequence Generalized vertex coloring Permutation graphs
Robotics
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the problem where a robot has to pick up items of different sizes which are stored along a corridor. A natural requirement is that the items have to be collected in decreasing order of their sizes. We deal with various systems according to the location of the Entry/Exit station where the robot unloads the collected items after each trip along the corridor. The links of these systems with generalized coloring problems and other applications such that train shunting and pallet loading problems are discussed and related results are obtained. We conclude with several open questions on the topic.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2007.09.018