The motion planning problem for a polygonal object moving in a cluttered workspace populated with obstacles of arbitray shape is considered in this paper.

An algorithm that runs in Ο(n2logn) time after Ο(n3log2n) preprocessing time is presented when the object to be moved is polygonal and there is only one movable ...

The purpose of this paper is to survey some recent algorithms and complexity results for motion planning, placing particular emphasis on computational geometry ...

... The most important is the algorithm presented by Avnaim et al. [10] for planning the movement of an arbitrary polygon amidst polygonal obstacles, including ...

The moving object is also polygonal (and it is not allowed to rotate). These results are not only of theoretical interest in that they introduce a new area of ...

The resulting motions have “high clearance,” and so are safer than arbitrary motions, because they stay equally nearest to at least two obstacles. THEOREM 51.2.

We present an automatic system for planning the (translational and rotational) collision-free motion of a convex polygonal body B in two-dimensional space ...

We present a relatively simple motion-planning algorithm for a line segment (a “ladder”) moving in 2-dimensional space amidst polygonal obstacles.

The resulting motions have “high clearance,” and so are safer than arbitrary motions, because they stay equally nearest to at least two obstacles. THEOREM 50.2.

... obstacles and is O4n5 in both the arbitrary and the fat case. In the general case of arbitrary polygonal obstacles, the number of type 4 curves is O4n25 ...