ISSN:
1432-0541
Keywords:
Shortest-path motion
;
Motion planning
;
Piano movers problem
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We present an algorithm for determining the shortest restricted path motion of a polygonal object amidst polygonal obstacles. The class of motions which are allowed can be described as follows: a designated vertex,P, of the polygonal object traverses a piecewise linear path, whose breakpoints are restricted to the vertices of the obstacles. The distance measure being minimized is the length of the path traversed byP. Our algorithm runs in timeO(n 4kogn). We also discuss a variation of this algorithm which minimizes any positive linear combination of length traversed byP and angular rotation of the ladder aboutP. This variation requiresO(n 5) time.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01840372
Permalink
