On fence design and the complexity of push plans for orienting parts

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

On fence design and the complexity of push plans for orienting parts

Full text

Pdf (1.25 MB)

Source

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

Nice, France

Pages: 21 - 29

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

Robert-Paul Berretty	Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands
Ken Goldberg	Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA
Mark H. Overmars	Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands
A. Frank van der Stappen	Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands

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): 1, Downloads (12 Months): 9, Citation Count: 2

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/262839.262853 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 , Matthew J. Katz , Micha Sharir, Computing depth orders for fat objects and related problems, Computational Geometry: Theory and Applications, v.5 n.4, p.187-206, Nov. 1995 [doi>10.1016/0925-7721(95)00005-8]
	2	S. Akella, W. Huang, K.M. Lynch, and M.T. Mason. Sensorless parts feeding with a one joint robot. Algorithms for Robotic Motion and Manipulation (J.-P. Laumond and M. Ovetmars (Eds.)), A.K. Peters, pages 229-238, 1996.
	3	S. AkeUa and M.T. Mason. Posing polygonal objects in the plane by pushing. In IEEE International Conference on Robotics and Automation, Nice, pages 2255- 2268, 1992.
	4	H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. N~her, S. Schirra, and C. Uhrig. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Algorithmica, 8:391-406, 1992.
	5	K.-F. BShringer, V. Bhatt, and K.Y. Goldberg. Sensorless manipulation using transverse vibrations of a plate. In Proc. IEEE Int. Conf. on Robotics and Automation, Nagoya, Japan, pages 1989-1996, 1995.
	6	K.-F. BShringer, B.R. Donald, and N.C. MacDonald. Upper and lower bounds for programmable vector fields with applications to mems and vibratory plate part feeders. Algorithms for Robotic Motion and Manipulation, J.-P. Laumond and M. Overmars (Eds.), A.K. Peters, pages 255-276, 1996.
	7	M. Brokowski, M.A. Peskin, and K. Goldberg. Curved fences for part alignment. In 1EEE International Conference on Robotics and Automation, Atlanta, GA, volume 3, pages 467-473, 1993.
	8	Y.-B. Chert and D.J. Ierardi. The complexity of oblivious plans for orienting and distinguishing polygonal parts. Algoritmica, 14:367-397, 1995.
	9	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	10	Mark de Berg, Linear Size Binary Space Partitions for Fat Objects, Proceedings of the Third Annual European Symposium on Algorithms, p.252-263, September 25-27, 1995
	11	M.A. Erdmann and M.T. Mason. An exploration of sensorless manipulation. 1EEE Journal of Robotics and Automation, 4:367-379, 1988.
	12	K. Goldberg. Orienting polygonal parts without sensors. Algoritmica, 10(2):201-225, 1993.
	13	Matthew J. Katz , Mark H. Overmars , Micha Sharir, Efficient hidden surface removal for objects with small union size, Computational Geometry: Theory and Applications, v.2 n.4, p.223-234, Dec. 1992 [doi>10.1016/0925-7721(92)90024-M]
	14	Kevin M. Lynch , Matthew T. Mason, Stable pushing: mechanics, controllability, and planning, International Journal of Robotics Research, v.15 n.6, p.533-556, Dec. 1996 [doi>10.1177/027836499601500602]
	15	Matthew T Mason, Manipulator Grasping and Pushing Operations, Massachusetts Institute of Technology, Cambridge, MA, 1982
	16	Jiri Matousek , Janos Pach , Micha Sharir , Shmuel Sifrony , Emo Welzl, Fat Triangles Determine Linearly Many Holes, SIAM Journal on Computing, v.23 n.1, p.154-169, Feb. 1994 [doi>10.1137/S009753979018330X]
	17	B.K. Natarajan. An algorithmic approach to the automated design of parts orienters. In IEEE Annual Symposium on Fundamentals of Computer Science, pages 132-142, 1986.
	18	Mark H. Overmars , A. Frank van der Stappen, Range searching and point location among fat objects, Journal of Algorithms, v.21 n.3, p.629-656, Nov. 1996 [doi>10.1006/jagm.1996.0063]
	19	M.A. Peshkin and A.C. Sanderson. The motion of a pushed sliding workpiece. 1EEE Journal o} Robotics and Automation, 4(6):569-598, 1988.
	20	M.A. Peshkin and A.C. Sanderson. Planning robotic manipulation strategies for workpieces that slide. IEEE Journal of Robotics and Automation, 4(5):524-531, 1988.
	21	A. Rao and K. Goldberg. Manipulating algebraic parts in the plane. IEEE Transactions on Robotics and Automation, 11, 1995.
	22	A.F. van der Stappen, K. Goldberg, and M. Overmars. Geometric eccentricity and the complexity of manipulation plans. Technical report, UU-CS-1996-49, Dept. of Computer Science, Utrecht University, 1996.
	23	A. Frank van der Stappen , Dan Halperin , Mark H. Overmars, The complexity of the free space for a robot moving amidst fat obstacles, Computational Geometry: Theory and Applications, v.3 n.6, p.353-373, Dec. 1993 [doi>10.1016/0925-7721(93)90007-S]
	24	A. Frank van der Stappen , Mark H. Overmars, Motion planning amidst fat obstacles (extended abstract), Proceedings of the tenth annual symposium on Computational geometry, p.31-40, June 06-08, 1994, Stony Brook, New York, United States [doi>10.1145/177424.177453]
	25	J. Wiegley, K. Goldberg, M. Peshkin, and M. Brokowski. A complete algorithm for designing passive fences to orient parts. In IEEE International Conference on Robotics and Automation, Minneapolis, MN, pages 1133-1139, 1996.

CITED BY 2

	Robert-Paul Berretty , Mark H. Overmars , A. Frank van der Stappen, Orienting polyhedral parts by pushing, Computational Geometry: Theory and Applications, v.21 n.1, p.21-38, January 2002
	Mike Tao Zhang , Ken Goldberg , Gordon Smith , Robert-Paul Beretty , Mark Overmars, Pin design for part feeding, Robotica, v.19 n.6, p.695-702, September 2001