Efficient algorithms for exact motion planning amidst fat obstacles

The complexity of exact motion planning algorithms greatly depends on the complexity of the robot's free space, i.e., the set of all collision-free placements of the robot. Theoretically, the complexity of the free space can be very high. In practice, the complexity of the free space tends to be much smaller. It is shown that, under some realistic assumptions, the complexity of the free space of a robot moving amid fat obstacles is linear in the number of obstacles. The complexity results lead to efficient algorithms for motion planning amidst fat obstacles; it is shown that the O(n/sup 5/) motion planning algorithm by J.T. Schwartz and M. Sharir (1983) runs in O(n/sup 2/) time if the obstacles are fat. The algorithm is modified to improve the running time to O(n log/sup 2/ n).<<ETX>>

[1]  J. Davenport.  A "Piano Movers" Problem. , 1986 .

[2]  Micha Sharir,et al.  Fat Triangles Determine Linearly Many Holes , 1994, SIAM J. Comput..

[3]  S. LaValle,et al.  Motion Planning , 2008, Springer Handbook of Robotics.

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

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

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

[7]  Mark H. Overmars,et al.  Point Location in Fat Subdivisions , 1992, Inf. Process. Lett..

[8]  Jose M. Bañon.  Implementation and extension of the ladder algorithm , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[9]  Jose M. Baiion.  Implementation and Extension of the Ladder Algorithm , 1990 .

[10]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[11]  Micha Sharir,et al.  Fat triangles determine linearly many holes (computational geometry) , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[12]  Mark H. Overmars,et al.  The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles , 1992, Comput. Geom..

[13]  Mark H. Overmars,et al.  Range searching in a set of line segments , 1985, SCG '85.