TY - JOUR

T1 - Efficient motion planning for an L-shaped object

AU - Halperin, Dan

AU - Overmars, Mark H.

AU - Sharir, Micha

PY - 1992

Y1 - 1992

N2 - An algorithm that solves the following motion planning problem is presented, Given an L-shaped body L and a two-dimensional region with n point obstacles whether there is a continuous motion connecting two given positions and orientations of L during which L avoids collision with the obstacles. The algorithm requires O(n2 log2 n) time and O(n2) storage. The algorithm is a variant of the cell-decomposition technique of the configuration space [D. Leven and M. Sharir, J. Algorithms, 8 (1987), pp, 192-215], [J.T. Schwartz and M. Sharir, Comm. Pure Appl. Math, 36 (1983), pp.345-398[, but it employs a new and efficient technique for obtaining a compact representation of the free space, which results in a saving of nearly an order of magnitude. The approach used in our algorithm is also applicable to motion planning of certain robotic arms whose spaces of free placements have a structure similar to that of the L-shaped body.

AB - An algorithm that solves the following motion planning problem is presented, Given an L-shaped body L and a two-dimensional region with n point obstacles whether there is a continuous motion connecting two given positions and orientations of L during which L avoids collision with the obstacles. The algorithm requires O(n2 log2 n) time and O(n2) storage. The algorithm is a variant of the cell-decomposition technique of the configuration space [D. Leven and M. Sharir, J. Algorithms, 8 (1987), pp, 192-215], [J.T. Schwartz and M. Sharir, Comm. Pure Appl. Math, 36 (1983), pp.345-398[, but it employs a new and efficient technique for obtaining a compact representation of the free space, which results in a saving of nearly an order of magnitude. The approach used in our algorithm is also applicable to motion planning of certain robotic arms whose spaces of free placements have a structure similar to that of the L-shaped body.

UR - http://www.scopus.com/inward/record.url?scp=0026818739&partnerID=8YFLogxK

U2 - 10.1137/0221001

DO - 10.1137/0221001

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0026818739

SN - 0097-5397

VL - 21

SP - 1

EP - 23

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 1

ER -