Terrain Exploration of a Sensor-Based Robot Moving Among Unknown Obstacles of Polygonal Shape

[1]  Leonidas J. Guibas,et al.  Visibility-polygon search and euclidean shortest paths , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

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

[4]  Meghanad D. Wagh,et al.  Robot path planning using intersecting convex shapes: Analysis and simulation , 1987, IEEE J. Robotics Autom..

[5]  Mathukumalli Vidyasagar,et al.  Path planning for moving a point object amidst unknown obstacles in a plane: the universal lower bound on the worst path lengths and a classification of algorithms , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[6]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[7]  John F. Canny,et al.  A Voronoi method for the piano-movers problem , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[8]  Rodney A. Brooks,et al.  Natural decomposition of free space for path planning , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[9]  Rodney A. Brooks,et al.  Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.

[10]  Vladimir J. Lumelsky,et al.  Dynamic path planning in sensor-based terrain acquisition , 1990, IEEE Trans. Robotics Autom..

[11]  Osamu Takahashi,et al.  Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..

[12]  Andrew K. C. Wong,et al.  Structuring Free Space as a Hypergraph for Roving Robot Path Planning and Navigation , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.