快速探索随机树算法在规划轨道路网场景中的应用

Zhenghua Hu, Qiubo Zhong, Chunya Tong, Kuai Wang
{"title":"快速探索随机树算法在规划轨道路网场景中的应用","authors":"Zhenghua Hu, Qiubo Zhong, Chunya Tong, Kuai Wang","doi":"10.1109/ICARM.2017.8273180","DOIUrl":null,"url":null,"abstract":"As the traffic situation of the road network in urban areas is becoming increasingly congested, the classical algorithm of rapidly exploring random tree (RRT) is introduced into the scene of the road network with scheduled tracks in this paper. And a dynamic path planning method based on the RRT algorithm is designed. The algorithm takes the start road segment of the route as the root node in the random tree to perform random extensions until the leaf node of the random tree covers the target road segment. Finally, the algorithm is simulated on the road network with congested areas in Wuhan. The result shows that the proposed method can not only effectively avoid the congestion areas in the road network, but also better meet the real-time demand for dynamic path planning.","PeriodicalId":416846,"journal":{"name":"International Conference on Advanced Robotics and Mechatronics","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Application of rapidly exploring random tree algorithm in the scene of road network with scheduled tracks\",\"authors\":\"Zhenghua Hu, Qiubo Zhong, Chunya Tong, Kuai Wang\",\"doi\":\"10.1109/ICARM.2017.8273180\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the traffic situation of the road network in urban areas is becoming increasingly congested, the classical algorithm of rapidly exploring random tree (RRT) is introduced into the scene of the road network with scheduled tracks in this paper. And a dynamic path planning method based on the RRT algorithm is designed. The algorithm takes the start road segment of the route as the root node in the random tree to perform random extensions until the leaf node of the random tree covers the target road segment. Finally, the algorithm is simulated on the road network with congested areas in Wuhan. The result shows that the proposed method can not only effectively avoid the congestion areas in the road network, but also better meet the real-time demand for dynamic path planning.\",\"PeriodicalId\":416846,\"journal\":{\"name\":\"International Conference on Advanced Robotics and Mechatronics\",\"volume\":\"133 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Advanced Robotics and Mechatronics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICARM.2017.8273180\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Advanced Robotics and Mechatronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARM.2017.8273180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Application of rapidly exploring random tree algorithm in the scene of road network with scheduled tracks
As the traffic situation of the road network in urban areas is becoming increasingly congested, the classical algorithm of rapidly exploring random tree (RRT) is introduced into the scene of the road network with scheduled tracks in this paper. And a dynamic path planning method based on the RRT algorithm is designed. The algorithm takes the start road segment of the route as the root node in the random tree to perform random extensions until the leaf node of the random tree covers the target road segment. Finally, the algorithm is simulated on the road network with congested areas in Wuhan. The result shows that the proposed method can not only effectively avoid the congestion areas in the road network, but also better meet the real-time demand for dynamic path planning.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Review on development of stand assist lifts for the elderly The ship trajectory simulation model based on seawater temperature changes on LabVIEW The establishment of detecting carbohydrate antigen 153 (CA153) with immunofluorescence chromatography The dynamic compliance composition of force-based impedance control and its experimental research The establishment of detecting cytokerantin 19 fragment(CYFRA21-1) with immunofluorescence chromatography
×
引用
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