Since the robot has to make decisions about the search based only on the part of its environment that it has explored before, the search of the robot can be viewed as an on line problem. Going home through an unknown street . In S. G. Akl, F. Dehne, and J.-R. Sack, editors, Proc. 4th Workshop on Algorithms and Data Structures, pages 135-146. LNCS 955, 1995.
Introduction Searching for a target is an important and well studied problem in robotics.
The search of the robot can be viewed as an on line problem since the robot s decisions about the search are based only on the part of its environment that it has seen so far. Going home through an unknown street . In S. G. Akl, F. Dehne, and J.-R. Sack, editors, Proc. 4th Workshop on Algorithms and Data Structures, pages 135-146. LNCS 955, 1995.