T. Kito, J. Ota, R. Katsuki, T. Mizuta, T. Arai, T. Ueyama, T. Nishiyama
{"title":"采用可视性类图法进行平滑路径规划","authors":"T. Kito, J. Ota, R. Katsuki, T. Mizuta, T. Arai, T. Ueyama, T. Nishiyama","doi":"10.1109/ROBOT.2003.1242175","DOIUrl":null,"url":null,"abstract":"To achieve smooth motion of car-like robots, it is necessary to generate paths that satisfy the following conditions: maximum curvature, maximum curvature derivative, and curvature continuity. Another requirement is that human operators can manipulate the robots with ease. In this paper, a path expression methodology consisting of line segments, circular arcs and clothoid arcs is presented. In addition, a method of global path generation with a visibility graph is proposed. To establish this method, the following steps are proposed: (a) the arrangement of subgoals (middle points) and (b) the construction of the graph for path generation. By using the proposed method, the paths were shortened 14% on average.","PeriodicalId":315346,"journal":{"name":"2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"Smooth path planning by using visibility graph-like method\",\"authors\":\"T. Kito, J. Ota, R. Katsuki, T. Mizuta, T. Arai, T. Ueyama, T. Nishiyama\",\"doi\":\"10.1109/ROBOT.2003.1242175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To achieve smooth motion of car-like robots, it is necessary to generate paths that satisfy the following conditions: maximum curvature, maximum curvature derivative, and curvature continuity. Another requirement is that human operators can manipulate the robots with ease. In this paper, a path expression methodology consisting of line segments, circular arcs and clothoid arcs is presented. In addition, a method of global path generation with a visibility graph is proposed. To establish this method, the following steps are proposed: (a) the arrangement of subgoals (middle points) and (b) the construction of the graph for path generation. By using the proposed method, the paths were shortened 14% on average.\",\"PeriodicalId\":315346,\"journal\":{\"name\":\"2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROBOT.2003.1242175\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBOT.2003.1242175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Smooth path planning by using visibility graph-like method
To achieve smooth motion of car-like robots, it is necessary to generate paths that satisfy the following conditions: maximum curvature, maximum curvature derivative, and curvature continuity. Another requirement is that human operators can manipulate the robots with ease. In this paper, a path expression methodology consisting of line segments, circular arcs and clothoid arcs is presented. In addition, a method of global path generation with a visibility graph is proposed. To establish this method, the following steps are proposed: (a) the arrangement of subgoals (middle points) and (b) the construction of the graph for path generation. By using the proposed method, the paths were shortened 14% on average.