Skip to main content
Log in

A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We present here a new and efficient algorithm for planning collision-free motion of a line segment (a rod or a “ladder”) in two-dimensional space amidst polygonal obstacles. The algorithm uses a different approach than those used in previous motion-planning techniques, namely, it calculates the boundary of the (three-dimensional) space of free positions of the ladder, and then uses this boundary for determining the existence of required motions, and plans such motions whenever possible. The algorithm runs in timeO(K logn) =O(n 2 logn) wheren is the number of obstacle corners and whereK is the total number of pairs of obstacle walls or corners of distance less than or equal to the length of the ladder. The algorithm has thus the same complexity as the best previously known algorithm of Leven and Sharir [5], but if the obstacles are not too cluttered together it will run much more efficiently. The algorithm also serves as an initial demonstration of the viability of the technique it uses, which we expect to be useful in obtaining efficient motion-planning algorithms for other more complex robot systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. L. Bentley and A. Ottman, Algorithm for reporting and counting geometric intersections,IEEE Trans. Comput.,28 (1979), 643–647.

    Article  MATH  Google Scholar 

  2. J. E. Hopcroft and G. Wilfong, On the motion of objects in contact, Technical Report 84-602, Computer Science Department, Cornell University, 1984.

  3. K. Kedem and M. Sharir, Efficient algorithm for planning translational collision-free motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles,Proceedings of the ACM Symposium on Computational Geometry, 1985, pp. 75–80.

  4. K. Kedem, R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles,Discrete Comput. Geom.,1 (1986), 59–71.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. Leven and M. Sharir, An efficient and simple motion-planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers,Proceedings of the ACM Symposium on Computational Geometry, 1985, pp. 221–227 (also to appear inJ. Algorithms.)

  6. D. Leven and M. Sharir, Planning a purely translational motion of a convex object in two-dimensional space using generalized Voronoi diagrams,Discrete Comput. Geom.,2 (1987), 9–31.

    Article  MATH  MathSciNet  Google Scholar 

  7. E. E. Moise,Geometric Topology in Dimension 2and 3, Springer-Verlag, New York, 1977.

    MATH  Google Scholar 

  8. C. O'Dunlaing, M. Sharir, and C. Yap, Generalized Voronoi diagrams for a ladder: I. Topological considerations,Comm. Pure Appl. Math.,39 (1986), 423–483.

    Article  MATH  MathSciNet  Google Scholar 

  9. C. O'Dunlaing and C. Yap, A retraction method for planning the motion of a disc,J. Algorithms,6 (1985), 104–11.

    Article  MATH  MathSciNet  Google Scholar 

  10. C. O'Dunlaing, M. Sharir, and C. Yap, Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram,Algorithmica,2 (1987), 27–59.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. O'Rourke, Lower bounds on moving a ladder, Technical Report, Department of EECS, Johns Hopkins University, 1985.

  12. 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.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. T. Schwartz and M. Sharir, On the piano movers' problem: II. General techniques for computing topological properties of real algebraic manifolds,Adv. in Appl. Math.,4 (1983), 298–351.

    Article  MATH  MathSciNet  Google Scholar 

  14. 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,Robotics Res.,2 (1983), 46–75.

    Article  MathSciNet  Google Scholar 

  15. J. T. Schwartz and M. Sharir, On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles,Comm. Pure Appl. Math.,37 (1984), 815–848.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. T. Schwartz and M. Sharir, Efficient motion planning algorithms in environments of bounded local complexity, Technical Report, Computer Science Department, Courant Institute, 1985.

  17. M. Sharir and E. Ariel-Sheffi, On the piano movers' problem: IV. Various decomposable two-dimensional motion-planning problems,Comm. Pure Appl. Math.,37 (1984), 479–493.

    Article  MATH  MathSciNet  Google Scholar 

  18. C. K. Yap, Coordinating the motion of several discs, Technical Report 105, Computer Science Department, Courant Institute, 1984.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by Chee-Keng Yap.

Work on this paper has been supported in part by a grant from the Joint Ramot-Israeli Ministry of Industry Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sifrony, S., Sharir, M. A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space. Algorithmica 2, 367–402 (1987). https://doi.org/10.1007/BF01840368

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01840368

Key words

Navigation