Dynamic path planning in sensor-based terrain acquisition

The terrain acquisition problem is formulated as that of continuous motion planning, and no constraints are imposed on obstacle geometry. Two algorithms are described for acquiring planar terrains with obstacles of arbitrary shape. Estimates of the algorithm performance are derived as upper bounds on the lengths of generated paths. >

[1]  Hans P. Moravec,et al.  The Stanford Cart and the CMU Rover , 1983, Proceedings of the IEEE.

[2]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[3]  Rodney A. Brooks,et al.  Visual map making for a mobile robot , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

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

[5]  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.

[6]  Alberto Elfes,et al.  Sonar-based real-world mapping and navigation , 1987, IEEE J. Robotics Autom..

[7]  S. Sitharama Iyengar,et al.  On terrain acquisition by a finite-sized mobile robot in plane , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[8]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[9]  Vladimir J. Lumelsky,et al.  A paradigm for incorporating vision in the robot navigation function , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.