@article {15218,
	title = {Graphbots: Mobility in discrete spaces},
	journal = {Automata, Languages and Programming},
	year = {1995},
	month = {1995///},
	pages = {593 - 604},
	abstract = {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.},
	doi = {10.1007/3-540-60084-1_108},
	author = {Khuller, Samir and Rivlin,E. and Rosenfeld, A.}
}
