Verifying contact hypotheses of planar, polyhedral objects using penetration growth distance

Robotics and Computer-Integrated Manufacturing

Volumn 17, Issue 3, 2001, Pages 233-246

  Goeree, Barry B ^a   Fasse, Ernest D ^a   Marefat, Michael M ^a  

^a University of Arizona   (United States)

Author keywords

Assembly planning; Contact; Nonconvex polyhedra

Indexed keywords

ALGORITHMS; ASSEMBLY; MOTION PLANNING; OPTIMIZATION;

ASSEMBLY PLANNING; NONCONVEX POLYHEDRA; PENETRATION GROWTH DISTANCE;

FACTORY AUTOMATION;

EID: 0035372124     PISSN: 07365845     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0736-5845(00)00053-3     Document Type: Article

References (35)

1. The discrete event modeling and trajectory planning of robotic assembly tasks
2. The discrete event control of robotic assembly tasks
3. Task primitives for the discrete event modeling and control of 6-DOF assembly tasks
4. Programmed compliance for error corrective assembly
5. Spatial planning: A configuration space approach
6. Inferring the positions of bodies from specified spatial relationships
7. Contact constraint analysis and determination of geometrically valid contact formations from possible contact primitives
8. A fast procedure for computing the distance between complex objects in three-dimensional space
9. Automated modeling and kinematic simulation of mechanisms
10. Computational kinematics
11. Configuration space computation for mechanism design
12. Dynamical simulation of assemblies of planar, 1dof parts with changing contacts using configuration spaces
13. On motion planning with six degrees of freedom: Solving the intersection problems in configuration space
14. Computing metric and topological properties of configuration-space obstacles
15. Gross motion planning - A survey
16. On replanning for assembly tasks using robots in the presence of uncertainties
17. Contact detection and contact motion for error recovery in the presence of uncertainties
18. Replanning with compliant rotations in the presence of uncertainties
19. Identification and verification of termination conditions in fine motion in presence of sensor errors and geometric uncertainities
20. Automatic verification of topological contacts by vision
21. Dealing with unexpected situations during the execution of robot motions
22. An efficient algorithm (FAPRIC) for finding the principal contacts possibly established due to uncertainties
23. Derivation of contact states from geometric models of objects
24. Distance functions and their application to robot path planning in the presence of obstacles
25. The Gilber-Johnson-Keerthi distance algorithm: A fast version for incremental motions
26. A foundation for the Flexible-Trajectory approach to numeric path planning
27. Growth distances: New measures for object separation and penetration
28. Robot path planning with penetration growth distance
29. Determining feasible contact states of pairs of spatial polyhedra