A tutorial on the use of graph coloring for some problems in robotics
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 192 (2009)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Pick up robots AGV Automated storage system Pallet loading problem l-modal sequence Generalized vertex coloring Permutation graphs;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.