On terrain acquisition by a finite-sized mobile robot in plane

The terrain acquisition problem deals with the acquisition of the complete obstacle terrain model by a mobile robot placed in an unexplored terrain. This is a precursory problem to many well-known find-path and related problems which assume the availability of the complete terrain model. In this paper, we present a method for terrain acquisition by a finite-sized robot operating in plane populated by an unknown (but, finite) number of polygonal obstacles; each obstacle is arbitrarily located and has unknown (but, finite) number of vertices. The robot progressively explores newer vertices of the obstacles using sensor equipment. We show that the complete terrain model will be built by the robot in a finite time. We also show that at any point of time the partially acquired terrain suffices for the navigation of the robot during the exploration. Hence we conclude that the navigation techniques for known terrains can be applied for the robot navigation during exploration.

[1]  S. Sitharama Iyengar,et al.  Robot Navigation in Unknown Terrains of Convex Polygonal Obstacles Using Learned Visibility Graphs , 1986, AAAI.

[2]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[3]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[4]  Vladimir Lumelsky,et al.  Effect of uncertainty on continuous path planning for an autonomous vehicle , 1984, The 23rd IEEE Conference on Decision and Control.

[5]  Rodney A. Brooks,et al.  Solving the find-path problem by good representation of free space , 1982, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  S. Sitharama Iyengar,et al.  Robot navigation algorithms using learned spatial graphs , 1986, Robotica.

[7]  A. K. C. Wong,et al.  Low-Level Learning for a Mobile Robot: Environment Model Acquisition , 1985, CAIA.

[8]  Nageswara S. V. Rao,et al.  Robot navigation in an unexplored terrain , 1986, J. Field Robotics.

[9]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[10]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[11]  S. Sitharama Iyengar,et al.  On terrain acquisition by a point robot amidst polyhedral obstacles , 1988, IEEE J. Robotics Autom..

[12]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..