scholarly journals Optimized hybrid decoupled visual servoing with supervised learning

Author(s):  
Alireza Rastegarpanah ◽  
Ali Aflakian ◽  
Rustam Stolkin

This study proposes an optimized hybrid visual servoing approach to overcome the imperfections of classical two-dimensional, three-dimensional and hybrid visual servoing methods. These imperfections are mostly convergence issues, non-optimized trajectories, expensive calculations and singularities. The proposed method provides more efficient optimized trajectories with shorter camera path for the robot than image-based and classical hybrid visual servoing methods. Moreover, it is less likely to lose the object from the camera field of view, and it is more robust to camera calibration than the classical position-based and hybrid visual servoing methods. The drawbacks in two-dimensional visual servoing are mostly related to the camera retreat and rotational motions. To tackle these drawbacks, rotations and translations in Z-axis have been separately controlled from three-dimensional estimation of the visual features. The pseudo-inverse of the proposed interaction matrix is approximated by a neuro-fuzzy neural network called local linear model tree. Using local linear model tree, the controller avoids the singularities and ill-conditioning of the proposed interaction matrix and makes it robust to image noises and camera parameters. The proposed method has been compared with classical image-based, position-based and hybrid visual servoing methods, both in simulation and in the real world using a 7-degree-of-freedom arm robot.

2013 ◽  
Vol 28 (8) ◽  
pp. 581-593 ◽  
Author(s):  
Kayvan Aghabayk ◽  
Nafiseh Forouzideh ◽  
William Young

2011 ◽  
Vol 10 (3) ◽  
pp. 221-234 ◽  
Author(s):  
A. Hajian ◽  
H. Zomorrodian ◽  
P. Styles ◽  
F. Greco ◽  
C. Lucas

2011 ◽  
Vol 2011 ◽  
pp. 1-9 ◽  
Author(s):  
Atiye Sarabi-Jamab ◽  
Babak N. Araabi

Locally linear model tree (LoLiMoT) and piecewise linear network (PLN) learning algorithms are two approaches in local linear neurofuzzy modeling. While both methods belong to the class of growing tree learning algorithms, they use different logics. PLN learning relies on training data, it needs rich training data set and no division test, so it is much faster than LoLiMoT, but it may create adjacent neurons that may lead to singularity in regression matrix. On the other hand, LoLiMoT almost always leads to acceptable output error, but it often needs more rules. In this paper, to exploit the complimentary performance of both algorithms piecewise linear model tree (PiLiMoT) learning algorithm is introduced. In essence, PiLiMoT is a combination of LoLiMoT and PLN learning. The initially proposed algorithm is improved by adding the ability to merge previously divided local linear models, and utilizing a simulated annealing stochastic decision process to select a local model for splitting. Comparing to LoLiMoT and PLN learning, our proposed improved learning algorithm shows the ability to construct models with less number of rules at comparable modeling errors. Algorithms are compared through a case study of nonlinear function approximation. Obtained results demonstrate the advantages of combined modified method.


2020 ◽  
Vol 53 (2) ◽  
pp. 1163-1168
Author(s):  
Xiaoyan Hu ◽  
Yu Gong ◽  
Dezong Zhao ◽  
Wen Gu
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document