Collision free minimum time trajectory planning for manipulators using global search and gradient method

Motoji Yamamoto, Y. Isshiki, A. Mohri
{"title":"Collision free minimum time trajectory planning for manipulators using global search and gradient method","authors":"Motoji Yamamoto, Y. Isshiki, A. Mohri","doi":"10.1109/IROS.1994.407564","DOIUrl":null,"url":null,"abstract":"A method for a time optimal collision free trajectory planning problem is proposed. In this paper, the dynamics of manipulator and obstacles are considered. This type of optimal trajectory planning problem is very difficult and complicated one because of the nonlinearity of manipulator dynamics and existence of obstacles. Generally, it results in a multimodal optimization problem. The proposed method is basically an iteratively improving one based on a gradient method. Firstly, two global methods (a genetic algorithm or an exact cell decomposition method) are used to search multiple initial feasible spatial paths for the gradient method. Next, the gradient method searches the time optimal solution locally with the multiple initial feasible solutions. Simulation results show that this is an effective approach to the time optimal collision free trajectory planning problem.<<ETX>>","PeriodicalId":437805,"journal":{"name":"Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.1994.407564","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

A method for a time optimal collision free trajectory planning problem is proposed. In this paper, the dynamics of manipulator and obstacles are considered. This type of optimal trajectory planning problem is very difficult and complicated one because of the nonlinearity of manipulator dynamics and existence of obstacles. Generally, it results in a multimodal optimization problem. The proposed method is basically an iteratively improving one based on a gradient method. Firstly, two global methods (a genetic algorithm or an exact cell decomposition method) are used to search multiple initial feasible spatial paths for the gradient method. Next, the gradient method searches the time optimal solution locally with the multiple initial feasible solutions. Simulation results show that this is an effective approach to the time optimal collision free trajectory planning problem.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于全局搜索和梯度法的机械臂无碰撞最小时间轨迹规划
提出了一种时间最优无碰撞轨迹规划问题的求解方法。本文考虑了机械臂和障碍物的动力学问题。由于机械臂动力学的非线性和障碍物的存在,这类最优轨迹规划问题是一个非常困难和复杂的问题。一般来说,这是一个多模态优化问题。该方法基本上是一种基于梯度法的迭代改进方法。首先,采用遗传算法和精确元胞分解两种全局方法对梯度法的多个初始可行空间路径进行搜索;其次,梯度法利用多个初始可行解局部搜索时间最优解;仿真结果表明,该方法是求解无碰撞轨迹规划问题的有效方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An integrated approach to achieve dextrous grasping from task level specification Fuzzy logic joint path generation for kinematic redundant manipulators with multiple criteria Visual collision avoidance by segmentation Autonomous sonar navigation in indoor, unknown and unstructured environments Internal correction of dead-reckoning errors with the smart encoder trailer
×
引用
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