Abstract
We present anO(n 2) algorithm for planning a coordinated collision-free motion of two independent robot systems of certain kinds, each having two degrees of freedom, which move in the plane amidst polygonal obstacles having a total ofn corners. We exemplify our technique in the case of two “planar Stanford arms”, but also discuss the case of two discs or convex translating objects. The algorithm improves previous algorithms for this kind of problems, and can be extended to a fairly simple general technique for obtaining efficient coordinated motion planning algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Agarwal, M. Sharir and P. Shor, Sharp upper and lower bounds for the length of general Davenport Schinzel sequences, J. Combin. Theory. Ser. A 52 (1989) 228–274.
B. Aronov and M. Sharir, Triangles in space, or: Building (and analyzing) castles in the sky,Proc. 4th ACM Symp. on Computational Geometry (1988) pp. 381–391.
J. Canny, The complexity of robot motion planning, Ph.D. Dissertation, Comp. Sci. Dept., MIT (May, 1987).
M. Erdman and T. Lozano-Perez, On multiple moving objects, Algorithmica 2 (1987) 477–521.
S. Fortune, G. Wilfong and C. Yap, Coordinated motion of two robot arms,Proc. IEEE Conf. on Robotics and Automation (April 1986) pp. 1216–1223.
L.J. Guibas, M. Sharir and S. Sifrony, On the general motion planning problem with two degrees of freedom, Discr. Comput. Geom. 4 (1989) 491–521.
S. Hart and M. Sharir, Nonlinearity of Davenport Schinzel sequences and of generalized path compression schemes, Combinatorica 6 (1986) 151–177.
W. Hurewitcz and H. Wallman,Dimension Theory (Princeton University Press, 1948).
K. Kedem, R. Livne, J. Pach and M. Sharir, On the union of Jordan regions and collison-free translational motion amidst polygonal obstacles, Discr. Comput. Geom. 1 (1986) 59–71.
Y. Ke and J. O'Rourke, Moving a ladder in three dimension: Upper and lower bounds,Proc. 3rd ACM Symp. on Computational Geometry (1987) pp. 136–146.
K. Kedem and M. Sharir, An efficient motion planning algorithm for a convex rigid polygonal object in two-dimensional polygonal space, Discr. Comput. Geom. 5 (1990) 43–75.
E.H. Lockwood,A Book of Curves (Cambridge University Press, 1967).
D. Leven and M. Sharir, An efficient and simple motion-planning algorithm for a ladder moving in 2-dimensional space amidst polygonal barriers, J. Algorithms 8 (1987) 192–215.
C. Ó'Dúnlaing and C. Yap, A “retraction” method for planning the motion of a disc, J. Algorithms 6 (1985) 104–111.
C. Ó'Dúnlaing, M. Sharir and C. Yap, Generalized Voronoi diagrams for a ladder: I. Topological considerations, Comm. Pure Appl. Math. 39 (1986) 423–483.
C. Ó'Dúnlaing, M. Sharir and C. Yap, Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram, Algorithmica 2 (1987) 27–59.
R. Pollack, M. Sharir and S. Sifrony, Separating two simple polygons by a sequence of translations, Discr. Comput. Geom. 3 (1988) 123–136.
G. Ramanathan and V.S. Alagar, Algorithmic motion planning in robotics: Coordinated motion of several discs amidst polygonal obstacles,Proc. IEEE Conf. on Robotics and Automation (1985) pp. 514–522.
J.T. Schwartz and M. Sharir, On the piano movers' problem: I. The case of a rigid polygonal body moving amidst polygonal barriers, Comm. Pure Appl. Math. 36 (1983) 345–398.
J.T. 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.T. 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 barriers, Int. J. Robotics Res. 2 (3) (1983) 46–75.
J.T. Schwartz and M. Sharir, Efficient motion planning algorithms in environments of bounded local complexity, Tech. Rept. 164, Comp. Sci. Dept., Courant Institute (June 1985).
S. Sifrony and M. Sharir, A new efficient motion-planning algorithm for a rod in 2-D polygonal space, Algorithmica 2 (1987) 367–402.
C.K. Yap, Coordinating the motion of several discs, Tech. Rept. 105, Comp. Sci. Dept., Courant Institute (February 1984).
C.K. Yap, AnO(n logn) algorithm for the Voronoi diagram of a set of simple curve segments, Discr. Comput. Geom. 2 (1987) 365–393.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sharir, M., Sifrony, S. Coordinated motion planning for two independent robots. Ann Math Artif Intell 3, 107–130 (1991). https://doi.org/10.1007/BF01530889
Issue Date:
DOI: https://doi.org/10.1007/BF01530889