Sequential Optimal Trajectory Planning Scheme for Robotic Manipulators along Specified Path Based on Direct Collocation Method

Actuators Pub Date : 2024-05-15 DOI:10.3390/act13050189
Ziyao Xiong, Jianwan Ding, Liping Chen, Yu Chen, Dong Yan
{"title":"Sequential Optimal Trajectory Planning Scheme for Robotic Manipulators along Specified Path Based on Direct Collocation Method","authors":"Ziyao Xiong, Jianwan Ding, Liping Chen, Yu Chen, Dong Yan","doi":"10.3390/act13050189","DOIUrl":null,"url":null,"abstract":"Robotic manipulators play a pivotal role in modern intelligent manufacturing and unmanned production systems, often tasked with executing specific paths accurately. However, the input of the robotic manipulators is trajectory which is a path with time information. The resulting core technology is trajectory planning methods which are broadly classified into two categories: maximum velocity curve (MVC) methods and multiphase direct collocation (MPDC) methods. This paper concentrates on addressing challenges associated with the latter methods. In MPDC methods, the solving efficiency and accuracy are greatly influenced by the number of discretization nodes. When dealing with systems with complex dynamics, such as robotic manipulators, striking a balance between solving time and path discretization errors becomes crucial. We use a mesh refinement (MR) algorithm to find a suitable number of nodes under the premise of ensuring the path discretization error. So, the actual device can effectively implement the planned solutions. Nonetheless, the conventional application of the MR algorithm requires solving the original problem in each iteration; these processes are extremely time-consuming and may fail to solve when dealing with a complex dynamic system. As a result, we propose a sequential optimal trajectory planning scheme to solve the problem efficiently by dividing the original optimal control (OC) problem into two stages: path planning (PP) and trajectory planning (TP). In the PP stage, we employ a DC method based on arc length and an MR algorithm to identify key nodes along the specified path. This aims to minimize the approximation error introduced during discretization. In the TP stage, the identified key nodes serve as boundary conditions for an MPDC method based on time. This facilitates the generation of an optimal trajectory that maximizes motion performance, considering constant velocity in Cartesian space and dynamic constraints while keeping the path discretization error. Simulation and experiment are conducted with a six-axis robotic manipulator, ROCR6, and show significant potential for a wide range of applications in robotics.","PeriodicalId":504742,"journal":{"name":"Actuators","volume":"131 49","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Actuators","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/act13050189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Robotic manipulators play a pivotal role in modern intelligent manufacturing and unmanned production systems, often tasked with executing specific paths accurately. However, the input of the robotic manipulators is trajectory which is a path with time information. The resulting core technology is trajectory planning methods which are broadly classified into two categories: maximum velocity curve (MVC) methods and multiphase direct collocation (MPDC) methods. This paper concentrates on addressing challenges associated with the latter methods. In MPDC methods, the solving efficiency and accuracy are greatly influenced by the number of discretization nodes. When dealing with systems with complex dynamics, such as robotic manipulators, striking a balance between solving time and path discretization errors becomes crucial. We use a mesh refinement (MR) algorithm to find a suitable number of nodes under the premise of ensuring the path discretization error. So, the actual device can effectively implement the planned solutions. Nonetheless, the conventional application of the MR algorithm requires solving the original problem in each iteration; these processes are extremely time-consuming and may fail to solve when dealing with a complex dynamic system. As a result, we propose a sequential optimal trajectory planning scheme to solve the problem efficiently by dividing the original optimal control (OC) problem into two stages: path planning (PP) and trajectory planning (TP). In the PP stage, we employ a DC method based on arc length and an MR algorithm to identify key nodes along the specified path. This aims to minimize the approximation error introduced during discretization. In the TP stage, the identified key nodes serve as boundary conditions for an MPDC method based on time. This facilitates the generation of an optimal trajectory that maximizes motion performance, considering constant velocity in Cartesian space and dynamic constraints while keeping the path discretization error. Simulation and experiment are conducted with a six-axis robotic manipulator, ROCR6, and show significant potential for a wide range of applications in robotics.
基于直接拼接法的机器人机械手沿指定路径的顺序优化轨迹规划方案
机器人机械手在现代智能制造和无人生产系统中发挥着举足轻重的作用,其任务通常是准确执行特定路径。然而,机器人机械手的输入是带有时间信息的轨迹。由此产生的核心技术是轨迹规划方法,大致分为两类:最大速度曲线(MVC)方法和多相直接定位(MPDC)方法。本文主要讨论与后一种方法相关的挑战。在 MPDC 方法中,求解效率和精度在很大程度上受离散节点数量的影响。在处理具有复杂动力学特性的系统(如机器人操纵器)时,如何在求解时间和路径离散化误差之间取得平衡变得至关重要。我们采用网格细化(MR)算法,在保证路径离散误差的前提下,找到合适的节点数。这样,实际设备就能有效地实现规划的解决方案。然而,传统的 MR 算法需要在每次迭代中求解原始问题,这些过程非常耗时,而且在处理复杂的动态系统时可能无法求解。因此,我们提出了一种顺序最优轨迹规划方案,通过将原始最优控制(OC)问题分为路径规划(PP)和轨迹规划(TP)两个阶段来高效地解决该问题。在 PP 阶段,我们采用基于弧长的 DC 方法和 MR 算法来识别指定路径上的关键节点。这样做的目的是尽量减少离散化过程中引入的近似误差。在 TP 阶段,确定的关键节点将作为基于时间的 MPDC 方法的边界条件。考虑到笛卡尔空间中的恒定速度和动态约束,同时保持路径离散化误差,这有助于生成运动性能最大化的最优轨迹。仿真和实验是在六轴机器人机械手 ROCR6 上进行的,结果表明它在机器人技术的广泛应用中具有巨大潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书