Intractability of Assembly Sequencing: Unit Disks in the Plane
暂无分享,去创建一个
[1] Randall H. Wilson,et al. On geometric assembly planning , 1992 .
[2] Leonidas J. Guibas,et al. On translating a set of rectangles , 1980, STOC '80.
[3] Mark de Berg,et al. Computing and verifying depth orders , 1992, SCG '92.
[4] Uriel Feige. A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.
[5] D. Dutta,et al. Automatic Disassembly and Total Ordering in Three Dimensions , 1991 .
[6] Damian M. Lyons,et al. Assembly and task planning: a taxonomy , 1994, IEEE Robotics & Automation Magazine.
[7] Rajeev Motwani,et al. Complexity measures for assembly sequences , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[8] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[9] P. Strevens. Iii , 1985 .
[10] R. J. Schilling,et al. Decoupling of a Two-Axis Robotic Manipulator Using Nonlinear State Feedback: A Case Study , 1984 .
[11] Sukhan Lee,et al. Assembly planning based on geometric reasoning , 1990, Comput. Graph..
[12] Daniel Flanagan Baldwin. Algorithmic methods and software tools for the generation of mechanical assembly sequences , 1990 .
[13] Jorge Stolfi,et al. Objects that cannot be taken apart with two hands , 1993, SCG '93.
[14] Mark de Berg,et al. Computing and Verifying Depth Orders , 1994, SIAM J. Comput..
[15] J. Latombe,et al. A Simple and E cient Procedure for Polyhedral Assembly Partitioning under In nitesimal Motions , 1995 .
[16] Richard Hoffman. A common sense approach to assembly sequence planning , 1991 .
[17] Micha Sharir,et al. Efficient generation of k-directional assembly sequences , 1996, SODA '96.
[18] Randall H. Wilson,et al. Assembly partitioning along simple paths: the case of multiple translations , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.
[19] Luca Trevisan,et al. Constraint satisfaction: the approximability of minimization problems , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.
[20] Phokion G. Kolaitis. Hardness Of Approximations , 1996 .
[21] Randall H. Wilson,et al. Assembly partitioning along simple paths: the case of multiple translations , 1996, Adv. Robotics.
[22] Jacques Stern,et al. The hardness of approximate optima in lattices, codes, and systems of linear equations , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[23] Rajeev Motwani,et al. Towards a syntactic characterization of PTAS , 1996, STOC '96.
[24] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[25] Randall H. Wilson,et al. The Archimedes 2 mechanical assembly planning system , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[26] E. J.,et al. ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .
[27] Balas K. Natarajan,et al. On planning assemblies , 1988, SCG '88.
[28] Arthur C. Sanderson,et al. A correct and complete algorithm for the generation of mechanical assembly sequences , 1991, IEEE Trans. Robotics Autom..
[29] Rajeev Motwani,et al. Complexity Measures for Assembly Sequences , 1999, Int. J. Comput. Geom. Appl..
[30] Mihalis Yannakakis,et al. On monotone formulae with restricted depth , 1984, STOC '84.
[31] Andrew Chi-Chih Yao,et al. A lower bound for the monotone depth of connectivity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[32] Donald W. Gillies,et al. Scheduling Tasks with AND/OR Precedence Constraints , 1995, SIAM J. Comput..
[33] Godfried T. Toussaint,et al. Movable Separability of Sets , 1985 .
[34] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[35] R. J. Dawson. On Removing a Ball Without Disturbing the Others , 1984 .
[36] Tomas Lozano-Perez,et al. On the Complexity of Partitioning an Assembly. , 1992 .
[37] Jean-Claude Latombe,et al. Geometric Reasoning About Mechanical Assembly , 1994, Artif. Intell..
[38] Carsten Lund,et al. Hardness of approximations , 1996 .
[39] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[40] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[41] Thomas L. DeFazio,et al. Simplified generation of all mechanical assembly sequences , 1987, IEEE Journal on Robotics and Automation.
[42] Richard A. Volz,et al. On the automatic generation of plans for mechanical assembly , 1988 .
[43] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[44] Sukhan Lee,et al. Computer-Aided Mechanical Assembly Planning , 1991 .
[45] J. Schwartz,et al. On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .
[46] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[47] Viggo Kann,et al. Polynomially Bounded Minimization Problems That Are Hard to Approximate , 1993, Nord. J. Comput..
[48] Donald William Gillies,et al. Algorithms to Schedule Tasks With And/or Precedence Constraints , 1993 .
[49] Lydia E. Kavraki,et al. Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete , 1995, Inf. Process. Lett..
[50] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[51] Lydia E. Kavraki,et al. Two-Handed Assembly Sequencing , 1995, Int. J. Robotics Res..
[52] Lydia E. Kavraki,et al. On the Complexity of Assembly Partitioning , 1993, CCCG.
[53] Michael H. Goldwasser,et al. AN EFFICIENT SYSTEM FOR GEOMETRIC ASSEMBLY SEQUENCE GENERATION AND EVALUATION , 1995 .
[54] Ran Raz,et al. Monotone circuits for matching require linear depth , 1990, STOC '90.
[55] Randall H. Wilson,et al. Maintaining geometric dependencies in an assembly planner , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[56] G. Boothroyd,et al. Assembly Automation and Product Design , 1991 .
[57] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[58] Leonidas J. Guibas,et al. A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.