A general framework for assembly planning: The motion space approach

Algorithmica (New York)

Volumn 26, Issue 3-4, 2000, Pages 577-601

  Halperin, D ^a   Latombe, J C ^b   Wilson, R H ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b Stanford University   (United States)

^c EASTMAN KODAK COMPANY   (United States)

Author keywords

Assembly planning; Assembly sequencing; Manufacturing; Motion space; Nondirectional blocking graph

Indexed keywords

EID: 0000883116     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004539910025     Document Type: Article

References (47)

1. P. Agarwal, M. de Berg, D. Halperin, and M. Sharir. Efficient generation of k-directional assembly sequences. In Proc. 7th ACM-SIAM Symp. on Discrete Algorithms, pages 122-131, 1996.
2. 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, pages 334-343, 1989.
3. D. F. Baldwin, T. E. Abell, M.-C. M. Lui, T. L. De Fazio, and D. E. Whitney. An integrated computer aid for generating and evaluating assembly sequences for mechanical products. IEEE Trans. Robotics Automat., 7(1):78-94, 1991.
4. M. de Berg. Ray Shooting, Depth Orders and Hidden Surface Removal. Volume 703 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1993.
5. M. de Berg, L. J. Guibas, and D. Halperin. Vertical decompositions for triangles in 3-space. Discrete Comput. Geom., 15:35-61, 1996.
6. M. de Berg, M. Overmars, and O. Schwarzkopf. Computing and verifying depth orders. SIAM J. Comput., 23:437-446, 1994.
7. A. Delchambre and P. Gaspart. KBAP: An industrial prototype of knowledge-based assembly planner. In Proc. IEEE Internat. Conf. on Robotics and Automation, pages 2404-2409, 1992.
8. B. R. Donald. The complexity of planar compliant motion planning under uncertainty. Algorithmica, 5:353-382, 1990.
9. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987.
10. H. Edelsbrunner, R. Seidel, and M. Sharir. On the zone theorem for hyperplane arrangements. SIAM J. Comput., 22(2):418-429, 1993.
11. K. Y. Goldberg. Orienting polygonal parts without sensors. Algorithmica, 10:201-225, 1993.
12. M. Goldwasser. An implementation for maintaining arrangements of polygons. In Proc. 11th Ann. ACM Symp. on Computational Geometry, pages C32-C33, 1995.
13. M. Goldwasser, J. C. Latombe, and R. Motwani. Complexity measures for assembly sequences. In Proc. IEEE Internat. Conf. on Robotics and Automation, pages 1581-1587, 1996.
14. M. Goldwasser and R. Motwani. Intractability of assembly sequencing: unit disks in the plane. Proc. 5th Internat. Workshop on Algorithms and Data Structures (WADS '97). Volume 1272 of Lecture Notes in Computer Science. Springer, Berlin, pages 307-320, 1997.
15. M. Goldwasser. Complexity Measures for Assembly Sequencing. Ph.D. thesis, Computer Science Department, Stanford University, Stanford, CA, 1997.
16. 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 Internat. Conf. on Robotics and Automation, pages 2553-2560, 1995. Internat. J. Comput. Geom. Appl., 8(2):179-199, 1998.
17. 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 Internat. Conf. on Robotics and Automation, pages 2553-2560, 1995. Internat. J. Comput. Geom. Appl., 8(2):179-199, 1998.
18. L. J. Guibas and F. F. Yao. On translating a set of rectangles. In Proc. 12th ACM Symp. on Theory of Computing, pages 154-160, 1980.
19. D. Halperin and R. H. Wilson. Assembly partitioning along simple paths: the case of multiple translations. In Proc. IEEE Internat. Conf. on Robotics and Automation, pages 1585-1592, 1995. To appear in Advanced Robotics.
20. H. Hirukawa, T. Matsui, and K. Takase. Automatic determination of possible velocity and applicable force of frictionless objects in contact from a geometric model. IEEE Trans. Robotics Automat., 10(3):309-322, 1994.
21. R. L. Hoffman. Automated assembly in a CSG domain. In Proc. IEEE Internat. Conf. on Robotics and Automation, pages 210-215, 1989.
22. L. S. Homem de Mello. Task Sequence Planning for Robotic Assembly. Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA, 1989.
23. L. S. Homem de Mello and A. C. Sanderson. A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Trans. Robotics Automat., 7(2):228-240, 1991.
24. R. E. Jones and R. H. Wilson. A survey of constraints in assembly planning. In Proc. IEEE Internat. Conf. on Robotics and Automation, pages 1525-32, 1996.
25. R. E. Jones and R. H. Wilson. An interactive assembly planning system. In Video Proc. IEEE Internat. Conf. on Robotics and Automation, 1997.
26. R. E. Jones, R. H. Wilson, and T. L. Calton. Constraint-based interactive assembly planning. In Proc. IEEE Internat. Conf. on Robotics and Automation, pages 913-20, 1997.
27. L. E. Kavraki and M. N. Kolountzakis. Partitioning a planar assembly into two connected parts is NP-complete. Inform. Process. Lett., 55(3):159-165, 1995.
28. L. E. Kavraki, P. Svestka, J. C. Latombe, and M. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robotics Automat., 12(4):566-580, 1996.
29. 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, pages 222-231, 1996.
30. H. Ko and K. Lee. Automatic assembling procedure generation from mating conditions. Computer-Aided Design, 19(1):3-10, 1987.
31. J. C. Latombe. Robot Motion Planning. Kluwer, Dordrecht, 1991.
32. A. Lazanas and J. C. Latombe. Landmark-based robot navigation. Algorithmica, 13:472-501, 1995.
33. J. C. Latombe, R. H. Wilson, and F. Cazals. Assembly sequencing with toleranced parts. Computer-Aided Design, 29(2):159-174, Feb. 1997.
34. T. Lozano-Pérez. Spatial planning: a configuration space approach. IEEE Trans. Comput., 32(2):108-120, 1983.
35. B. K. Natarajan. On planning assemblies. In Proc. 4th ACM Symp. on Computational Geometry, pages 299-308, 1988.
36. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
37. B. Romney, C. Godard, M. Goldwassser, and G. Ramkumar. An efficient system for geometric assembly sequence generation and evaluation. In Proc. ASME Internat. Computers in Engineering Conf., pages 699-712, 1995.
38. B. Romney. On the Concurrent Design of Assembly Sequences and Fixtures. Ph.D. thesis, Electrical Engineering Department, Stanford University, Stanford, CA, 1997.
39. A. Schweikard and R. H. Wilson. Assembly sequences for polyhedra. Algorithmica, 13(6):539-552, 1995.
40. R. H. Wilson. On Geometric Assembly Planning. Ph.D. thesis, Technical Report STAN-CS-92-1416, Stanford University, Stanford, CA, March 1992.
41. R. H. Wilson. A framework for geometric reasoning about tools in assembly. In Proc. IEEE Internat. Conf. on Robotics and Automation, pages 1837-44, 1996.
42. R. H. Wilson. Geometric Reasoning About Assembly Tools. Technical Report SAND95-2423, Sandia National Labs, Albuquerque, NM, 1996. Submitted to Artificial Intelligence.
43. R. H. Wilson, L. Kavraki, T. Lozano-Perez, and J. C. Latombe. Two-handed assembly sequencing. Internat. J. Robotics Res., 14(4):335-350, 1995.
44. R. H. Wilson and J. C. Latombe. Geometric reasoning about mechanical assembly. Artificial Intelligence, 71(2):371-396, 1994.
45. R. H. Wilson and T. Matsui. Partitioning an assembly for infinitesimal motions in translation and rotation. In Proc. Internat. Conf. on Intelligent Robots and Systems, pages 1311-1318, 1992.
46. J. D. Wolter. On the Automatic Generation of Plans for Mechanical Assembly. Ph.D. thesis, University of Michigan, 1988.
47. T. C. Woo and D. Dutta. Automatic disassembly and total ordering in three dimensions. J. Eng. Industry, 113(2):207-213, 1991.