An on-line cartesian space obstacle avoidance scheme for robot arms

J.S. Yu and P.C. Müller

Mathematics and Computers in Simulation (MATCOM), 1996, vol. 41, issue 5, 627-637

Abstract: This paper presents an on-line obstacle avoidance scheme for robot arms. This method is directly formulated in the Cartesian space and uses complete information about the workspace. The strategy is to detect the collision and to plan the motion of each link successively, starting from the base link. Each robot link in 3D Cartesian space will be mapped into two 2D planes such that the collision detection and motion planning can be executed in 2D spaces. Depending on its spatial shape, the end-effector can be approached as further robot links. Thus, the obstacle avoidance is more effectively including the consideration of end-effector. The proposed algorithm is implemented on a transputer network which simulates the control system of a six-link robot PUMA 560.

Keywords: Robotics; Obstacle avoidance; Motion planing; Transputer; Parallel processing (search for similar items in EconPapers)
Date: 1996
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475495001069
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:41:y:1996:i:5:p:627-637

DOI: 10.1016/0378-4754(95)00106-9

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().