DocumentCode :
2352143
Title :
A quick algorithm for finding mechanical singularity by stochastic approximation
Author :
Liang, Wenyuan ; Yu, Yong ; Ge, Yunjian
Author_Institution :
Inst. of Intell. Machine, Chinese Acad. of Sci., Hefei, China
fYear :
2010
fDate :
4-7 Aug. 2010
Firstpage :
1042
Lastpage :
1047
Abstract :
In this paper, we focus on a quick algorithm based on stochastic approximation (SA) which is used to seek mechanical singularity. Different from conventional methods, the proposed SA algorithm is quicker and much more effective. SA, also known as stochastic recursive algorithms, take many forms and have numerous applications. Integrated with mechanical kinematic Jacobian matrix, the SA algorithm is based on the strict and integrated illation process. During the illation process, the restrictive qualifications for this algorithm are also outlined. By the analysis of 3-PCR parallel mechanism, such a quick SA algorithm can find the singular points wherever the initial point starts to seek. The algorithm can be used for those mechanisms which satisfy the restrictive qualifications to seek out singular points near the initial working points in workspace quickly and effectively.
Keywords :
Jacobian matrices; approximation theory; robot kinematics; stochastic processes; 3-PCR parallel mechanism; integrated illation process; mechanical kinematic Jacobian matrix; mechanical singularity; stochastic approximation; stochastic recursive algorithm; Algorithm design and analysis; Approximation algorithms; Approximation methods; Jacobian matrices; Joints; Kinematics; Qualifications; Mechanical kinematical Jacobian; Mechanical singularity; Stochastic approximation algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechatronics and Automation (ICMA), 2010 International Conference on
Conference_Location :
Xi´an
ISSN :
2152-7431
Print_ISBN :
978-1-4244-5140-1
Electronic_ISBN :
2152-7431
Type :
conf
DOI :
10.1109/ICMA.2010.5588086
Filename :
5588086
Link To Document :
بازگشت