Path planning and dynamic simulation of weightlifting robot manipulator

P. Cheng, Chun-Yen Chen
{"title":"Path planning and dynamic simulation of weightlifting robot manipulator","authors":"P. Cheng, Chun-Yen Chen","doi":"10.1109/ARSO.2007.4531426","DOIUrl":null,"url":null,"abstract":"The current paper proposes a novel algorithm to construct an efficient path for each joint of the weightlifting robot based on the proposed \"momentum method\". The Dijkstra algorithm, a typical searching method in artificial intelligence, is adopted to obtain the shortest path. A novel idea is proposed to improve the efficiency of Dijkstra algorithm so that it took less time to search for solutions with high accuracy. In order to obtain a high efficiency computing processes in dynamics, we formulize the optimal path with the discrete grid points based on the B-spline theory, so that we can calculate the angular velocity, angular acceleration and moment more precisely. The path planning dynamic model of three joints weightlifting robot is presented. The results of simulations demonstrated the effective and practical work with the proposed method in this paper.","PeriodicalId":344670,"journal":{"name":"2007 IEEE Workshop on Advanced Robotics and Its Social Impacts","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Workshop on Advanced Robotics and Its Social Impacts","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARSO.2007.4531426","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The current paper proposes a novel algorithm to construct an efficient path for each joint of the weightlifting robot based on the proposed "momentum method". The Dijkstra algorithm, a typical searching method in artificial intelligence, is adopted to obtain the shortest path. A novel idea is proposed to improve the efficiency of Dijkstra algorithm so that it took less time to search for solutions with high accuracy. In order to obtain a high efficiency computing processes in dynamics, we formulize the optimal path with the discrete grid points based on the B-spline theory, so that we can calculate the angular velocity, angular acceleration and moment more precisely. The path planning dynamic model of three joints weightlifting robot is presented. The results of simulations demonstrated the effective and practical work with the proposed method in this paper.
举重机器人机械手路径规划与动态仿真
本文在提出的“动量法”的基础上,提出了一种构造举重机器人各关节有效路径的新算法。采用人工智能中典型的搜索方法Dijkstra算法来获取最短路径。为了提高Dijkstra算法的效率,提出了一种新颖的方法,使Dijkstra算法能够在较短的时间内以较高的精度搜索解。为了在动力学中获得高效率的计算过程,我们基于b样条理论将离散网格点的最优路径公式化,从而更精确地计算出角速度、角加速度和力矩。建立了三关节举重机器人的路径规划动力学模型。仿真结果证明了该方法的有效性和实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信