| description abstract | Motion planning is a major problem in robotics. The objective is to plan a collision-free path for a robot moving through a workspace populated with obstacles. In this paper, we present a fast and practical algorithm for moving a convex polygonal robot among a set of polygonal obstacles with translations and rotations. The running time is O(c((n + k)N + n log n)), where c is a parameter controlling the precision of the results, n is the total number of obstacle vertices, k is the number of intersections of configuration space obstacles, and N is the number of obstacles, decomposed into convex objects. This work builds upon the slabbing method proposed by Ahrikencheikh et al. [2], which finds an optimal motion for a point among a set of nonoverlapping obstacles. Here, we extend the slabbing method to the motion planning of a convex polygonal robot with translations and rotations, which also allows overlapping configuration space obstacles. This algorithm has been fully implemented and the experimental results show that it is more robust and faster than other approaches. | |
