By Topic

Agents paradigm to solve a complex optimization problem

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

4 Author(s)
Ramdane-Cherif, A. ; PRiSM, Univ. de Versailles St.-Quentin, France ; Levyz, N. ; Djenidi, H. ; Tadj, C.

Agents are computational systems interacting with dynamic, and non-entirely predictable environments. They decide for themselves, on the basis of their individual beliefs, goals, etc., how to respond to the environment. An agent is usually motivated to achieve a feasible objective by means of the collaboration of other agents. For example, lifting a heavy table may be impossible without help. However, it can be done by simply asking others for help. The process of gaining collaboration can take many forms. However, some tasks need more detailed communication to generate an explicit mutually acceptable agreement through negotiation. This paper presents a new method to solve the inverse kinematic problem of a redundant robot using the agents paradigm. This method guarantees rapid convergence of the robot to desired position, with substantially good accuracy. The originality of the proposed approach is its ability to overcome some of the standard problems such as the computation of the inverse or pseudoinverse Jacobian matrix, problem of singularity, redundancy, and considerably increased computational complexity, etc.

Published in:

Cognitive Informatics, 2002. Proceedings. First IEEE International Conference on

Date of Conference:

2002