A general framework for assembly planning

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A general framework for assembly planning: the motion space approach

Full text

Pdf (1.52 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the fourteenth annual symposium on Computational geometry table of contents

Minneapolis, Minnesota, United States

Pages: 9 - 18

Year of Publication: 1998

ISBN:0-89791-973-4

Authors

Dan Halperin	Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel
Jean-Claude Latombe	Department of Computer Science, Stanford University, Stanford, CA
Randall H. Wilson	Eastman Kodak Company, Albuquerque, NM

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 21, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/276884.276886 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Pankaj K. Agarwal , Mark de Berg , Dan Halperin , Micha Sharir, Efficient generation of k-directional assembly sequences, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.122-131, January 28-30, 1996, Atlanta, Georgia, United States
	2	E. M. Arkin , R. Connelly , J. S. Mitchell, On monotone paths among obstacles with applications to planning assemblies, Proceedings of the fifth annual symposium on Computational geometry, p.334-343, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73870]
	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 8equence# for mechanical products. IEBE Trans. on Robotics and Automation, 7(I):78-94, 1991.
	4	N. Birnbaum and D. Halperin. A randomized approach to assembly planning along paths, l#anuscript, 1998.
	5	H. Chang and T. Li. Assembly maintainability study with motion planning. In Proc. IEEE Int. Confi on Rob. and Aurora., pages 1012-1019, 1995.
	6	Mark de Berg, Ray Shooting, Depth Orders and Hidden Surface Removal, Springer-Verlag New York, Inc., Secaucus, NJ, 1993
	7	M. de Berg, L. J. Guibas, and D. Halpefin. Vertical decompositions for triangles in 3-space. Diacrete Gomput. Geom., 15:35--61, 1996.
	8	Mark de Berg , Mark Overmars , Otfried Schwarzkopf, Computing and Verifying Depth Orders, SIAM Journal on Computing, v.23 n.2, p.437-446, April 1994 [doi>10.1137/S0097539791223747]
	9	A. Ddchambre and P. Gaspart. KBAP: An industrial prototype of knowledge-based assembly planner. In Proe. IEBB Intl. Conf. on Robotics and Automation, pages 2404-2409, 1992.
	10	B. 1t. Donald. The complexity of planar compliant motion plan,#ng under uncertainly. Algorithmiea, 5:353-- 382, 1990.
	11	K.Y. Goldberg. Orienting polygonal parts without sensors. Algorithmica, 10:201-225, 1993.
	12	Michael Goldwasser, An implementation for maintaining arrangements of polygons, Proceedings of the eleventh annual symposium on Computational geometry, p.432-433, June 05-07, 1995, Vancouver, British Columbia, Canada [doi>10.1145/220279.220337]
	13	M. Goldwasser, J.-C. Latombe, and R. Motwani. Comple#l#y measures for assembly sequences. In Proc. IEEE Intl. Conf. on Robotics and Automation, pages 1581- 1587, 1996.
	14	M. Goldwasser and R. Motwani. Complexity measures for assembly sequences. International Journal of Computational Geometry and Applications. To appear.
	15	Roderic A. Grupen , Thomas C. Henderson , Ian D. McCammon, A survey of general-purpose manipulation, International Journal of Robotics Research, v.8 n.1, p.38-62, February 1989 [doi>10.1177/027836498900800103]
	16	L. Guibas and F. F. Yao. On translating a set of ree#- angles. Advances in Computing Research, 1:235-260, 1983.
	17	L.J. Guibas, D. Halperin, H. Hinakawa, J.-C. Latombe, and R. H. Wilson. A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions, in Proe. IEEE Intl. Conf. on Robotics and Automation, pages 2553-2560, 1995.
	18	Dan Halperin, Arrangements, Handbook of discrete and computational geometry, CRC Press, Inc., Boca Raton, FL, 1997
	19	D. Halpe_dn and R. H. Wilson. Assembly partitioning along simple paths: the case of multiple translations. Advanced Robotics, 11:127'-145, 1997'.
	20	H. ttJrulmwa, T. Matsui, and K. Takase. Automatic determination of possible vdoeity and applicable force of frietionless objects in contaet# from a geometric model. IEEE Trans. on Robotics and Automation, 10(3):309-- 322, 1994.
	21	R. L. Hoffman. Automated assembly in a CSG domain. In Proc. IEEE Intl. Conf. on Robotics and Automation, pages 210--215, 1989.
	22	Luiz Scaramelli Homem De Mello , Arthur Sanderson, Task sequence planning for robotic assembly, 1989
	23	L. S. Homem de Mello and A. C. Sanderson. A correct and complete algorithm for the generation of meeharficol assembly sequences. Iggg Trans. on Robotics and Automation, 7(2):228-240, 1991.
	24	It. E. Jones and R. H. Wilson. A survey of constraints in assembly planning. In /)roe. IBEE Intl. Conf. on Robotics and Automation, pages 1525-32, 1996.
	25	R. E. Jones and R. H. Wilson. Aa interactive assembly planning system. In Video Proc. IEEE Intl. Conf. on Robotics and Automation, 1997.
	26	R. E. Jones, It. H. Wilson, and T. L. Calton. Constraint-based interactive assembly planning. In Proe. IEEE intl. Conf. on Robotics and Automation, pages 913-920, 1997.
	27	Lydia E. Kavraki , Mihail N. Kolountzakis, Partitioning a planar assembly into two connected parts is NP-complete, Information Processing Letters, v.55 n.3, p.159-165, Aug. 11, 1995 [doi>10.1016/0020-0190(95)00083-O]
	28	Sanjeev Khanna , Rajeev Motwani , Randall H. Wilson, On certificates and lookahead in dynamic graph problems, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.222-231, January 28-30, 1996, Atlanta, Georgia, United States
	29	H. Ko , K. Lee, Automatic assembling procedure generation from mating conditions, Computer-Aided Design, v.19 n.1, p.3-10, Jan./Feb. 1987 [doi>10.1016/0010-4485(87)90146-1]
	30	Jean-Claude Latombe, Robot Motion Planning, Kluwer Academic Publishers, Norwell, MA, 1991
	31	J.-C. Latombe, R. H. Wilson, and F. Cazals. Assembly sequencing with tolcranced par#s. Computer-Aided Design, 29(2):159-174, Feb. 1997.
	32	A. Lazanas and J. C. Latombe. Landmark-based robot navigation. Algorithmica, 13:472-501, 1995.
	33	T. Lozano-P&ez. Spatial planning: A configuration space approach. IEEE Transactions on Computers, C- (2):1o8-12o, lo83.
	34	B. Mishra, J. T. Schwartz, and M. Shark. On the existence and synthesis of multifmger positive grips. Algo. rithmica, 2:541-558, 1987.
	35	B. K. Natarajan, On planning assemblies, Proceedings of the fourth annual symposium on Computational geometry, p.299-308, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73424]
	36	Jean Ponce , Steve Sullivan , Attawith Sudsang , Jean-Daniel Boissonnat , Jean-Pierre Merlet, On computing four-finger equilibrium and force-closure grasps of polyhedral objects, International Journal of Robotics Research, v.16 n.1, p.11-35, Feb. 1997 [doi>10.1177/027836499701600102]
	37	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	38	Bruce Romney, On the concurrent design of assembly sequences and fixture, Stanford University, Stanford, CA, 1997
	39	B. Romney, C. Godard, M. Goldwasser, and G. Rtmaku. mar. An efficient system for geometric assembly sequence generation and evaluation. In Proc. A SME Intl. Computers in Engineering Conf., pages 699-712, 1095.
	40	A. Schw#d and B.. It. Wilson. Assembly sequences for polyhedra. Algorithmica, 13(6):539-562, 1995.
	41	C. Wentink, A. F. van der Stappen, and M. Overmars. Algorithms for fixture design. In J.-P. Laumond and M. Overmars, editors, Algorithms }or Robotic Mo#ion and Manipulation: 1996 WAFR, pages 321-346. A. K. Peters, 1997.
	42	Randall H. Wilson, On geometric assembly planning, Stanford University, Stanford, CA, 1992
	43	R. H. Wilson. Geometric reasoning abou# assembly tools. Technical Report SAND95-2423, Sandla National Labs, 1996. To appear in Artificial Intelligence.
	44	Randall H. Wilson , Lydia Kavraki , Jean-Claude Latombe , Tomás Lozano-Pérez, Two-handed assembly sequencing, International Journal of Robotics Research, v.14 n.4, p.335-350, Aug. 1995 [doi>10.1177/027836499501400403]
	45	Randall H. Wilson , Jean-Claude Latombe, Geometric reasoning about mechanical assembly, Artificial Intelligence, v.71 n.2, p.371-396, Dec. 1994 [doi>10.1016/0004-3702(94)90048-5]
	46	R. H. Wilson and T. Matsui. Partitioning aa assembly for infmil#esimal motions in translation and rotation. In Proe. Intl. Conf. on Intelligent Robot# and Sy#tcm#, pages 1311-1318, 1992.
	47	Jan Dithmar Wolter , Richard A. Volz , Tony C. Woo, On the automatic generation of plans for mechanical assembly, 1988
	48	T. C. Woo. Au#omatlc disassembly and total ordcrlng in. three dimensions. In Conf. on Intelligent and Integrated Manufacturing Analysis and Synthesis, pages 291-303, 1987'.