基于运动学约束的在线最小加速度轨迹规划

Q2 Computer Science 自动化学报 Pub Date : 2014-07-01 DOI:10.1016/S1874-1029(14)60014-8
Ying-Shi WANG , Lei SUN , Lu ZHOU , Jing-Tai LIU
{"title":"基于运动学约束的在线最小加速度轨迹规划","authors":"Ying-Shi WANG ,&nbsp;Lei SUN ,&nbsp;Lu ZHOU ,&nbsp;Jing-Tai LIU","doi":"10.1016/S1874-1029(14)60014-8","DOIUrl":null,"url":null,"abstract":"<div><p>A novel approach based on a type of simplified motion planning (SMP) is presented in this paper to generate online trajectory for manipulator systems with multiple degrees of freedom (DOFs). The key issue is to find minimum-acceleration trajectory planning (MATP) to optimize the arm motion to reduce disturbance. Moreover, necessary and sufficient conditions for solution's existence subject to all the kinematic constraints of joint position, velocity, acceleration and jerk are devised. Besides, this new method can be activated online from the arbitrary initial state to the arbitrary target state so that it enables the robot to change the original path at any time. Finally, the approach is applied to a real humanoid robot arm with seven DOFs to show its efficiency.</p></div>","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60014-8","citationCount":"11","resultStr":"{\"title\":\"Online Minimum-acceleration Trajectory Planning with the Kinematic Constraints\",\"authors\":\"Ying-Shi WANG ,&nbsp;Lei SUN ,&nbsp;Lu ZHOU ,&nbsp;Jing-Tai LIU\",\"doi\":\"10.1016/S1874-1029(14)60014-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A novel approach based on a type of simplified motion planning (SMP) is presented in this paper to generate online trajectory for manipulator systems with multiple degrees of freedom (DOFs). The key issue is to find minimum-acceleration trajectory planning (MATP) to optimize the arm motion to reduce disturbance. Moreover, necessary and sufficient conditions for solution's existence subject to all the kinematic constraints of joint position, velocity, acceleration and jerk are devised. Besides, this new method can be activated online from the arbitrary initial state to the arbitrary target state so that it enables the robot to change the original path at any time. Finally, the approach is applied to a real humanoid robot arm with seven DOFs to show its efficiency.</p></div>\",\"PeriodicalId\":35798,\"journal\":{\"name\":\"自动化学报\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60014-8\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"自动化学报\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1874102914600148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"自动化学报","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1874102914600148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 11

摘要

提出了一种基于简化运动规划(SMP)的多自由度机械臂系统在线轨迹生成方法。关键问题是寻找最小加速度轨迹规划(MATP)来优化手臂运动以减少干扰。并给出了在关节位置、速度、加速度和加速度等运动约束下解存在的充分必要条件。此外,该方法可以从任意初始状态在线激活到任意目标状态,使机器人可以随时改变原路径。最后,将该方法应用于具有7个自由度的真实仿人机械臂,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Online Minimum-acceleration Trajectory Planning with the Kinematic Constraints

A novel approach based on a type of simplified motion planning (SMP) is presented in this paper to generate online trajectory for manipulator systems with multiple degrees of freedom (DOFs). The key issue is to find minimum-acceleration trajectory planning (MATP) to optimize the arm motion to reduce disturbance. Moreover, necessary and sufficient conditions for solution's existence subject to all the kinematic constraints of joint position, velocity, acceleration and jerk are devised. Besides, this new method can be activated online from the arbitrary initial state to the arbitrary target state so that it enables the robot to change the original path at any time. Finally, the approach is applied to a real humanoid robot arm with seven DOFs to show its efficiency.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自动化学报
自动化学报 Computer Science-Computer Graphics and Computer-Aided Design
CiteScore
4.80
自引率
0.00%
发文量
6655
期刊介绍: ACTA AUTOMATICA SINICA is a joint publication of Chinese Association of Automation and the Institute of Automation, the Chinese Academy of Sciences. The objective is the high quality and rapid publication of the articles, with a strong focus on new trends, original theoretical and experimental research and developments, emerging technology, and industrial standards in automation.
期刊最新文献
Robust Approximations to Joint Chance-constrained Problems A Chebyshev-Gauss Pseudospectral Method for Solving Optimal Control Problems Forward Affine Point Set Matching Under Variational Bayesian Framework SAR Image Despeckling by Sparse Reconstruction Based on Shearlets A semi-supervised agglomerative hierarchical clustering method based on dynamically updating constraints
×
引用
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