Cart (Loading....) | Create Account
Close category search window
 

Genetic optimisation of manipulation forces for co-operating robots

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
$31 $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

3 Author(s)
Szabad, Z. ; Salford Univ., UK ; Sangolola, B. ; McAvoy, B.

Force planning for co-operating manipulators requires the solution of an underdetermined set of linear equations, which yields infinitely many solutions. The task then becomes that of locating the best solution from the infinite set. Various methods have been proposed for this optimisation problem, including pseudo inverses and search algorithms. This paper adopts a non-linear optimisation approach using genetic algorithms (GA). GAs have well known capabilities for searching complex function spaces. It is shown in this work that real number GAs provide a powerful force-planning method for co-operating manipulators. The effectiveness of the algorithm is illustrated with a numerical example

Published in:

Systems, Man, and Cybernetics, 2000 IEEE International Conference on  (Volume:5 )

Date of Conference:

2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.