{"title":"Efficient method to generate collision free paths for an autonomous mobile robot based on new free space structuring approach","authors":"M. Habib, H. Asama","doi":"10.1109/IROS.1991.174534","DOIUrl":null,"url":null,"abstract":"A technique is developed based on free link concept to construct the available free space between obstacles within robot's environment in terms of free convex area. Then, a new kind of vertex graph called MAKLINK is constructed to support the generation of a collision free path. This graph is constructed using the midpoints of common free links between free convex area as passing points. These points correspond to nodes in a graph and the connection between them within each convex area as arcs in this graph. A collision free path can be efficiently generated using the MAKLINK graph. The complexity of the search for a collision free path is greatly reduced by minimizing the size of the graph to be searched concerning the number of nodes and the number of arcs connecting them. The analysis of the proposed algorithm shows its efficiency in terms of computation ability, safety, optimality, and in supporting robot navigation along the generated path.<<ETX>>","PeriodicalId":388962,"journal":{"name":"Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"95","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.1991.174534","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 95
Abstract
A technique is developed based on free link concept to construct the available free space between obstacles within robot's environment in terms of free convex area. Then, a new kind of vertex graph called MAKLINK is constructed to support the generation of a collision free path. This graph is constructed using the midpoints of common free links between free convex area as passing points. These points correspond to nodes in a graph and the connection between them within each convex area as arcs in this graph. A collision free path can be efficiently generated using the MAKLINK graph. The complexity of the search for a collision free path is greatly reduced by minimizing the size of the graph to be searched concerning the number of nodes and the number of arcs connecting them. The analysis of the proposed algorithm shows its efficiency in terms of computation ability, safety, optimality, and in supporting robot navigation along the generated path.<>