@inproceedings{2e3cc9c82e674552bc42689a38d6f429,
title = "Graphbots: Mobility in discrete spaces",
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 “robot” or team of robots having a particular graph structure can move from any start location to any goal destination in a graph-structured space.",
author = "Samir Khuller and Ehud Rivlin and Azriel Rosenfeld",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995.; 22nd International Colloquium on Automata, Languages and Programming, ICALP 1995 ; Conference date: 10-07-1995 Through 14-07-1995",
year = "1995",
doi = "10.1007/3-540-60084-1_108",
language = "English (US)",
isbn = "3540600841",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "593--604",
editor = "Zoltan Fulop and Ferenc Gecseg",
booktitle = "Automata, Languages and Programming - 22nd International Colloquium, ICALP 1995, Proceedings",
}