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

DOI10.1016/j.ejor.2007.09.018zbMath1198.05045OpenAlexW1993839538MaRDI QIDQ948648

Marc Demange, Dominique de Werra, Tınaz Ekim

Publication date: 17 October 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.09.018

zbMATH Keywords

permutation graphspallet loading problemAGV\(l\)-modal sequenceautomated storage systemgeneralized vertex coloringpick up robots

Mathematics Subject Classification ID

Applications of graph theory (05C90) Automated systems (robots, etc.) in control theory (93C85) Coloring of graphs and hypergraphs (05C15) Artificial intelligence for robotics (68T40)

Related Items (9)

On some applications of the selective graph coloring problem ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ The parallel stack loading problem to minimize blockages ⋮ Open-source projects for autonomous robotics and systems: A survey ⋮ On inverse traveling salesman problems ⋮ On the online track assignment problem ⋮ Computational complexity of convoy movement planning problems ⋮ Advances on defective parameters in graphs ⋮ On minimum \(k\)-modal partitions of permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded vertex colorings of graphs
• Topics on perfect graphs
• \((p,k)\)-coloring problems in line graphs
• On split-coloring problems
• Decomposing a set of points into chains, with applications to permutation and circle graphs
• On a multiconstrained model for chromatic scheduling
• On cocolourings and cochromatic numbers of graphs
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• Master-slave strategy and polynomial approximation
• Approximating minimum cocolorings.
• Partitioning permutations into increasing and decreasing subsequences
• Partitioning cographs into cliques and stable sets
• Exact Algorithms for a Loading Problem with Bounded Clique Width
• On Minimum k-Modal Partitions of Permutations
• A survey of bounds for classical Ramsey numbers
• On the approximation of Min Split-coloring and Min Cocoloring

This page was built for publication: A tutorial on the use of graph coloring for some problems in robotics