Probabilistic algorithms for efficient grasping and fixturing

Algorithmica (New York)

Volumn 26, Issue 3-4, 2000, Pages 345-363

  Teichmann, M ^a   Mishra, B ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Approximate geometric algorithms; Closure grasps; Fixturing; Grasp metrics; Grasping; Multifinger robot hands; Polytope covering

Indexed keywords

EID: 0344128114     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004539910017     Document Type: Article

References (29)

1. [AF] D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom., 8:295-313, 1992.
2. [BG] H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. In Proc. 10th Ann. ACM Symp. Comput. Geom., pages 293-302, 1994.
3. [BMK] D. Baraff, R. Mattikalli, and P. Khosla. Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms. Report CMU-RI-TR-94-08, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, 1994.
4. [C] B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom., 10:377-409, 1993.
5. [Cha] T. M. Y. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. In Proc. 11th Ann. ACM Symp, Comput. Geom., pages 10-19, 1995.
6. [Cla] K. L. Clarkson. Algorithms for polytope covering and approximation. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 246-252. Springer-Verlag, Berlin, 1993.
7. [CM] B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension. In Proc. 4th ACM-SIAM Symp. Discrete Algorithms, pages 281-290, 1993.
8. [CS] K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
9. [DJ] G. Das and D. Joseph. The complexity of minimum convex nested polyhedra. In Proc. 2nd Canad. Conf. Comput. Geom., pages 296-301, 1990.
10. [ECS] I. Z. Emiris, J. F. Canny, and R. Seidel. Efficient perturbations for handling geometric degeneracies. Algorithmica, 19(1-2):219-242, September 1997.
11. [EM] H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate. cases in geometric algorithms. ACM Trans. Graph., 9:66-104, 1990.
12. [FC] C. Ferrari and J. Canny. Planning optimal grasps. In Proc. 1992 IEEE Internat. Conf. Robotics Automat., pages 2290-2295, Nice, 1992.
13. [GLS] M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1988. Second edition 1994.
14. [Gol] M. Goldwasser. A survey of linear programming in randomized subexponential time. SIGACT News, 26(2):96-104, 1995.
15. [Grü] B. Grünbaum. Convex Polytopes. Wiley, New York, 1967.
16. [KMY] D. Kirkpatrick, B. Mishra, and C.-K. Yap. Quantitative Steinitz's theorems with applications to multifingered grasping. Discrete Comput. Geom., 7:295-318, 1992.
17. [Mat] J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2(3):169-186, 1992.
18. [Mis1] B. Mishra. Workholding - analysis, design and planning. In Proc. IROS '91, pages 53-57, Osaka, November 1991.
19. [Mis2] B. Mishra. Grasp metrics: optimality and complexity. In K. Goldberg, D. Halperin, J. C. Latombe, and R. Wilson, editors, Algorithmic Foundations of Robotics, pages 137-166. A. K. Peters, Boston, MA, 1994.
20. [MLS] R. Murray, Z. Li, and S. Sastry. A Mathematical Introduction to Robotic Manipulation. CRC Press, Boca Raton, FL, 1994.
21. [MNP] X. Markenscoff, L. Ni, and C. H. Papadimitriou. The geometry of grasping. Internat. J. Robotics Res., 9(1), February 1990.
22. [MS1] P. McMullen and G. C. Shephard. Convex Polytopes and the Upper Bound Conjecture. Cambridge University Press, Cambridge, 1971.
23. [MS2] J. S. B. Mitchell and S. Suri. Separation and approximation of polyhedral surfaces. In Proc. 3rd ACM-SIAM Symp. Discrete Algorithms, pages 296-306, 1992.
24. [MSS] B. Mishra, J. T. Schwartz, and M. Sharir. On the existence and synthesis of multifinger positive grips. Algorithmica, 2(4):541-558, 1987.
25. [N] V.-D. Nguyen. Constructing force-closure grasps in 3D. In Proc. IEEE Internat. Conf. Robotics Automat., pages 240-245, 1987.
26. +] J. Ponce, S. Sullivan, A. Sudsang, J.-D. Boissonnat, and J.-P. Merlet. Algorithms for computing force-closure grasps of polyhedral objects. In K. Goldberg, D. Halperin, J. C. Latombe, and R. Wilson, editors, Algorithmic Foundations of Robotics, pages'167-184. A.K. Peters, Boston, MA, 1995.
27. [T] M. Teichmann. Grasping and Fixturing: A Geometric Analysis and an Implementation. Ph.D. thesis, New York University, New York, 1995.
28. [Y] C. K. Yap. A geometric consistency theorem for a symbolic perturbation scheme. J. Comput. System Sci., 40:2-18, 1990.
29. [ZGW] Y. Zhuang, K. Y. Goldberg, and Y.-C. Wong. On the existence of modular fixtures. In Proc. IEEE Internat. Conf. Robotics Automat., pages 543-549, San Diego, CA, 1994.