基于改进RRT-Connect的自动驾驶车辆路径规划算法

IF 2.7 4区 工程技术 Q2 TRANSPORTATION SCIENCE & TECHNOLOGY Transportation Safety and Environment Pub Date : 2022-12-21 DOI:10.1093/tse/tdac061
Li Jin, Huang Chaowei, Pan Minqiang
{"title":"基于改进RRT-Connect的自动驾驶车辆路径规划算法","authors":"Li Jin, Huang Chaowei, Pan Minqiang","doi":"10.1093/tse/tdac061","DOIUrl":null,"url":null,"abstract":"\n This study aims to solve path planning of intelligent vehicles in self-driving. In this study, an improved path planning method combining constraints of environment and vehicle is proposed. The algorithm designs a reasonable path cost function, then uses heuristic guided search strategy to improve the speed and quality of path planning, and finally generates smooth and continuous curvature paths based on the path post-processing method based on the requirements of path smoothness. simulation test show that compared with the basic RRT, RRT-connect and RRT* algorithms, the path length of the proposed algorithm can be reduced by 19.7%, 29.3% and 1% respectively and the maximum planned path curvature of the proposed algorithm is 0.0796 m-1 and 0.1512 m-1 respectively under the condition of a small amount of planning time. The algorithm can plan the more suitable driving path for intelligent vehicle in complex environment.","PeriodicalId":52804,"journal":{"name":"Transportation Safety and Environment","volume":" ","pages":""},"PeriodicalIF":2.7000,"publicationDate":"2022-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Path Planning Algorithms for Self-Driving vehicle based on improved RRT-Connect\",\"authors\":\"Li Jin, Huang Chaowei, Pan Minqiang\",\"doi\":\"10.1093/tse/tdac061\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n This study aims to solve path planning of intelligent vehicles in self-driving. In this study, an improved path planning method combining constraints of environment and vehicle is proposed. The algorithm designs a reasonable path cost function, then uses heuristic guided search strategy to improve the speed and quality of path planning, and finally generates smooth and continuous curvature paths based on the path post-processing method based on the requirements of path smoothness. simulation test show that compared with the basic RRT, RRT-connect and RRT* algorithms, the path length of the proposed algorithm can be reduced by 19.7%, 29.3% and 1% respectively and the maximum planned path curvature of the proposed algorithm is 0.0796 m-1 and 0.1512 m-1 respectively under the condition of a small amount of planning time. The algorithm can plan the more suitable driving path for intelligent vehicle in complex environment.\",\"PeriodicalId\":52804,\"journal\":{\"name\":\"Transportation Safety and Environment\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2022-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Safety and Environment\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1093/tse/tdac061\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"TRANSPORTATION SCIENCE & TECHNOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Safety and Environment","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1093/tse/tdac061","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 1

摘要

本研究旨在解决智能汽车在自动驾驶中的路径规划问题。本文提出了一种结合环境和车辆约束的改进路径规划方法。该算法设计了一个合理的路径代价函数,然后使用启发式引导搜索策略来提高路径规划的速度和质量,最后根据路径平滑度的要求,基于路径后处理方法生成平滑连续的曲率路径。仿真测试表明,与基本的RRT、RRT-connect和RRT*算法相比,在少量规划时间的情况下,该算法的路径长度分别减少了19.7%、29.3%和1%,最大规划路径曲率分别为0.0796m-1和0.1512m-1。该算法可以为智能汽车在复杂环境中规划更合适的行驶路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Path Planning Algorithms for Self-Driving vehicle based on improved RRT-Connect
This study aims to solve path planning of intelligent vehicles in self-driving. In this study, an improved path planning method combining constraints of environment and vehicle is proposed. The algorithm designs a reasonable path cost function, then uses heuristic guided search strategy to improve the speed and quality of path planning, and finally generates smooth and continuous curvature paths based on the path post-processing method based on the requirements of path smoothness. simulation test show that compared with the basic RRT, RRT-connect and RRT* algorithms, the path length of the proposed algorithm can be reduced by 19.7%, 29.3% and 1% respectively and the maximum planned path curvature of the proposed algorithm is 0.0796 m-1 and 0.1512 m-1 respectively under the condition of a small amount of planning time. The algorithm can plan the more suitable driving path for intelligent vehicle in complex environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Transportation Safety and Environment
Transportation Safety and Environment TRANSPORTATION SCIENCE & TECHNOLOGY-
CiteScore
3.90
自引率
13.60%
发文量
32
审稿时长
10 weeks
期刊最新文献
Parking choice behavior analysis of rural residents based on latent variable random forest model Risk Mapping of Wildlife-Vehicle Collisions across the State of Montana, U.S.A.: A Machine Learning Approach for Imbalanced Data along Rural Roads Evolutionary game analysis of the shared parking market promotion under government management The Characteristics of Driver Lane-Changing Behavior in Congested Road Environments Effect of helmet wearing regulation on electric bike riders: a case study of two cities in China
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1