{"title":"RTR+C*CS:一种有效的类车机器人几何规划器","authors":"Gabor Csorvasi, Á. Nagy, D. Kiss","doi":"10.1109/CARPATHIANCC.2015.7145051","DOIUrl":null,"url":null,"abstract":"The need for intelligent autonomous vehicles is increasing in industrial and everyday life as well. Path planning among obstacles is one of the challenging problems to be solved to achieve autonomous navigation. In this paper we present a global geometric path planning method for car-like robots, which proved to be effective especially in cluttered environments, containing narrow passages. Navigation in such scenarios usually requires non-obvious manoeuvring with many reversals, which is challenging even for a human driver. We also present a comparative analysis of our method with possible alternatives from the literature to illustrate its effectiveness regarding computation time and path quality.","PeriodicalId":187762,"journal":{"name":"Proceedings of the 2015 16th International Carpathian Control Conference (ICCC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"RTR+C*CS: An effective geometric planner for car-like robots\",\"authors\":\"Gabor Csorvasi, Á. Nagy, D. Kiss\",\"doi\":\"10.1109/CARPATHIANCC.2015.7145051\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The need for intelligent autonomous vehicles is increasing in industrial and everyday life as well. Path planning among obstacles is one of the challenging problems to be solved to achieve autonomous navigation. In this paper we present a global geometric path planning method for car-like robots, which proved to be effective especially in cluttered environments, containing narrow passages. Navigation in such scenarios usually requires non-obvious manoeuvring with many reversals, which is challenging even for a human driver. We also present a comparative analysis of our method with possible alternatives from the literature to illustrate its effectiveness regarding computation time and path quality.\",\"PeriodicalId\":187762,\"journal\":{\"name\":\"Proceedings of the 2015 16th International Carpathian Control Conference (ICCC)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2015 16th International Carpathian Control Conference (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CARPATHIANCC.2015.7145051\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 16th International Carpathian Control Conference (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CARPATHIANCC.2015.7145051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
RTR+C*CS: An effective geometric planner for car-like robots
The need for intelligent autonomous vehicles is increasing in industrial and everyday life as well. Path planning among obstacles is one of the challenging problems to be solved to achieve autonomous navigation. In this paper we present a global geometric path planning method for car-like robots, which proved to be effective especially in cluttered environments, containing narrow passages. Navigation in such scenarios usually requires non-obvious manoeuvring with many reversals, which is challenging even for a human driver. We also present a comparative analysis of our method with possible alternatives from the literature to illustrate its effectiveness regarding computation time and path quality.