Abstract
Most motion planning algorithms have dealt with motion in a static workspace, or more recently, with motion in a workspace that changes in a known manner. We consider the problem of finding collision-free motions in a changeable workspace. That is, we wish to find a motion for an object where the object is permitted to move some of the obstacles. In such a workspace, the final positions of the movable obstacles may or may not be part of the goal. In the case where the final positions of the obstacles are specified, the general problem is shown to be PSPACE-hard. In the case where the final positions of the obstacles are unspecified, the motion planning problem is shown to be NP-hard. Algorithms that run inO(n 3) time are presented for the case where there is only one movable obstacle in a polygonal environment withn corners and the object to be moved and the obstacle are convex polygons of constant complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. Aronov, S. Fortune and G. Wilfong, Minimum speed motions, Robotics Research Technical Report 163, NYU-Courant Institute (July 1988).
R. Benson,Euclidean Geometry and Convexity (McGraw-Hill, 1966).
J. Canny, A new algebraic method for robot motion planning and real geometry, in:Proc. 28th FOCS (1987) pp. 39–48.
J. Canny, B. Donald, J. Reif and P. Xavier, On the complexity of kinodynamic planning, in:Proc. 29th FOCS (1988).
J. Canny and J. Reif, New lower bound techniques for robot motion planning problems, in:Proc. 28th FOCS (1987) pp. 49–60.
S. Fortune and G. Wilfong, Planning constrained motion, in:Proc. 20th Annual ACM STOC (1988) pp. 445–457.
M. Garey and D. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco, 1979).
J. Hopcroft, J. Schwartz and M. Sharir, On the complexity of motion planning for multiple independent objects; PSPACE hardness of the “warehouseman's problem”, Int. J. Robotics Res. 3 (4) (1984) 76–88.
K. Kant and S. Zucker, Toward efficient trajectory planning: The path-velocity decomposition, Int. J. Robotics Res. 5 (3) (1986) 72–89.
K. Kedem, R. Livne, J. Pach and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discr. Comput. Geom. 1 (1) (1986) 59–72.
T. Lozano-Pérez and M. Wesley, An algorithm for planning collision-free paths among polyhedral obstacles, CACM 22 (10) (1979) 560–570.
C. Ó'Dúnlaing, Motion planning with inertial constraints, Algorithmica 2 (4) (1987) 431–475.
J. Reif and M. Sharir, Motion planning in the presence of moving obstacles, in:Proc. 26th FOCS (1985) pp. 144–154.
N. Sarnak and R. Tarjan, Planar point location using persistent search trees, CACM 29 (7) (1986) 669–679.
J. Schwartz and M. Sharir, On the piano movers' problem: II. General techniques for computing topological properties of real algebraic manifolds, Adv. Appl. Math. 4 (1983) 298–351.
J. Schwartz and M. Sharir, On the piano movers' problem: III. Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal boundaries, Int. J. Robotics Res. 2 (3) (1983) 46–75.
R. Sedgewick,Algorithms (Addison-Wesley, Reading, MA, 1983).
M. Sharir and S. Sifrony, Coordinated motion planning for two independent robots, in:Proc. Symp. on Computational Geometry (1988).
R. Tarjan and C. Van Wyck, AnO(n log logn)-time algorithm for triangulating a simple polygon, SIAM J. Comput. 17 (1988) 143–178.
C. Yap, Algorithmic motion planning, in:Advance in Robotics, Vol. 1: Algorithmic and Geometric Aspects, J. Schwartz and C. Yap (eds.) (Lawrence Erlbaum Assoc, Hillsdale, NJ, 1986).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wilfong, G. Motion planning in the presence of movable obstacles. Ann Math Artif Intell 3, 131–150 (1991). https://doi.org/10.1007/BF01530890
Issue Date:
DOI: https://doi.org/10.1007/BF01530890