Intractability of assembly sequencing: Unit disks in the plane

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1272, Issue , 1997, Pages 307-320

  Goldwasser, Michael ^a   Motwani, Rajeev ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; SCHEDULING;

APPROXIMABILITY; ASSEMBLY SEQUENCE; ASSEMBLY SEQUENCING; COLLISION-FREE; HIGHER DIMENSIONS; INAPPROXIMABILITY; PRECEDENCE CONSTRAINTS; SCHEDULING PROBLEM;

ASSEMBLY;

EID: 84947941666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_70     Document Type: Conference Paper

References (47)

1. P. Agarwal, M. de Berg, D. Halperin, and M. Sharir. Efficient generation of k- directional assembly sequences. In Proc. 7th ACM Symp. on Discrete Algorithms, pages 122-131, 1996.
2. S. Arora. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th Symp. on Found. Comput. Sci., pages 1-11, 1996.
3. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes and linear equations. In Proc. 34th Symp. on Found. Comput. Sci., pages 724-733, 1993.
4. S. Arora and C. Lund. Hardness of approximations. In D. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1996.
5. B. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153-180, 1994.
6. D. Baldwin. Algorithmic methods and software tools for the generation of mechanical assembly sequences. M.Sc. thesis, MIT, Cambridge, MA, 1990.
7. G. Boothroyd. Assembly Automation and Product Design. Marcel Dekker, Inc., New York, NY, 1991.
8. R. Dawson. On removing a ball without disturbing the others. Mathematics Magazine, 57(1):27-30, 1984.
9. M. de Berg, M. Overmars, and O. Schwarzkopf. Computing and verifying depth orders. SIAM J. Comput., 23(2):432-446, 1994.
10. F. Dehne and J.-R. Sack. Translation separability of polygons. Visual Computer, 3(4):227-235, 1987.
11. T. D. Fazio and D. Whitney. Simplified generation of all mechanical assembly sequences. IEEE Trans, on Robotics and Automation, 3(6):640-658, 1987.
12. U. Feige. A threshold of Inn for approximating set cover. In Proc. 28th ACM Symp. Theory Comput, pages 314-318, 1996.
13. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
14. D. Gillies. Algorithms to schedule tasks with AND/OR precedence constraints. Ph.D. thesis, University of Illinois, Urbana, IL, 1993.
15. D. Gillies and J. Liu. Scheduling tasks with AND/OR precedence constraints. SIAM J. Comput., 24(4):797-810, 1995.
16. M. Goldwasser. Complexity Measures for Assembly Sequencing. Ph.D. thesis, Dept. Comput. Sci., Stanford Univ., Stanford, CA, 1997.
17. M. Goldwasser, J.-C. Latombe, and R. Motwani. Complexity measures for assembly sequences. In Proc IEEE Int. Conf. on Robotics and Automation, pages 1581-1587, 1996.
18. S. Gottschlich, C. Ramos, and D. Lyons. Assembly and task planning: A taxonomy. IEEE Robotics and Automation Magazine, 1(3):4-12, 1994.
19. L. Guibas, D. Halperin, H. Hirukawa, and J.-C. L. R. Wilson. A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions. In Proc IEEE Int. Conf. on Robotics and Automation, pages 2553-2560, 1995.
20. L. Guibas and F. Yao. On translating a set of rectangles. In F. Preparata, editor, Computational Geometry, Advances in Computing Research, pages 61-77. JAI Press Inc., 1983.
21. D. Halperin. Personal communication. 1995.
22. D. Halperin and R. Wilson. Assembly partitioning along simple paths: the case of multiple translations. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 1585-1592, 1995.
23. 1-ε. In Proc. 37th Symp. on Found. Comput. Sci., pages 627-636, 1996.
24. R. Hoffman. A common sense approach to assembly sequence planning. In Computer-Aided Mechanical Assembly Planning, pages 289-314. Kluwer Academic Publishers, Boston, 1991.
25. L. Homem de Mello and A. Sanderson. Computer-Aided Mechanical Assembly Planning. Kluwer Academic Publishers, Boston, 1991.
26. 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(2):228-240, 1991.
27. 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(4):76-88, 1984.
28. D. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Systems Sci., 9:256-278, 1974.
29. V. Kann. Polynomially bounded minimization problems which are hard to approximate. In Automata, Languages and Programming (Proc. 20th ICALP), volume 700 of Lecture Notes in Computer Science, pages 52-63. Springer-Verlag, 1993.
30. 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, pages 3361-3368, 1996.
31. L. Kavraki and M. Kolountzakis. Partitioning a planar assembly into two connected parts is NP-complete. Information Processing Letters, 55(3):159-165, 1995.
32. L. Kavraki, J.-C. Latombe, and R. Wilson. Complexity of partitioning an assembly. In Proc. 5th Canad. Conf. Comput. Geom., pages 12-17, Waterloo, Canada, 1993.
33. S. Khanna and R. Motwani. Towards a syntactic characterization of PTAS. In Proc. 28th ACM Symp. Theory Comput, pages 329-337, 1996.
34. S. Khanna, M. Sudan, and L. Trevisan. Constraint satisfaction: The approximability of minimization problems. In Proc. 12th IEEE Comput. Complexity Conference, 1997.
35. S. Lee and Y. Shin. Assembly planning based on geometric reasoning. Computers and Graphics, 14(2): 237-250, 1990.
36. R. Motwani. Approximation algorithms. Stanford Technical Report STAN-CS-92-1435, 1992.
37. B. Natarajan. On planning assemblies. In Proc. 4th ACM Symp. on Computational Geometry, pages 299-308, 1988.
38. C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. Systems Sci., 43(3):425-440, 1991.
39. C. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Mathematics of Operations Research, 18(1):1-11, 1993.
40. B. Romney, C. Godard, M. Goldwasser, and G. Ramkumar. An efficient system for geometric assembly sequence generation and evaluation. In Proc. ASME Int. Computers in Engineering Conference, pages 699-712, 1995.
41. J. Snoeyink and J. Stolfi. Objects that cannot be taken apart with two hands. In Proc. ACM Symp. on Computational Geometry, pages 247-256, 1993.
42. G. Toussaint. Movable separability of sets. In G. Toussaint, editor, Computational Geometry, pages 335-375. North-Holland, Amsterdam, Netherlands, 1985.
43. R. Wilson. On Geometric Assembly Planning. Ph.D. thesis, Dept. Comput. Sci., Stanford Univ., Stanford, CA, 1992. Stanford Technical Report STAN-CS-92-1416.
44. R. Wilson, L. Kavraki, J.-C. Latombe, and T. Lozano-Pérez. Two-handed assembly sequencing. Int. J. of Robotics Research, 14(4):335-350, 1995.
45. R. Wilson and J.-C. Latombe. Geometric reasoning about mechanical assembly. Artificial Intelligence, 71 (2):371-396, 1994.
46. J. Wolter. On the Automatic Generation of Plans for Mechanical Assembly. Ph.D. thesis, University of Michigan, 1988.
47. T. Woo and D. Dutta. Automatic disassembly and total ordering in three dimensions. J. Engineering for Industry, 113(2):207-213, 1991.