Citation
Robotics and Chromatic Scheduling. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 42-49, 2007.
Paper
Abstract
A classical problem in robotics consists in organizing the moves of a single robot (or of several robots) which have to pick up a collection of items with different sizes along a storage line. A robot may pick up several items during a trip and it has to pile them, which implies that larger items have to be placed below smaller ones: in other words, during a trip a robot has to pick up items in decreasing order of their sizes. Different hypotheses made on the possible moves of a robot along the storage line (or corridor) or assumptions on the location of the entry/exit points of the corridor will lead to different problems. It turns out that these will correspond to some graph coloring models; it is our objective to derive some of these generalized coloring models and to present some basic results on their complexity.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-042-049-P, author = {D. De Werra and M. Demange and T. Ekim},
title = {Robotics and Chromatic Scheduling},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {42--49},
note = {Paper},
abstract = {A classical problem in robotics consists in organizing the moves of a single robot (or of several robots) which have to pick up a collection of items with different sizes along a storage line. A robot may pick up several items during a trip and it has to pile them, which implies that larger items have to be placed below smaller ones: in other words, during a trip a robot has to pick up items in decreasing order of their sizes. Different hypotheses made on the possible moves of a robot along the storage line (or corridor) or assumptions on the location of the entry/exit points of the corridor will lead to different problems. It turns out that these will correspond to some graph coloring models; it is our objective to derive some of these generalized coloring models and to present some basic results on their complexity.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-042-049-P.pdf} }