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

Population-Based Uncalibrated Visual Servoing

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)
Bonkovic, M. ; Fac. of Electr. Eng., Mech. Eng. & Naval Archit., Univ. of Split, Split ; Hace, A. ; Jezernik, K.

This paper introduces the implementation of a recently introduced method suitable for visual servoing. The method is based on the generalization of secant methods for nonlinear optimization. The difference with existing approaches related to visual servoing is that we do not impose a linear model to interpolate the goal function. Instead, we prefer to identify the linear model by building the secant model using population of the previous iterates, which is as close as possible to the nonlinear function, in the least-squares sense. The new system has been shown to be less sensitive to noise and exhibits a faster convergence than do conventional quasi-Newton methods. The theoretical results are verified experimentally and also by simulations.

Published in:

Mechatronics, IEEE/ASME Transactions on  (Volume:13 ,  Issue: 3 )

Date of Publication:

June 2008

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.