The Robot Wrist Sensor Dynamic Mode Building Method Based on Genetic Wavelet Neural Networks

2013 ◽  
Vol 455 ◽  
pp. 389-394
Author(s):  
A Long Yu ◽  
Jin Qiao Dai

A kind of new dynamic modeling method is presented based on improved genetic algorithm (IGA) and wavelet neural networks (WNN) and the principle of algorithm is introduced for a new type robot wrist force sensor. The dynamic model of the wrist force sensor is set up according to data of the dynamic calibration, where the structure and parameters of wavelet neural networks of the dynamic model are optimized by genetic algorithm. The results show that the proposed method can overcome the shortcomings of easy convergence to the local minimum points of BP algorithm, and the network complexity, the convergence and the generalization ability are well compromised and the training speed and precision of model are increased.

2008 ◽  
Vol 381-382 ◽  
pp. 439-442
Author(s):  
Qi Wang ◽  
Zhi Gang Feng ◽  
K. Shida

Least squares support vector machine (LS-SVM) combined with niche genetic algorithm (NGA) are proposed for nonlinear sensor dynamic modeling. Compared with neural networks, the LS-SVM can overcome the shortcomings of local minima and over fitting, and has higher generalization performance. The sharing function based niche genetic algorithm is used to select the LS-SVM parameters automatically. The effectiveness and reliability of this method are demonstrated in two examples. The results show that this approach can escape from the blindness of man-made choice of LS-SVM parameters. It is still effective even if the sensor dynamic model is highly nonlinear.


2011 ◽  
Vol 74 (17) ◽  
pp. 2734-2744 ◽  
Author(s):  
Yuhui Wang ◽  
Hao Wang ◽  
Xiaohui Lei ◽  
Yunzhong Jiang ◽  
Xinshan Song

2013 ◽  
Vol 328 ◽  
pp. 444-449 ◽  
Author(s):  
Gang Liu ◽  
Fang Li

This paper describes a methodology based on improved genetic algorithms (GA) and experiments plan to optimize the testability allocation. Test resources were reasonably configured for testability optimization allocation, in order to meet the testability allocation requirements and resource constraints. The optimal solution was not easy to solve of general genetic algorithm, and the initial parameter value was not easy to set up and other defects. So in order to more efficiently test and optimize the allocation, migration technology was introduced in the traditional genetic algorithm to optimize the iterative process, and initial parameters of algorithm could be adjusted by using AHP approach, consequently testability optimization allocation approach based on improved genetic algorithm was proposed. A numerical example is used to assess the method. and the examples show that this approach can quickly and efficiently to seek the optimal solution of testability optimization allocation problem.


Sign in / Sign up

Export Citation Format

Share Document