亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

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

方案(数学) 弹道 路径(计算) 搭配(遥感) 机械手 运动规划 控制理论(社会学) 计算机科学 数学优化 控制工程 数学 人工智能 工程类 机器人 控制(管理) 机器学习 物理 数学分析 程序设计语言 天文
作者
Ziyao Xiong,Jianwan Ding,Liping Chen,Yu Chen,Yan Dong
出处
期刊:Actuators [Multidisciplinary Digital Publishing Institute]
卷期号:13 (5): 189-189
标识
DOI:10.3390/act13050189
摘要

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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
cxw陈祥薇完成签到 ,获得积分10
4秒前
能干冰旋完成签到,获得积分10
26秒前
碧蓝静白完成签到,获得积分10
28秒前
殷勤的半凡完成签到,获得积分10
32秒前
35秒前
37秒前
科研通AI6.2的应助被ping采纳,获得10
42秒前
闪闪的YOSH完成签到,获得积分10
53秒前
1分钟前
一期一会完成签到,获得积分10
1分钟前
嗯对完成签到 ,获得积分10
1分钟前
1分钟前
1分钟前
单身的擎完成签到,获得积分10
1分钟前
搞怪山河完成签到,获得积分10
1分钟前
1分钟前
学霸业的应助被科研通管家采纳,获得10
1分钟前
神勇映雁的应助被科研通管家采纳,获得10
1分钟前
1分钟前
大个的应助被光明磊落陈2011采纳,获得10
1分钟前
轮子完成签到,获得积分10
1分钟前
1分钟前
涂涂发布了新的文献求助20
1分钟前
2分钟前
缓慢的映天完成签到,获得积分10
2分钟前
2分钟前
抚琴祛魅完成签到 ,获得积分10
2分钟前
ping发布了新的文献求助10
2分钟前
Criminology34的应助被涂涂采纳,获得10
2分钟前
江余怅晚完成签到 ,获得积分10
2分钟前
wuhao完成签到,获得积分10
2分钟前
科研通AI6.4的应助被隐形白亦采纳,获得10
2分钟前
2分钟前
2分钟前
快乐的稚晴完成签到,获得积分10
2分钟前
2分钟前
Huayan发布了新的文献求助10
2分钟前
2分钟前
隐形白亦发布了新的文献求助10
2分钟前
nimo完成签到,获得积分20
2分钟前
高分求助中
(应助此贴封号)通过应助OA文献获取积分 10000
Organizational Behavior 510
A Silent Apostrophe:The Fayum Portraits 350
Sing with Understanding: Introduction to Theology in Christian Congregational Song, 3rd ed 330
Auslegung und Untersuchung einer invers ausgelegten Beschaufelung eines einstufigen Axialverdichters mit Vorleitrad (German) 300
AI-Contracting 300
四川大学学位论文.郭瑞昂. 基于高压热扩散的n型磷掺杂金刚石半导体制备研究 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 计算机科学 工程类 纳米技术 有机化学 化学工程 内科学 物理 生物化学 复合材料 催化作用 细胞生物学 人工智能 心理学 无机化学 基因 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 7840437
求助须知:如何正确求助?哪些是违规求助? 9362210
关于积分的说明 20624715
捐赠科研通 7435047
什么是DOI,文献DOI怎么找? 3339678
关于科研通互助平台的介绍 2484072
邀请新用户注册赠送积分活动 2361361