Hostname: page-component-788cddb947-w95db Total loading time: 0 Render date: 2024-10-08T16:33:55.015Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimum distances for robot task simulation

Published online by Cambridge University Press:  09 March 2009

W. Edward Red
W. Edward Red
Affiliation:
Associate Professor, Department of Mechanical Engineering, 242P Clyde Building, Brigham Young University, Provo, Utah 84602 (U.S.A.)
Get access Rights & Permissions [Opens in a new window]

Summary

Minimum distance algorithms allow users of robot simulation programs to maneuver manipulation arms around and between workspace obstacles. Additionally, they can be used to generate configuration maps for path planning of the manipulator “point” through a more abstract configuration space. This paper summarizes an algorithm for determining minimum distances between two polyhedral elements. Examples of configuration space maps and Cartesian stepping techniques demonstrate algorithmic utility for robot path planning. A number of accelerating strategies which depend on a heirarchical spatial representation of manipulator and workspace elements maintain reasonable CPU times for the simulation user.

Type
Article
Information
Robotica , Volume 1 , Issue 4 , October 1983 , pp. 231 - 238
Copyright
Copyright © Cambridge University Press 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Derby, S.J., “Computer Graphics Simulation Programs: A comparison” Proceedings of the Conference on Robotics Research and Advanced Applications,ASME Winter Annual Meeting,Phoenix, Arizona,11. 1–19203–211 (1982).Google Scholar
2.Kretch, S.J., “Robotic Animation” Mechanical Engineering, 32–35 (1982).Google Scholar
3.Red, W.E. and Truong-Cao, H. V., “The Configuration Space Approach to Robot Path Planning,” 1984 American Control Conference06 6–8, 1984San Diego, California (paper accepted for publication).CrossRefGoogle Scholar
4.Red, W.E., “Configuration Maps and Robot Task Planning in 3-D” 1984 International Computers in Engineering Conference07 12–16, 1984Las Vegas, Nevada.Google Scholar
5.Lozano-Perez, T., “Spatial Planning: A Configuration Space Approach” AL Memo No. 605, MIT Artificial Intelligence Laboratory (12, 1980).Google Scholar
6.Lozano-Perez, T., “Automatic Planning of Manipulator Transfer Movements” AI Memo. No. 606, MIT Artificial Intelligence Laboratory (12, 1980).Google Scholar
7.Lozano-Perez, T. and Wesley, M.S., “An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles” Communications of the ACM, 560–570 (10, 1979).CrossRefGoogle Scholar
8.Brooks, R.A., “Solving the Find-Path Problem by Representing Free Space as Generalized Cones” AI Memo No. 674, MIT Artificial Intelligence Laboratory 05, 1982).Google Scholar