A quick algorithm for finding mechanical singularity by stochastic approximation

Wenyuan Liang, Yong Yu, Y. Ge
{"title":"A quick algorithm for finding mechanical singularity by stochastic approximation","authors":"Wenyuan Liang, Yong Yu, Y. Ge","doi":"10.1109/ICMA.2010.5588086","DOIUrl":null,"url":null,"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.","PeriodicalId":145608,"journal":{"name":"2010 IEEE International Conference on Mechatronics and Automation","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Mechatronics and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMA.2010.5588086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

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.
基于随机逼近的机械奇点快速求解算法
本文研究了一种基于随机逼近(SA)的机械奇异点快速求解算法。与传统算法相比,该算法速度更快,效率更高。随机递归算法,又称随机递归算法,有多种形式和广泛的应用。该算法与机械运动学雅可比矩阵相结合,基于严格的综合推理过程。在仿真过程中,还概述了该算法的约束条件。通过对3-PCR并行机制的分析,该算法可以在起始点开始寻找的地方找到奇异点。该算法可用于满足约束条件的机构在工作空间中快速有效地求出初始工作点附近的奇异点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信