An approach to collision avoidance issues for redundant manipulator

M. Shibata, K. Ohnishi
{"title":"An approach to collision avoidance issues for redundant manipulator","authors":"M. Shibata, K. Ohnishi","doi":"10.1109/IECON.1993.339291","DOIUrl":null,"url":null,"abstract":"This paper describes a novel method to plan the collision-free trajectory for robot manipulator. When several obstacles are fixed on the ground or in the air in the workspace, the shortest path between two ordered points, which represents a sequence of points indicating the positions for manipulator tip, and the manipulator configurations corresponding the tip positions are planned with the method. The approach proposed consists of two parts. First, the shortest path for the manipulator tip is planned, which detours around the obstacles. When each obstacle is recognized as an aggregate of convex polyhedra, it is shown that the shortest path consists of linked segments and easily calculated by solving the recursive quadratic equations. Next, successive motion for the manipulator to avoid collisions against the obstacles is planned, since the structure of manipulator is not considered in the solved path. The configurations of the manipulator is determined by depending on the tip position along the path and by referring the distances among manipulator links and obstacles.<<ETX>>","PeriodicalId":132101,"journal":{"name":"Proceedings of IECON '93 - 19th Annual Conference of IEEE Industrial Electronics","volume":"214 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IECON '93 - 19th Annual Conference of IEEE Industrial Electronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IECON.1993.339291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper describes a novel method to plan the collision-free trajectory for robot manipulator. When several obstacles are fixed on the ground or in the air in the workspace, the shortest path between two ordered points, which represents a sequence of points indicating the positions for manipulator tip, and the manipulator configurations corresponding the tip positions are planned with the method. The approach proposed consists of two parts. First, the shortest path for the manipulator tip is planned, which detours around the obstacles. When each obstacle is recognized as an aggregate of convex polyhedra, it is shown that the shortest path consists of linked segments and easily calculated by solving the recursive quadratic equations. Next, successive motion for the manipulator to avoid collisions against the obstacles is planned, since the structure of manipulator is not considered in the solved path. The configurations of the manipulator is determined by depending on the tip position along the path and by referring the distances among manipulator links and obstacles.<>
冗余机械臂避碰问题的一种方法
提出了一种新的机器人无碰撞轨迹规划方法。当工作空间中地面或空中固定多个障碍物时,利用该方法规划出指示机械手尖端位置的有序两点之间的最短路径,并规划出与尖端位置相对应的机械手构型。提出的方法由两部分组成。首先,规划机械臂末端的最短路径,该路径绕过障碍物。当每个障碍物被识别为凸多面体的集合时,最短路径由相连的段组成,并且易于通过求解递推二次方程来计算。其次,由于在求解路径中不考虑机械臂的结构,因此规划了机械臂避免与障碍物碰撞的连续运动。机械手的构型取决于末端沿路径的位置,并参考机械手连杆与障碍物之间的距离来确定。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信