{"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.<>