{"title":"Collision-free path planning for a shape-changeable mobile robot in a 3-dimensional environment","authors":"Q. Xue, P. Sheu","doi":"10.1109/TAI.1990.130302","DOIUrl":null,"url":null,"abstract":"The problem of finding a collision-free path for a shape-changeable mobile robot in a 3D environment is studied. In order to solve the problem, a 3D path planner is used. This path planner represents the spaces which are occupied by the robot under different gestures as a set of cuboids of different sizes and uses two levels of planning, i.e. global path planning and local path planning to plan the path for the robot. The global path planner generates a most plausible global path for the robot. Subsequently, the local path planner first represents the free space along the plausible global path by a set of hexahedrons and then generates a connection graph whose vertices are the states of the robot and whose edges are operations of the robot by an expert system. Finally, a collision-free path is searched for in this connection graph.<<ETX>>","PeriodicalId":366276,"journal":{"name":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1990.130302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The problem of finding a collision-free path for a shape-changeable mobile robot in a 3D environment is studied. In order to solve the problem, a 3D path planner is used. This path planner represents the spaces which are occupied by the robot under different gestures as a set of cuboids of different sizes and uses two levels of planning, i.e. global path planning and local path planning to plan the path for the robot. The global path planner generates a most plausible global path for the robot. Subsequently, the local path planner first represents the free space along the plausible global path by a set of hexahedrons and then generates a connection graph whose vertices are the states of the robot and whose edges are operations of the robot by an expert system. Finally, a collision-free path is searched for in this connection graph.<>