TY - JOUR T1 - Graphbots: Mobility in discrete spaces JF - Automata, Languages and Programming Y1 - 1995 A1 - Khuller, Samir A1 - Rivlin,E. A1 - Rosenfeld, A. AB - Most previous theoretical work on motion planning has addressed the problem of path planning for geometrically simple robots in geometrically simple regions of Euclidean space (e.g., a planar region containing polygonal obstacles). In this paper we define a natural version of the motion planning problem in a graph theoretic setting. We establish conditions under which a ldquorobotrdquo or team of robots having a particular graph structure can move from any start location to any goal destination in a graph-structured space. M3 - 10.1007/3-540-60084-1_108 ER -