Autonomous robot navigation in unknown terrains: incidental learning and environmental exploration

The navigation of autonomous mobile machines, which are referred to as robots, through terrains whose models are not known a priori is considered. The authors deal with point-sized robots in 2-D and 3-D (two- and three-dimensional) terrains and circular robots in 2-D terrains. The 2-D (or 3-D) terrains are finite-sized and populated by an unknown, but finite, number of simple polygonal (or polyhedral) obstacles. The robot is equipped with a sensor system that detects all vertices and edges that are visible from its present location. Two basic navigational problems are considered. In the visit problem, the robot is required to visit a sequence of destination points in a specified order, using the sensor system. In the terrain model acquisition problem, the robot is required to acquire the complete model of the terrain by exploring the terrain with the sensor. A framework that yields solutions to both the visit problem and the terrain model acquisition problem using a single approach is presented, and the algorithms are described. The approach consists of incrementally constructing, in an algorithmic manner, an appropriate geometric graph structure (1-skeleton), called the navigational course. A point robot employs the restricted visibility graph and the visibility graph as the navigational course in 2-D and 3-D cases, respectively. A circular robot uses the modified visibility graph. >

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

[2]  Vladimir J. Lumelsky,et al.  Algorithmic and complexity issues of robot motion in an uncertain environment , 1987, J. Complex..

[3]  S. Sitharama Iyengar,et al.  Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case , 1987, IEEE Journal on Robotics and Automation.

[4]  Binay K. Bhattacharya,et al.  Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot , 1988, J. Algorithms.

[5]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[6]  Leonidas J. Guibas,et al.  An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body , 1988, J. Algorithms.

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

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

[9]  Micha Sharir,et al.  Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..

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

[11]  S. Sitharama Iyengar,et al.  A 'retraction' method for terrain model acquisition , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

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

[13]  S. Iyengar,et al.  An Algorithmic Framework for Robot Navigation in Unknown Terrains. , 1988 .

[14]  Chee Yap,et al.  Algorithmic motion planning , 1987 .

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