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.

1.
Ahrikencheikh, C., and Seireg, A. A., 1994, Optimized-Motion Planning, Theory and Implementation, John Wiley & Sons, Inc.
2.
Ahrikencheikh, C., Seireg, A. A., and Ravani, B., 1994, “Optimal and Conforming Motion of a Point in a Constrained Plane,” ASME JOURNAL OF MECHANICAL DESIGN, pp. 474–479.
3.
Barbehenn
M.
, and
Hutchinson
S.
,
1995
, “
Efficient Search and Hierarchical Motion Planning by Dynamically Maintaining Single-Source Shortest Paths Trees
,”
IEEE Transactions on Robotics and Automation
, Vol.
11
, No.
2
, Apri., pp.
198
214
.
4.
Brooks
R.
, and
Lozano-Perez
T.
,
1985
, “
A Subdivision Algorithm in Configuration Space for Findpath with Rotation
,”
IEEE Transactions on Systems, Man, and Cybernetics
, Vol.
SMC-15
, No.,
2
, Mar./Apr., pp.
224
233
.
5.
Kedem, K., and Sharir, M., 1985, “An Efficient Algorithm for Planning Collision-free Translational Motion of a Convex Polygonal Object in 2-dimensional Space Amidst Polygonal Obstacles,” Proc. ACM Symp. on Computational Geometry, pp. 75–80.
6.
Lozano-Perez, T., 1983, “Spatial Planning: A Configuration Space Approach,” IEEE Transactions On Computer, Vol. c-32. No. 2.
7.
Nievergelt
J.
, and
Preparata
F. P.
,
1982
, “
Plane-sweep Algorithms for Intersecting Geometric Figures
,”
Comm. ACM
, Vol.
25
, pp.
739
747
.
8.
Ottman
T.
,
Widmayer
P.
, and
Wood
D.
,
1985
, “
A Fast Algorithm for Boolean Mask Operations
,”
Computer Vision, Graphics and Image Processing
, Vol.
30
, pp.
249
268
,
9.
Sharir, M., 1987, “Efficient Algorithms for Planning Purely Translational Collision-free Motion in Two and Three Dimensions,” Proc. IEEE Symp. On Robotics and Automation, pp. 1326–1331.
10.
Vleugels, J. M., Kok, J. N., and Overmars, M. H., 1993, “Motion Planning Using A Colored Kohonen Network,” Utrecht University, Department of Computer Science, Technical Report.
11.
Zhu
D.
, and
Latombe
J.-C.
,
1991
, “
New Heuristic Algorithms for Efficient Hierarchical Path Planning
,”
IEEE Transactions on Robotics and Automation
, Vol.
7
, No.
1
, Feb., pp.
9
20
.
This content is only available via PDF.
You do not currently have access to this content.