By Topic

An efficient computational scheme for robot manipulators

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
J. A. T. Machado ; Dept. of Electr. & Comput. Eng., Porto Univ., Portugal ; J. L. M. de Carvalho ; J. A. S. Matos ; A. M. C. Costa

A novel robot manipulator computational scheme that is a blend of ordinary and Boolean algebra is presented. This method may also be interpreted as a dedicated compiler that optimizes the online computing time at the expense of the offline stage. The offline requirements are alleviated by the implementation of some general rules that stem from the structure of the robot manipulator equations, and the online computing time is optimized through the use of binary decision diagrams. The algorithm is illustrated on the example of a 2R robot manipulator. The results show a considerable computational improvement over conventional sequential machines, and they clearly point out new computational parallel architectures. It is observed that the proposed algorithm is not restricted to robot dynamic computations, but is also applicable to many other computing structures

Published in:

Intelligent Control, 1988. Proceedings., IEEE International Symposium on

Date of Conference:

24-26 Aug 1988