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 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.
Year of publication: |
2009
|
---|---|
Authors: | Demange, Marc ; Ekim, TInaz ; de Werra, Dominique |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 192.2009, 1, p. 41-55
|
Publisher: |
Elsevier |
Keywords: | Pick up robots AGV Automated storage system Pallet loading problem l-modal sequence Generalized vertex coloring Permutation graphs |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Block decomposition approach to compute a minimum geodetic set
Ekim, Tinaz, (2014)
-
On matching extendability of lexicographic products
Chiarelli, Nina, (2017)
-
On-line bin-packing problem : maximizing the number of unused bins.
Kouakou, Bernard, (2005)
- More ...