Stability analysis of assemblies considering friction

IEEE Transactions on Robotics and Automation

Volumn 13, Issue 6, 1997, Pages 805-813

  Mosemann, Hako ^b   Röhrdanz, Frank ^b   Wahl, Friedrich M ^a,b  

^a IEEE

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Assembly planning; Assembly sequence generation; Assembly stability; Vertex enumeration

Indexed keywords

ALGORITHMS; AUTOMATION; CALCULATIONS; FRICTION; GRAVITATION; LINEAR PROGRAMMING; STABILITY CRITERIA; SYSTEM STABILITY;

ASSEMBLY SEQUENCE GENERATION; COULOMB FRICTION; STABILITY ANALYSIS; VERTEX ENUMERATION;

ROBOTIC ASSEMBLY;

EID: 0031355394     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.650159     Document Type: Article

References (24)

1. L. S. Homem de Mello and S. Lee, Eds., Computer-Aided Mechanical Assembly Planning. Amsterdam, The Netherlands Kluwer Academic, 1991.
2. F. Röhrdanz, H. Mosemann, and F. M. Wahl, "Generating and evaluating stable assembly sequences," J. Adv. Robot., vol. 11, no. 2, pp. 97-126, 1997.
3. F. Röhrdanz, R. Gutsche, and F. M. Wahl, "Assembly planning and geometric reasoning for grasping," in Sixth Int. Conf. on Artificial Intelligence and Information-Control Systems of Robots, Sept. 1994, pp. 93-106, 1997.
4. R. Mattikalli, D. Baraff, and P. Khosla, "Finding all gravitationally stable orientations of assemblies," in Proc. IEEE Int. Conf. on Robotics and Automation, Mar. 1994, pp. 251-257.
5. M. Blum, A. Griffith, and B. Neumann, "A stability test for configurations of blocks," Artificial Intelligence Memo 188, MIT, Cambridge, Feb. 1970.
6. R. Mattikalli, D. Baraff, P. Khosla, and B. Repetto, "Finding all stable orientations of assemblies with friction," IEEE Trans. Robot. Automat., vol. 12, pp. 290-301, Apr. 1996.
7. D. Baraff, "Issues in computing contact forces for nonpenetrating rigid bodies," Algorithmica, vol. 10, pp. 292-352, 1993.
8. J. Trinkle, J. S. Pang, S. Sudarsky, and G. Lo, "On dynamic multirigid-body contact problems with coulomb friction," Tech. Rep., Dep. Computer Science, Texas A&M Univ., 1995.
9. R. S. Palmer, Computational Complexity of Motion and Stability of Polygons, Ph.D. dissertation, Cornell University, Ithaca, NY, Jan. 1987.
10. N. Boneschanscher, H. van der Drift, S. J. Buckley, and R. H. Taylor, "Subassembly stability," in Proc. Nat. Conf. on Artificial Intelligence, Aug. 1988, pp. 780-785.
11. R. Mattikalli, D. Baraff, P. Khosla, and B. Repetto, "Gravitational stability of frictionless assemblies," IEEE Trans. Robot. Automat., vol. 11, pp. 374-388, June 1995.
12. E. C. De Meter, "Restraint analysis of assembly work carriers," in Robotics and Computer Integrated Manufacturing, vol. 10, no. 4, pp. 257-265, 1993.
13. J. D. Wolter and J. C. Trinkle, "Automatic selection of fixture points for frictionless assemblies," in IEEE Int. Conf. on Robotics and Automation, 1994.
14. J. M. Schimmels and M. A. Peshkin, "Force-assembly with friction," IEEE Trans. Robot. Automat., vol. 10, pp. 465-479, Aug. 1994.
15. M. Erdmann, "On a representation of friction in configuration space," Int. J. Robot. Res, vol. 13, no. 3, pp. 240-270, 1994.
16. P. Lötstedt, "Coulomb friction in two-dimensional rigid body systems," Z. Ang. Math. Mech., vol. 61, pp. 605-615, 1981.
17. W. Dinkelbach, Sensitivitätsanalyzen und parametrische Programmierung. Berlin, Germany: Springer, 1969.
18. T. Gal and J. Nedoma, "Multiparametric linear programming," Manag. Sci., vol. 18, no. 7, pp. 406-422, 1972.
19. D. Avis and K. Fukuda, "A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra," Discrete and Computat. Geom., vol. 8, pp. 295-313, 1992.
20. K. Murty, Linear Programming. New York: Wiley, 1983.
21. R. G. Bland, "New finite pivoting rules for the simplex method," Math. Oper. Res., vol. 2, no. 2, pp. 103-107, May 1977.
22. V. Klee and G. Minty, "How good is the simplex algorithm?," in Inequalities III, O. Shisha, Ed. New York: Academic, 1972, pp. 159-175.
23. C. Lassez and J-L. Lassez, "Quantifier elimination for conjuctions of linear cosntraints via a convex hull algorithm," in Symbolic and Numerical Computationa for Artificial Intelligence. New York: Academic, 1992, pp. 103-119.
24. K. Fukuda, T. M. Liebling, and F. Margot, "Analysis of back-track algorithms for listing all vertices and all faces of a convex polyhedron," Tech. Rep. 94-05, Graduate School of Systems Management, Univ. Tsukuba, Aug. 1994.