Singularity distance computations for 3-RPR manipulators using intrinsic metrics

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Computer Aided Geometric Design Pub Date : 2024-05-21 DOI:10.1016/j.cagd.2024.102343
Aditya Kapilavai, Georg Nawratil
{"title":"Singularity distance computations for 3-RPR manipulators using intrinsic metrics","authors":"Aditya Kapilavai,&nbsp;Georg Nawratil","doi":"10.1016/j.cagd.2024.102343","DOIUrl":null,"url":null,"abstract":"<div><p>Avoiding singularities is a crucial task in robotics and path planning. This paper proposes a novel algorithm for detecting the closest singularity to a given pose for nine interpretations of the 3-RPR manipulator. The algorithm utilizes intrinsic metrics based on the framework's total elastic strain energy density, employing the physical concept of Green-Lagrange strain. The constrained optimization problem for detecting the closest singular configuration with respect to these metrics is solved globally using tools from numerical algebraic geometry implemented in the software package <span>Bertini</span>. The effectiveness of the proposed algorithm is demonstrated on a 3-RPR manipulator executing a one-parametric motion. Additionally, the obtained intrinsic singularity distances are compared with extrinsic metrics. Finally, the paper illustrates the advantage of employing a well-defined metric for identifying the closest singularities in comparison with the existing methods in the literature, highlighting its application in design optimization.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102343"},"PeriodicalIF":1.3000,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167839624000773/pdfft?md5=7aaa62823b27cbe61f490d7566678c2e&pid=1-s2.0-S0167839624000773-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839624000773","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Avoiding singularities is a crucial task in robotics and path planning. This paper proposes a novel algorithm for detecting the closest singularity to a given pose for nine interpretations of the 3-RPR manipulator. The algorithm utilizes intrinsic metrics based on the framework's total elastic strain energy density, employing the physical concept of Green-Lagrange strain. The constrained optimization problem for detecting the closest singular configuration with respect to these metrics is solved globally using tools from numerical algebraic geometry implemented in the software package Bertini. The effectiveness of the proposed algorithm is demonstrated on a 3-RPR manipulator executing a one-parametric motion. Additionally, the obtained intrinsic singularity distances are compared with extrinsic metrics. Finally, the paper illustrates the advantage of employing a well-defined metric for identifying the closest singularities in comparison with the existing methods in the literature, highlighting its application in design optimization.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用内在指标计算 3-RPR 机械手的奇点距离
避免奇点是机器人技术和路径规划中的一项重要任务。本文针对 3-RPR 机械手的九种解释提出了一种新型算法,用于检测与给定姿势最接近的奇点。该算法利用基于框架总弹性应变能量密度的内在度量,采用了格林-拉格朗日应变的物理概念。利用 Bertini 软件包中实施的数值代数几何工具,在全局范围内解决了检测与这些指标最接近的奇异配置的约束优化问题。在执行单参数运动的 3-RPR 机械手上演示了所提算法的有效性。此外,还将获得的内在奇异点距离与外在度量进行了比较。最后,本文说明了采用定义明确的度量来识别最接近奇点的优势,与现有文献中的方法进行了比较,并强调了其在设计优化中的应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Aided Geometric Design
Computer Aided Geometric Design 工程技术-计算机:软件工程
CiteScore
3.50
自引率
13.30%
发文量
57
审稿时长
60 days
期刊介绍: The journal Computer Aided Geometric Design is for researchers, scholars, and software developers dealing with mathematical and computational methods for the description of geometric objects as they arise in areas ranging from CAD/CAM to robotics and scientific visualization. The journal publishes original research papers, survey papers and with quick editorial decisions short communications of at most 3 pages. The primary objects of interest are curves, surfaces, and volumes such as splines (NURBS), meshes, subdivision surfaces as well as algorithms to generate, analyze, and manipulate them. This journal will report on new developments in CAGD and its applications, including but not restricted to the following: -Mathematical and Geometric Foundations- Curve, Surface, and Volume generation- CAGD applications in Numerical Analysis, Computational Geometry, Computer Graphics, or Computer Vision- Industrial, medical, and scientific applications. The aim is to collect and disseminate information on computer aided design in one journal. To provide the user community with methods and algorithms for representing curves and surfaces. To illustrate computer aided geometric design by means of interesting applications. To combine curve and surface methods with computer graphics. To explain scientific phenomena by means of computer graphics. To concentrate on the interaction between theory and application. To expose unsolved problems of the practice. To develop new methods in computer aided geometry.
期刊最新文献
RBF-MAT: Computing medial axis transform from point clouds by optimizing radial basis functions Infinity branches and asymptotic analysis of algebraic space curves: New techniques and applications Editorial Board Approximation properties over self-similar meshes of curved finite elements and applications to subdivision based isogeometric analysis A C1 simplex-spline basis for the Alfeld split in Rs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1