Jerk-Limited Online Trajectory Scaling for Cable-Driven Parallel Robots

IF 6.4 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS IEEE Transactions on Automation Science and Engineering Pub Date : 2025-01-24 DOI:10.1109/TASE.2025.3533583
Ruobing Wang;Yangmin Li
{"title":"Jerk-Limited Online Trajectory Scaling for Cable-Driven Parallel Robots","authors":"Ruobing Wang;Yangmin Li","doi":"10.1109/TASE.2025.3533583","DOIUrl":null,"url":null,"abstract":"Motion planning of cable-driven parallel robots (CDPRs) suffers from difficulties imposed by the flexibility and unilateral property of cables. Existing methods either rely on specific motion primitives or employ complex numerical search or optimization processes, which cannot be applied to real-time applications with arbitrary path constraints. Aiming to narrow this research gap, this paper proposes a look-ahead online scaling approach to generate feasible trajectories of CDPRs subject to cable velocity, acceleration, jerk and tension constraints. Firstly, based on a desired path, the constraint equations are converted into the equivalent bounds on the path states by a look-ahead bounds estimation module. Then the timing law is online scaled by three cascaded controllers to fulfill the estimated bounds. Finally, the scaled timing law and the desired path are combined to form the final trajectory. Comparative studies on a laboratory-developed CDPR prototype demonstrate that the proposed approach outperforms state-of-the-art methods in terms of solution quality and computation time. Note to Practitioners–This paper was motivated by the problem of generating feasible trajectories of cable-driven parallel robots (CDPRs) subject to cable velocity, acceleration, jerk and tension constraints. Existing approaches either rely on specific motion primitives or employ complex numerical search or optimization processes, which cannot be applied to real-time applications with arbitrary path constraints. This paper proposes a look-ahead online scaling approach to generate feasible trajectories of CDPRs subject to these constraints. The approach uses a look-ahead bounds estimation module to determine the constraint bounds on the path states and preserve the stability of the approach. And a cascaded trajectory scaling algorithm is designed to steer the constrained path states to track a reference signal. A theoretical proof of the convergence of the scaling algorithm is provided. Through comparative studies, we show that the approach outperforms state-of-the-art methods in terms of solution quality and computation time. Experiments on a real robot prototype indicate that our method effectively improves motion accuracy and alleviates robot vibrations by considering the jerk constraints.","PeriodicalId":51060,"journal":{"name":"IEEE Transactions on Automation Science and Engineering","volume":"22 ","pages":"11529-11539"},"PeriodicalIF":6.4000,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Automation Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10852338/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Motion planning of cable-driven parallel robots (CDPRs) suffers from difficulties imposed by the flexibility and unilateral property of cables. Existing methods either rely on specific motion primitives or employ complex numerical search or optimization processes, which cannot be applied to real-time applications with arbitrary path constraints. Aiming to narrow this research gap, this paper proposes a look-ahead online scaling approach to generate feasible trajectories of CDPRs subject to cable velocity, acceleration, jerk and tension constraints. Firstly, based on a desired path, the constraint equations are converted into the equivalent bounds on the path states by a look-ahead bounds estimation module. Then the timing law is online scaled by three cascaded controllers to fulfill the estimated bounds. Finally, the scaled timing law and the desired path are combined to form the final trajectory. Comparative studies on a laboratory-developed CDPR prototype demonstrate that the proposed approach outperforms state-of-the-art methods in terms of solution quality and computation time. Note to Practitioners–This paper was motivated by the problem of generating feasible trajectories of cable-driven parallel robots (CDPRs) subject to cable velocity, acceleration, jerk and tension constraints. Existing approaches either rely on specific motion primitives or employ complex numerical search or optimization processes, which cannot be applied to real-time applications with arbitrary path constraints. This paper proposes a look-ahead online scaling approach to generate feasible trajectories of CDPRs subject to these constraints. The approach uses a look-ahead bounds estimation module to determine the constraint bounds on the path states and preserve the stability of the approach. And a cascaded trajectory scaling algorithm is designed to steer the constrained path states to track a reference signal. A theoretical proof of the convergence of the scaling algorithm is provided. Through comparative studies, we show that the approach outperforms state-of-the-art methods in terms of solution quality and computation time. Experiments on a real robot prototype indicate that our method effectively improves motion accuracy and alleviates robot vibrations by considering the jerk constraints.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
缆索驱动并联机器人的在线轨迹缩放
缆索驱动并联机器人(CDPRs)的运动规划受到缆索柔韧性和单侧特性的影响。现有的方法要么依赖于特定的运动原语,要么采用复杂的数值搜索或优化过程,这些方法无法应用于具有任意路径约束的实时应用。为了缩小这一研究差距,本文提出了一种前瞻性在线标度方法,以生成受电缆速度、加速度、jerk和张力约束的可行cdpr轨迹。首先,基于期望路径,通过前瞻边界估计模块将约束方程转换为路径状态上的等效边界;然后由三个级联控制器在线缩放时序律以满足估计的界。最后,将缩放后的定时律与期望路径相结合,形成最终的轨迹。对实验室开发的CDPR原型的比较研究表明,所提出的方法在解决质量和计算时间方面优于最先进的方法。给从业者的说明——本文的动机是产生缆索驱动并联机器人(CDPRs)在缆索速度、加速度、加速度和张力约束下的可行轨迹问题。现有的方法要么依赖于特定的运动原语,要么采用复杂的数值搜索或优化过程,这些方法无法应用于具有任意路径约束的实时应用。本文提出了一种前瞻性的在线标度方法来生成受这些约束的cdpr的可行轨迹。该方法使用预估边界估计模块来确定路径状态上的约束边界,并保持方法的稳定性。设计了一种级联轨迹缩放算法,使受约束的路径状态跟踪参考信号。从理论上证明了该缩放算法的收敛性。通过比较研究,我们表明该方法在解决质量和计算时间方面优于最先进的方法。在实际机器人样机上的实验表明,该方法在考虑了抽动约束的情况下,有效地提高了运动精度,减轻了机器人的振动。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Automation Science and Engineering
IEEE Transactions on Automation Science and Engineering 工程技术-自动化与控制系统
CiteScore
12.50
自引率
14.30%
发文量
404
审稿时长
3.0 months
期刊介绍: The IEEE Transactions on Automation Science and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. T-ASE welcomes results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, security, service, supply chains, and transportation. T-ASE addresses a research community willing to integrate knowledge across disciplines and industries. For this purpose, each paper includes a Note to Practitioners that summarizes how its results can be applied or how they might be extended to apply in practice.
期刊最新文献
Sliding Flexible Performance Preset Boundary-Based Fuzzy Control for Input Saturated Discrete-Time Nonlinear Systems Dual-layer Multi-objective Particle Swarm Optimization Algorithm for Partial Destructive Incomplete Disassembly Line Balancing Problem Vehicle stability and synchronization control of dual-motor steer-by-wire system considering time-varying CAN network time delay Reinforcement Learning-Based Preset Trajectory Tracking Control for Vehicle Platoon Under State Constraints Observer-Based Robust H ∞ Fault-Tolerant Control for T-S Fuzzy Fractional-Order Systems With Multiple Faults and Disturbances
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1