Complexity measures for assembly sequences

International Journal of Computational Geometry and Applications

Volumn 9, Issue 4-5, 1999, Pages 371-417

  Goldwasser, Michael H ^a   Motwani, Rajeev ^a  

^a Stanford University   (United States)

Author keywords

AND OR scheduling, non directional blocking graphs; Approximability; Assembly sequencing; Cost measures

Indexed keywords

EID: 0033409683     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218195999000248     Document Type: Article

References (74)

1. P. K. Agarwal, M. de Berg, D. Halperin, and M. Sharir, "Efficient generation of k-directional assembly sequences," in Proc. Seventh Annual ACM-SIAM Symp. on Discrete Algorithms, Atlanta, Georgia, Jan. 1996, pp. 122-131.
2. S. Arora, "Polynomial-time approximation schemes for Euclidean TSP and other geometric problems," in Proc. 37th Symp. on Foundations of Computer Science, Burlington, Vermont, Oct. 1996, pp. 1-11.
3. S. Arora, L. Babai, J. Stern, and Z. Sweedyk, "The hardness of approximate optima in lattices, codes and linear systems," J. Comput. Syst. Sci. 54 (1997) 317-331.
4. S. Arora and C. Lund, "Hardness of approximations," in Approximation Algorithms for NP-Hard Problems, ed. D. Hochbaum (PWS Publishing, Boston, 1996) pp. 399-446.
5. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and the hardness of approximation problems," J. ACM 45 (1998) 501-555.
6. B. Baker, "Approximation algorithms for NP-complete problems on planar graphs," J. ACM 41 (1994) 153-180.
7. R. Bhatia, S. Khuller, and J. Naor, "The loading time scheduling problem," in Proc. 36th Symp. on Foundations of Computer Science, Milwaukee, Wisconsin, Oct. 1995, pp. 72-81.
8. P. Bonizzoni, M. Duella, and G. Mauri, "Approximation complexity of longest common subsequence and shortest common supersequence over fixed alphabet," Technical Report 117/94, Università degli Studi di Milano, 1994.
9. G. Boothroyd, Assembly Automation and Product Design (Marcel Dekker, New York, 1991).
10. G. Boothroyd, P. Dewhurst, and W. Knight, Product Design for Manufacture and Assembly (Marcel Dekker, New York, 1994).
11. S. Caselli and F. Zanichelli, "On assembly sequence planning using petri nets," in Proc. IEEE Int. Symp. on Assembly and Task Planning, Pittsburgh, Pennsylvania, Aug. 1995, pp. 239-244.
12. S. Chakrabarty and J. Wolter, "A hierarchical approach to assembly planning," in Proc. IEEE Int. Conf. on Robotics and Automation, San Diego, California, May 1994, pp. 258-263.
13. B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, and J. Snoeyink, "Counting and cutting cycles of lines and rods in space," Computational Geometry: Theory and Applications 1 (1992) 305-323.
14. P. Crescenzi and V. Kahn, "A compendium of NP optimization problems," Technical Report SI/RR-95/02, Dipartimento di Scienceze dell'Informazione. Università di Roma "La Sapienza", 1995.
15. R. Dawson, "On removing a ball without disturbing the others," Mathematics Magazine 57 (1984) 27-30.
16. M. de Berg, Ray Shooting, Depth Orders and Hidden Surface Removal (Springer-Verlag, Berlin, 1993).
17. M. de Berg, M. Overmars, and O. Schwarzkopf, "Computing and verifying depth orders," SIAM J. Comput. 23 (1994) 432-446.
18. T. De Fazio and D. Whitney, "Simplified generation of all mechanical assembly sequences," IEEE Trans. on Robotics and Automation 3 (1987) 640-658.
19. F. Dehne and J.-R. Sack, "Translation separability of polygons," Visual Computer 3 (1987) 227-235.
20. D. Dutta and T. Woo, "Algorithm for multiple disassembly and parallel assemblies," J. Engineering for Industry 117 (1995) 102-109.
21. U. Feige, "A threshold of In n for approximating set cover," in Proc. 28th A CM Symp. on Theory of Computing, Philadelphia, Pennsylvania, May 1996, pp. 314-318.
22. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979).
23. D. Gillies, "Algorithms to schedule tasks with AND/OR precedence constraints," Ph.D. thesis, University of Illinois, Urbana, IL, 1993.
24. D. Gillies and J. Liu, "Scheduling tasks with AND/OR precedence constraints," SIAM J. Comput. 24 (1995) 797-810.
25. M. Goldwasser, "Complexity measures for assembly sequencing," Ph.D. thesis, Dept. Comp. Sci., Stanford Univ., Stanford, CA, 1907. Stanford Technical Report STAN-CS-TR-97-1590.
26. M. Goldwasser, J.-C. Latombe, and R. Motwani, "Complexity measures for assembly sequences," in Proc. IEEE Int. Conf. on Robotics and Automation, Minneapolis, Minnesota, Apr. 1996, pp. 1581-1587.
27. M. Goldwasser and R. Motwani, "Intractability of assembly sequencing: Unit disks in the plane," in Proc. Fifth Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 1272 (Springer-Verlag, Berlin, 1997) pp. 307-320.
28. S. Gottschlich, C. Ramos, and D. Lyons, "Assembly and task planning: A taxonomy," IEEE Robotics and Automation Magazine 1 (1994) 4-12.
29. L. J. Guibas, D. Halperin, H. Hirukawa, J.-C. Latombe, and R. H. Wilson, "Polyhedral assembly partitioning using maximally covered cells in arrangements of convex polytopes," Int. J. Computational Geometry and Applications 8 (1998) 179-199.
30. L. J. Guibas and F. F. Yao, "On translating a set of rectangles," in Computational Geometry, Advances in Computing Research, ed. F. Preparata (JAI Press, 1983) pp. 61-77.
31. D. Halperin, J.-C. Latombe, and R. H. Wilson, "A general framework for assembly planning: The motion space approach," in Proc. 14th Annual Symp. on Computational Geometry, Minneapolis, Minnesota, June 1998. To appear in Algorithmica.
32. D. Halperin and R. Wilson, "Assembly partitioning along simple paths: the case of multiple translations," in Proc. IEEE Int. Conf. on Robotics and Automation, Nagoya, Japan, May 1995, pp. 1585-1592.
33. 1-ε," in Proc. 37th Symp. on Foundations of Computer Science, Burlington, Vermont, Oct. 1996, pp. 627-636.
34. R. Hoffman, "A common sense approach to assembly sequence planning," in Computer-Aided Mechanical Assembly Planning (Kluwer Academic, Boston, 1991) pp. 289-314.
35. L. Homem de Mello and A. Sanderson, "AND/OR graph representation of assembly plans," IEEE Trans. on Robotics and Automation 6 (1990) 188-199.
36. L. Homem de Mello and A. Sanderson, Computer-Aided Mechanical Assembly Planning (Kluwer Academic, Boston, 1991).
37. L. Homem de Mello and A. Sanderson, "A correct and complete algorithms for the generation of mechanical assembly sequences," IEEE Trans. on Robotics and Automation 7 (1991) 228-240.
38. J. Hopcroft, J. Schwartz, and M. Sharir, "On the complexity of motion planning for multiple independent objects: P-space hardness of the "Warehouseman's Problem"," Int. J. Robotics Research 3 (1984) 76-88.
39. T. Jiang and M. Li, "On the approximation of shortest common supersequences and longest common subsequences," SIAM J. Comput. 24 (1995) 1122-1139.
40. D. Johnson, "Approximation algorithms for combinatorial problems," J. Comput. Syst. Sci. 9 (1974) 256-278.
41. R. Jones and R. Wilson, "A survey of constraints in automated assembly planning," in Proc. IEEE Int. Conf. on Robotics and Automation, Minneapolis, Minnesota, Apr. 1996, pp. 1525-1532.
42. V. Kann, "Polynomially bounded minimization problems which are hard to approximate," in Proc. 20th Int. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 700 (Springer-Verlag, Berlin, 1993) pp. 52-63.
43. D. Karger, R. Motwani, and G. Ramkumar, "On approximating the longest path in a graph," in Proc. Third Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709 (Springer-Verlag, Berlin, 1993) pp. 421-432.
44. S. Kaufman, R. Wilson, R. Jones, T. Calton, and A. Ames, "The Archimedes 2 mechanical assembly planning system," in Proc. IEEE Int. Conf. on Robotics and Automation, Minneapolis, Minnesota, Apr. 1996, pp. 3361-3368.
45. L. Kavraki and M. Kolountzakis, "Partitioning a planar assembly into two connected parts is NP-complete," Inf. Process. Lett. 55 (1995) 159-165.
46. L. Kavraki, J.-C. Latombe, and R. Wilson, "Complexity of partitioning an assembly," in Proc. Fifth Canadian Conf. on Computational Geometry, Waterloo, Canada, 1993, pp. 12-17.
47. S. Khanna and R. Motwani, "Towards a syntactic characterization of PTAS," in Proc. 28th ACM Symp. on Theory of Computing, Philadelphia, Pennsylvania, May 1996, pp. 329-337.
48. S. Khanna, M. Sudan, and L. Trevisan, "Constraint satisfaction: The approximability of minimization problems," in Proc. 12th IEEE Computational Complexity Conf., Ulm, Germany, June 1997.
49. M. Klawe, W. J. Paul, N. Pippenger, and M. Yannakakis, "On monotone formulae with restricted depth," in Proc. 16th ACM Symp. on Theory of Computing, Washington, D.C., 1984, pp. 480-487.
50. K. Lee and R. Gadh, "Computer aided design for disassembly: a destructive approach," in Proc. 1996 IEEE Int. Symp. on Electronics and the Environment, Dallas, Texas, May 1996, pp. 173-178.
51. S. Lee, "Backward assembly planning with assembly cost analysis," in Proc. IEEE Int. Conf. on Robotics and Automation, Nice, France, May 1992, pp. 2382-2391.
52. S. Lee and Y. Shin, "Assembly planning based on geometric reasoning," Computers and Graphics 14 (1990) 237-250.
53. C. Lund and M. Yannakakis, "On the hardness of approximating minimization problems," J. ACM 41 (1994) 960-981.
54. M. Middendorf, "Supersequences, runs, and CD grammar systems," in Developments in Theoretical Computer Science, Topics in Computer Science 6, eds. J. Dassow and A. Kelemenova (Gordon and Breach, Amsterdam, 1994) pp. 101-114.
55. J. Millner, S. Graves, and D. Whitney, "Using simulated annealing to select least-cost assembly sequences," in Proc. IEEE Int. Conf. on Robotics and Automation, San Diego, California, May 1994, pp. 2058-2063.
56. H. Moradi, K. Goldberg, S. Lee, and R. Wilson, "Geometry-based part grouping for assembly planning," Manuscript, 1997.
57. R. Motwani, "Approximation algorithms," Technical Report STAN-CS-92-1435, Stanford University, 1992.
58. B. Natarajan, "On planning assemblies," in Proc. Fourth Annual Symp. on Computational Geometry, Urbana-Champaign, Illinois, June 1988, pp. 299-308.
59. C. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comput. Syst. Sci. 43 (1991) 425-440.
60. C. Papadimitriou and M. Yannakakis, "The traveling salesman problem with distances one and two," Mathematics of Operations Research 18 (1993) 1-11.
61. R. Raz and A. Wigderson, "Monotone circuits for matching require linear depth," J. ACM 39 (1992) 736-744.
62. B. Romney, C. Godard, M. Goldwasser, and G. Ramkumar, "An efficient system for geometric assembly sequence generation and evaluation," in Proc. 1995 ASME Int. Computers in Engineering Conf., Boston, Massachusetts, Sept. 1995, pp. 699-712.
63. N. Shyamsundar and R. Gadh, "Selective disassembly of virtual prototypes," in Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics, Beijing, China, Oct. 1996, pp. 3159-3164.
64. J. Snoeyink and J. Stolfi, "Objects that cannot be taken apart with two hands," in Proc. Ninth Annual Symp. on Computational Geometry, San Diego, California, May 1993, pp. 247-256.
65. J. Stolfi, Oriented Projective Geometry: A Framework for Geometric Computations (Academic Press, Boston, 1991).
66. A. Subramani, "Development of a design for service methodology," Ph.D. thesis, Dept. Industrial and Manufacting Eng., U. Rhode Island, Kingston, RI, 1992.
67. G. Toussaint, "Movable separability of sets," in Computational Geometry, ed. G. Toussaint (North-Holland, Amsterdam, 1985) pp. 335-375.
68. R. Wilson, "On geometric assembly planning," Ph.D. thesis, Dept. Comput. Sci., Stanford Univ., Stanford, CA, 1992. Stanford Technical Report STAN-CS-92-1416.
69. R. Wilson, L. Kavraki, J.-C. Latombe, and T. Lozano-Pérez, "Two-handed assembly sequencing," Int. J. Robotics Research 14 (1995) 335-350.
70. R. Wilson and J.-C. Latombe, "Geometric reasoning about mechanical assembly," Artificial Intelligence 71 (1994) 371-396.
71. R. Wilson and J. Rit, "Maintaining geometric dependencies in an assembly planner," in Proc. IEEE Int. Conf. on Robotics and Automation, Cincinnati, Ohio, May 1990, pp. 890-895.
72. J. Wolter, "On the automatic generation of plans for mechanical assembly," Ph.D. thesis, University of Michigan, 1988.
73. T. Woo and D. Dutta, "Automatic disassembly and total ordering in three dimensions," J. Engineering for Industry 113 (1991) 207-213.
74. A. Yao, "A lower bound for the monotone depth of connectivity," in Proc. 35th Symp. on Foundations of Computer Science, Sante Fe, New Mexico, 1994, pp. 302-308.