{"title":"A steering method for the kinematic car using C*CS paths","authors":"D. Kiss, G. Tevesz","doi":"10.1109/CARPATHIANCC.2014.6843602","DOIUrl":null,"url":null,"abstract":"A steering method for local path generation of car-like robots is presented in this paper. It is shown that in the absence of obstacles there are infinitely many solutions between two arbitrary configurations in the form of C*CS paths. This property facilitates the application of this class of paths in global planning algorithms where collisions with obstacles have to be avoided. In addition, we show that the steering method based on C*CS paths satisfies the topological property, hence a complete path planning algorithm can be constructed based on it.","PeriodicalId":105920,"journal":{"name":"Proceedings of the 2014 15th International Carpathian Control Conference (ICCC)","volume":"15 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2014 15th International Carpathian Control Conference (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CARPATHIANCC.2014.6843602","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
A steering method for local path generation of car-like robots is presented in this paper. It is shown that in the absence of obstacles there are infinitely many solutions between two arbitrary configurations in the form of C*CS paths. This property facilitates the application of this class of paths in global planning algorithms where collisions with obstacles have to be avoided. In addition, we show that the steering method based on C*CS paths satisfies the topological property, hence a complete path planning algorithm can be constructed based on it.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
