Assembly partitioning along simple paths: The case of multiple translations

Advanced Robotics

Volumn 11, Issue 2, 1996, Pages 127-145

  Halperin, Dan ^a,b   Wilson, Randall H ^a,c  

^a Stanford University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c EASTMAN KODAK COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTUATORS; ALGORITHMS; AUTOMATION; MOTION PLANNING; POLYNOMIALS;

ASSEMBLY PARTITIONING; MULTIPLE TRANSLATIONS; REMOVAL PATH ANALYSIS;

ROBOTIC ASSEMBLY;

EID: 0031381301     PISSN: 01691864     EISSN: 15685535     Source Type: Journal    
DOI: 10.1163/156855397X00281     Document Type: Article

References (23)

1. E. Dunn, Sales Engineer, Bodine Assembly and Test Systems. Personal communication, April 1994.
2. B. K. Natarajan, “On planning assemblies," in Proc. 4th ACM Symp. on Computational Geometry, Urbana-Champaign, IL, 1988, pp. 299-308.
3. J. D. Wolter, “On the automatic generation of plans for mechanical assembly," PhD thesis. University of Michigan, 1988.
4. L. Kavraki and M. N. Kolountzakis, “Partitioning a planar assembly into two connected parts is NP-complete,” Inf. Process. Lett., vol. 3, no. 5, pp. 159-165, 1995.
5. E. M. Arkin, R. Connelly and J. S. B. Mitchell, “On monotone paths among obstacles, with applications to planning assemblies.” in Proc. 5th ACM Symp. on Computational Geometry, Saarbrücken. Germany, 1989, pp. 334-343.
6. R. H. Wilson and J.-C. Latombe, “Geometric reasoning about mechanical assembly,” Art if Intell., vol. 71. no. 2, pp. 371-396, 1994.
7. G. T. Toussaint, “Movable separability of sets,” in Computational Geometry, G. T. Toussaint, ed., Amsterdam: Elsevier, 1985.
8. R. Pollack, M. Sharir and S. Sifrony, “Separating two simple polygons by a sequence of translations,” Discrete Computai. Geometry, vol. 3, pp. 123-136, 1988.
9. A. Schweikard and R. H. Wilson, “Assembly sequences for polyhedral” Algorithmica, vol. 13, no. 6, pp. 539-552, 1995.
10. P. Agarwal, M. de Berg, D. Halperin and M. Sharir, “Efficient generation of ¿'-directional assembly sequences,” in Proc. 7th ACM-SIAM Symp. on Discrete Algorithms, Atlanta, GA, 1996, pp. 122-131.
11. L. J. Guibas, D. Halperin, H. Hirukawa, J.-C. Latombe and R. H. Wilson, “A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions,” in Proc. IEEE Int. Conf. on Robotics Automat., Nagoya, Japan, 1995, pp. 2553-2560.
12. R. H. Wilson, L. Kavraki, T. Lozano-Perez and J.-C. Latombe, “Two-handed assembly sequencing,” Int. J. Robotics Res., vol. 14, no. 4, pp. 335-350, 1995.
13. H. Edelsbrunner, Algorithms in Combinatorial Geometry. Berlin: Springer-Verlag, 1987.
14. L. Guibas and M. Sharir, “Combinatorics and algorithms of arrangements,” in New Trends in Discrete and Computational Geometry, J. Pach, ed. Berlin: Springer. 1993, pp. 9-36.
15. D. Halperin, “Algorithmic motion planning via arrangements of curves and of surfaces,” PhD thesis. Department of Computer Science, Tel Aviv University, July 1992.
16. R. Pollack and M. Roy, “On the number of cells defined by a set of polynomials,” C. R. Acad. Sci. Paris, vol. 316, no. 1, pp. 573-577, 1993.
17. S. Basu, R. Pollack and M.-F. Roy, “A new algorithm to find a point in every cell defined by a family of polynomials.” in Quantifier Elimination and Cylindrical Algebraic Decomposition, B. Caviness and J. Johnson, eds, Berlin: Springer-Verlag. To appear.
18. M. de Berg, L. J. Guibas and D. Halperin, “Vertical decompositions for triangles in 3-space," Discrete Computat. Geometry, vol. 15, pp. 35-61, 1996.
19. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications. New York: Cambridge University Press, 1995.
20. D. Halperin, “Arrangements,” in The Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, eds, Boca Raton, FL; CRC Press. 1997, pp. 389-412.
21. J.-C. Latombe, Robot Motion Planning. Dordrecht: Kluwer, 1991.
22. A. Kaul, M. A. O’Connor and V. Srinivasan, "Computing Minkow'ski sums of regular polygons." in Proc. 3rd Canadian Conf. on Computational Geometry, 1991. pp. 74-77.
23. S. Khanna, R. Motwani and R. H. Wilson. “On certificates and lookahead in dynamic graph problems,” in Proc. 7th ACM-SIAM Symp. on Discrete Algorithms, Atlanta. GA, 1996. pp. 222-231.