Efficient algorithms for exact motion planning amidst fat obstacles

Abstract

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 xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>