Distance calculation for imminent collision indication in a robot System simulation
- 1 January 1988
- journal article
- research article
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 6 (1) , 47-51
- https://doi.org/10.1017/s0263574700003593
Abstract
SUMMARY: Minimum distance algorithms may be used in robotic simulation programs to provide the user with the distances of approach of the manipulator to obstacles in the work environment; this is important for task planning using graphical simulation of configuration maps, and for the implementation of automatic detection of (imminent) collision in robot task development Systems that are based on a graphical simulation facility. In this paper we present algorithms that may be used for the calculation of distances between objects, not necessarily convex, that are made up of unions of convex polyhedra and cylindrically shaped objects (where the cross-section of the cylinder may be ellipsoidal, rather than circular).Keywords
This publication has 8 references indexed in Scilit:
- Space Searching For Intersecting ObjectsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Computer control of coordinate movement with anthropomorphic two-armsComputers in Industry, 1985
- Efficient Detection of Intersections among SpheresThe International Journal of Robotics Research, 1983
- Minimum distances for robot task simulationRobotica, 1983
- Solid Modeling: Current Status and Research DirectionsIEEE Computer Graphics and Applications, 1983
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- A procedure to determine intersections between polyhedral objectsInternational Journal of Parallel Programming, 1972
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968