Robot navigation algorithms using learned spatial graphs

Finding optimal paths for robot navigation in known terrain has been studied for some time but, in many important situations, a robot would be required to navigate in completely new or partially explored terrain. We propose a method of robot navigation which requires no pre-learned model, makes maximal use of available information, records and synthesizes information from multiple journeys, and contains concepts of learning that allow for continuous transition from local to global path optimality. The model of the terrain consists of a spatial graph and a Voronoi diagram. Using acquired sensor data, polygonal boundaries containing perceived obstacles shrink to approximate the actual obstacles' surfaces, free space for transit is correspondingly enlarged, and additional nodes and edges are recorded based on path intersections and stop points. Navigation planning is gradually accelerated with experience since improved global map information minimizes the need for further sensor data acquisition. Our method currently assumes obstacle locations are unchanging, navigation can be successfully conducted using two-dimensional projections, and sensor information is precise.

[1]  C. Eden.  BookOn systems analysis : David Berlinski 186 pages, £ 10.25 (Cambridge, Mass, and London, MIT Press, 1976)☆ , 1978 .

[2]  C. R. Weisbin,et al.  Machine intelligence for robotics applications , 1985 .

[3]  Hans P. Moravec.  Obstacle avoidance and navigation in the real world by a seeing robot rover , 1980 .

[4]  Infotech,et al.  Micro-computer systems , 1978 .

[5]  R. Brooks.  Planning Collision- Free Motions for Pick-and-Place Operations , 1983 .

[6]  W. Hattich,et al.  Fraunhofer-Institut fur Informations- und Oatenverarbeitung (IITB) Sebastian-Kneipp-Str. 12 - 14, 0-7500 Karlsruhe 1 (FRG) , 1986 .

[7]  D. T. Lee,et al.  Computational Geometry—A Survey , 1984, IEEE Transactions on Computers.

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

[9]  James L. Crowley,et al.  Navigation for an intelligent mobile robot , 1985, IEEE J. Robotics Autom..

[10]  Alexandre M. Parodi.  Multi-goal real-time global path planning for an autonomous land vehicle using a high-speed graph search processor , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[11]  Alan M. Thompson.  The Navigation System of the JPL Robot , 1977, IJCAI.

[12]  J. Schwartz,et al.  On the Piano Movers''Problem V: The Case of a Rod Moving in Three-Dimensional Space amidst Polyhedra , 1984 .

[13]  John E. Estes,et al.  APPLICATIONS OF ARTIFICIAL INTELLIGENCE TECHNIQUES TO REMOTE SENSING , 1986 .

[14]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[15]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[16]  R. Chattergy,et al.  Some Heuristics for the Navigation of a Robot , 1985 .

[17]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[18]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[19]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[20]  Takeo Kanade,et al.  First Results in Robot Road-Following , 1985, IJCAI.

[21]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[22]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.