A steering method for the kinematic car using C*CS paths

D. Kiss, G. Tevesz
{"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.
基于C*CS路径的运动小车转向方法
提出了一种用于类车机器人局部路径生成的转向方法。证明了在没有障碍物的情况下,C*CS路径形式的任意两种构型之间存在无穷多个解。这一性质有利于这类路径在全局规划算法中的应用,在全局规划算法中,必须避免与障碍物的碰撞。此外,我们还证明了基于C*CS路径的转向方法满足拓扑性质,因此可以在此基础上构造完整的路径规划算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信