西格玛角弧曲线:增强机器人时间最优路径参数化,实现高阶平滑运动

IF 9.1 1区 计算机科学 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Robotics and Computer-integrated Manufacturing Pub Date : 2024-09-27 DOI:10.1016/j.rcim.2024.102884
Shize Zhao, Tianjiao Zheng, Chengzhi Wang, Ziyuan Yang, Tian Xu, Yanhe Zhu, Jie Zhao
{"title":"西格玛角弧曲线:增强机器人时间最优路径参数化,实现高阶平滑运动","authors":"Shize Zhao,&nbsp;Tianjiao Zheng,&nbsp;Chengzhi Wang,&nbsp;Ziyuan Yang,&nbsp;Tian Xu,&nbsp;Yanhe Zhu,&nbsp;Jie Zhao","doi":"10.1016/j.rcim.2024.102884","DOIUrl":null,"url":null,"abstract":"<div><div>Trajectory planning is crucial in the motion planning of robots, where finding the time-optimal path parameterization (TOPP) of a given path subject to kinodynamic constraints is an important component of trajectory planning. The tangential discontinuity at the intersection of continuous line segments limits the speed of trajectory planning and can easily cause jitter and over-constraint phenomena. Smooth transitions at corners can be achieved by inserting parameter spline curves. However, due to the insensitivity of parameter spline curves to arc length, their performance in the application of the TOPP algorithm, which relies on the higher-order robot kinematics smoothness (i.e., the function <span><math><mrow><mi>q</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow></math></span> of the configuration space to the Cartesian space), fails to meet expectations.</div><div>A smoothing method suitable for the TOPP algorithm is proposed: Sigmoid Angle-Arc Curve (SAAC). This curve exhibits excellent performance in smooth corner transitions of the TOPP algorithm and is parameterized using arc length. The curvature and geometry of its curves can be expressed analytically in terms of arc lengths. Compared with the traditional B-spline method and the symmetric Euler spiral blending (SE-spiral), SAAC can provide smoother <span><math><msup><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> robot kinematics characteristics. Using the TOPP algorithm based on SAAC can significantly enhance the robustness of the TOPP algorithm, significantly reduce jerks, and reduce the time required for movement.</div></div>","PeriodicalId":21452,"journal":{"name":"Robotics and Computer-integrated Manufacturing","volume":"92 ","pages":"Article 102884"},"PeriodicalIF":9.1000,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sigmoid angle-arc curves: Enhancing robot time-optimal path parameterization for high-order smooth motion\",\"authors\":\"Shize Zhao,&nbsp;Tianjiao Zheng,&nbsp;Chengzhi Wang,&nbsp;Ziyuan Yang,&nbsp;Tian Xu,&nbsp;Yanhe Zhu,&nbsp;Jie Zhao\",\"doi\":\"10.1016/j.rcim.2024.102884\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Trajectory planning is crucial in the motion planning of robots, where finding the time-optimal path parameterization (TOPP) of a given path subject to kinodynamic constraints is an important component of trajectory planning. The tangential discontinuity at the intersection of continuous line segments limits the speed of trajectory planning and can easily cause jitter and over-constraint phenomena. Smooth transitions at corners can be achieved by inserting parameter spline curves. However, due to the insensitivity of parameter spline curves to arc length, their performance in the application of the TOPP algorithm, which relies on the higher-order robot kinematics smoothness (i.e., the function <span><math><mrow><mi>q</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow></math></span> of the configuration space to the Cartesian space), fails to meet expectations.</div><div>A smoothing method suitable for the TOPP algorithm is proposed: Sigmoid Angle-Arc Curve (SAAC). This curve exhibits excellent performance in smooth corner transitions of the TOPP algorithm and is parameterized using arc length. The curvature and geometry of its curves can be expressed analytically in terms of arc lengths. Compared with the traditional B-spline method and the symmetric Euler spiral blending (SE-spiral), SAAC can provide smoother <span><math><msup><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> robot kinematics characteristics. Using the TOPP algorithm based on SAAC can significantly enhance the robustness of the TOPP algorithm, significantly reduce jerks, and reduce the time required for movement.</div></div>\",\"PeriodicalId\":21452,\"journal\":{\"name\":\"Robotics and Computer-integrated Manufacturing\",\"volume\":\"92 \",\"pages\":\"Article 102884\"},\"PeriodicalIF\":9.1000,\"publicationDate\":\"2024-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Robotics and Computer-integrated Manufacturing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0736584524001716\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics and Computer-integrated Manufacturing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0736584524001716","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

轨迹规划在机器人的运动规划中至关重要,其中,根据动力学约束条件找到给定路径的时间最优路径参数化(TOPP)是轨迹规划的重要组成部分。连续线段交叉处的切向不连续性限制了轨迹规划的速度,并容易造成抖动和过度约束现象。在拐角处插入参数样条曲线可以实现平滑过渡。然而,由于参数样条曲线对弧长不敏感,在应用依赖于高阶机器人运动学平滑性(即配置空间到笛卡尔空间的函数 q(s))的 TOPP 算法时,其性能达不到预期:我们提出了一种适合 TOPP 算法的平滑方法:Sigmoid Angle-Arc Curve (SAAC)。该曲线在 TOPP 算法的平滑转角方面表现出色,并使用弧长作为参数。其曲线的曲率和几何形状可以用弧长分析表示。与传统的 B 样条法和对称欧拉螺旋混合法(SE-spiral)相比,SAAC 可以提供更平滑的 C2 机器人运动学特性。使用基于 SAAC 的 TOPP 算法可以大大增强 TOPP 算法的鲁棒性,显著减少抖动,并缩短运动所需的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Sigmoid angle-arc curves: Enhancing robot time-optimal path parameterization for high-order smooth motion
Trajectory planning is crucial in the motion planning of robots, where finding the time-optimal path parameterization (TOPP) of a given path subject to kinodynamic constraints is an important component of trajectory planning. The tangential discontinuity at the intersection of continuous line segments limits the speed of trajectory planning and can easily cause jitter and over-constraint phenomena. Smooth transitions at corners can be achieved by inserting parameter spline curves. However, due to the insensitivity of parameter spline curves to arc length, their performance in the application of the TOPP algorithm, which relies on the higher-order robot kinematics smoothness (i.e., the function q(s) of the configuration space to the Cartesian space), fails to meet expectations.
A smoothing method suitable for the TOPP algorithm is proposed: Sigmoid Angle-Arc Curve (SAAC). This curve exhibits excellent performance in smooth corner transitions of the TOPP algorithm and is parameterized using arc length. The curvature and geometry of its curves can be expressed analytically in terms of arc lengths. Compared with the traditional B-spline method and the symmetric Euler spiral blending (SE-spiral), SAAC can provide smoother C2 robot kinematics characteristics. Using the TOPP algorithm based on SAAC can significantly enhance the robustness of the TOPP algorithm, significantly reduce jerks, and reduce the time required for movement.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Robotics and Computer-integrated Manufacturing
Robotics and Computer-integrated Manufacturing 工程技术-工程:制造
CiteScore
24.10
自引率
13.50%
发文量
160
审稿时长
50 days
期刊介绍: The journal, Robotics and Computer-Integrated Manufacturing, focuses on sharing research applications that contribute to the development of new or enhanced robotics, manufacturing technologies, and innovative manufacturing strategies that are relevant to industry. Papers that combine theory and experimental validation are preferred, while review papers on current robotics and manufacturing issues are also considered. However, papers on traditional machining processes, modeling and simulation, supply chain management, and resource optimization are generally not within the scope of the journal, as there are more appropriate journals for these topics. Similarly, papers that are overly theoretical or mathematical will be directed to other suitable journals. The journal welcomes original papers in areas such as industrial robotics, human-robot collaboration in manufacturing, cloud-based manufacturing, cyber-physical production systems, big data analytics in manufacturing, smart mechatronics, machine learning, adaptive and sustainable manufacturing, and other fields involving unique manufacturing technologies.
期刊最新文献
Knowledge extraction for additive manufacturing process via named entity recognition with LLMs Digital Twin-driven multi-scale characterization of machining quality: current status, challenges, and future perspectives A dual knowledge embedded hybrid model based on augmented data and improved loss function for tool wear monitoring A real-time collision avoidance method for redundant dual-arm robots in an open operational environment Less gets more attention: A novel human-centered MR remote collaboration assembly method with information recommendation and visual enhancement
×
引用
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