Efficiently planning compliant motion in the plane

SIAM Journal on Computing

Volumn 25, Issue 3, 1996, Pages 562-599

  Friedman, J ^a   Hershberger, J ^b   Snoeyink, J ^c  

^a D E SHAW RESEARCH   (United States)

^b MENTOR GRAPHICS CORPORATION   (United States)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Compliant motion; Computational geometry; Path hull data structure

Indexed keywords

EID: 0000887452     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794263191     Document Type: Article

References (36)

1. M. BRADY, J. M. HOLLERBACH, T. L. JOHNSON, T. LOZANO-PEREZ, AND M. MASON, Robot Motion: Planning and Control, MIT Press, Cambridge, MA, 1982.
2. A. J. BRIGGS, An efficient algorithm for one-step planar compliant motion planning with uncertainty, Algorithmica, 8 (1992), pp. 195-208.
3. S. J. BUCKLEY, Planning and Teaching Compliant Motion Strategies, Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1987.
4. J. F. CANNY, A new algebraic method for robot motion planning and real geometry, in Proc. 28th IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1987, pp. 39-48.
5. J. F. CANNY AND J. REIF, New lower bound techniques for robot motion planning problems, in Proc. 28th IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1987, pp. 49-60.
6. B. CHAZELLE, Triangulating a simple polygon in linear time, Discrete Comput. Geom., 6 (1991), pp. 485-524.
7. D. DOBKIN, L. GUIBAS, J. HERSHBERGER, AND J. SNOEYINK, An efficient algorithm for finding the CSG representation of a simple polygon, Algorithmica, 10 (1993), pp. 1-23.
8. B. R. DONALD, Error Detection and Recovery in Robotics, Lecture Notes in Comput. Sci. 336, Springer-Verlag, New York, 1989.
9. _, The complexity of planar compliant motion under uncertainty, Algorithmica, 5 (1990), pp. 353-382.
10. H. EDELSBRUNNER, L. J. GUIBAS, AND J. STOLFI, Optimal point location in a monotone subdivision, SIAM J. Comput., 15 (1986), pp. 317-340.
11. M. A. ERDMANN, Using backprojections for fine motion planning with uncertainty, Internat. J. Robotics Res., 5 (1986), pp. 19-45.
12. M. A. ERDMANN AND M. MASON, An exploration of sensorless manipulation, in Proc. IEEE International Conference on Robotics, IEEE Press, Piscataway, NJ, 1986, pp. 1569-1574.
13. S. FORTUNE AND G. WILFONG, Planning constrained motion, in Proc. 20th ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1988, pp. 445-459.
14. A. FOURNIER AND D. Y. MONTUNO, Triangulating simple polygons and equivalent problems, ACM Transactions on Graphics, 3 (1984), pp. 153-174.
15. J. FRIEDMAN, J. HERSHBERGER, AND J. SNOEYINK, Compliant motion in a simple polygon, in Proc. 5th ACM Symposium on Computational Geometry, Association for Computing Machinery, 1989, pp. 175-186.
16. _, Input-sensitive compliant motion in the plane, in Proc. 2nd Scandinavian Workshop on Algorithm Theory, Springer-Verlag, Berlin, 1990, pp. 225-237.
17. M. R. GAREY, D. S. JOHNSON, F. P. PREPARATA, AND R. E. TARJAN, Triangulating a simple polygon, Inform. Process. Lett., 7 (1978), pp. 175-179.
18. R. L. GRAHAM AND F. F. YAO, Finding the convex hull of a simple polygon, J. Algorithms, 4 (1983), pp. 324-331.
19. L. J. GUIBAS, L. RAMSHAW, AND J. STOLFI, A kinetic framework for computational geometry, in Proc. 24th IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1983, pp. 100-111.
20. L. J. GUIBAS, M. SHARIR, AND S. SIFRONY, On the general motion-planning problem with two degrees of freedom, Discrete Comput. Geom., 4 (1989), pp. 491-521.
21. P. J. HEFFERNAN AND J. S. B. MITCHELL, Structured visibility profiles with applications to problems in simple polygons, in Proc. 6th ACM Symposium on Computational Geometry, Association for Computing Machinery, 1990, pp. 53-62.
22. J. HERSHBERGER AND J. SNOEYINK, Computing minimum length paths of a given homotopy class, in Proc. 2nd Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 519, Springer-Verlag, New York, 1991, pp. 331-342.
23. S. HUDDLESTON AND K. MEHLHORN, A new data structure for representing sorted lists, Acta Inform., 17 (1982), pp. 157-184.
24. D. KIRKPATRICK, Optimal search in planar subdivisions, SIAM J. Comput., 12 (1983), pp. 28-35.
25. J.-C. LATOMBE, Motion planning with uncertainty: The preimage backchaining approach, Tech. Report STAN-CS-88-1196, Department of Computer Science, Stanford University, Stanford, CA, 1988.
26. _, Robot Motion Planning, Kluwer International Series in Engineering and Computer Science, SECS 0124, Kluwer Academic Publishers, Norwell, MA, 1991.
27. T. LOZANO-PÉREZ, M. T. MASON, AND R. H. TAYLOR, Automatic synthesis of fine-motion strategies for robots, Internat. J. Robotics Res., 3 (1984), pp. 3-24.
28. T. LOZANO-PÉREZ AND M. A. WESLEY, An algorithm for planning collision-free paths among polyhedral obstacles, Comm. Assoc. Comput. Mach., 22 (1979), pp. 560-570.
29. A. MELKMAN, On-line construction of the convex hull of a simple polyline, Inform. Process. Lett., 25 (1987), pp. 11-12.
30. B. K. NATARAJAN, On Moving and Orienting Objects, Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, NY, 1986.
31. C. Ó'DÚNLAING AND C. K. YAP, A "retraction" method for planning the motion of a disc, J. Algorithms, 6 (1986), pp. 104-111.
32. J. O'ROURKE, Computational Geometry in C, Cambridge University Press, London, 1994.
33. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
34. J. T. SCHWARTZ, M. SHARIR, AND J. HOPCROFT, eds., Planning, Geometry, and Complexity of Robot Motion, Ablex Series in Artificial Intelligence, Ablex, Norwood, NJ, 1987.
35. M. SHARIR AND A. SCHORR, On shortest paths in polyhedral spaces, SIAM J. Comput., 15 (1986), pp. 193-215.
36. G. TOUSSAINT AND D. AVIS, On a convex hull algorithm for polygons and its applications to triangulation problems, Pattern Recognition, 15 (1982), pp. 23-29.