考虑交通不确定性的自动驾驶车辆近未来交通评估导航

Kuen-Wey Lin, M. Hashimoto, Yih-Lang Li
{"title":"考虑交通不确定性的自动驾驶车辆近未来交通评估导航","authors":"Kuen-Wey Lin, M. Hashimoto, Yih-Lang Li","doi":"10.1109/ISQED.2018.8357324","DOIUrl":null,"url":null,"abstract":"Because it is difficult to find empty space in a developed city to accommodate more transportation infrastructures, the development of an effective navigation system is a low cost option for mitigating traffic jam. Regarding a future world where automated driving technologies have become mature and most vehicles follow the pre-scheduled route suggested by a navigation system, it is likely to predict the traffic jam accurately if the navigation system can know the pre-scheduled route of each vehicle. Recently, a navigation algorithm is presented for automated driving vehicles with the assumption that all the navigating query requests are processed by a single system. However, the aforementioned algorithm does not consider any kind of uncertainty originating from accidents and destination change. To get close to the real world, we propose a navigation algorithm with near-future evaluation capability that also allows some kinds of uncertainties. We compare our algorithm with a dynamic-update based conventional navigation algorithm without near-future evaluation capability. We download some metropolitan maps from OpenStreetMap and utilize the data of traffic flow from official statistics to randomly generate many sets queries. Experimental results show that the total cruising time is improved for each case.","PeriodicalId":213351,"journal":{"name":"2018 19th International Symposium on Quality Electronic Design (ISQED)","volume":"43 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Near-future traffic evaluation based navigation for automated driving vehicles considering traffic uncertainties\",\"authors\":\"Kuen-Wey Lin, M. Hashimoto, Yih-Lang Li\",\"doi\":\"10.1109/ISQED.2018.8357324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Because it is difficult to find empty space in a developed city to accommodate more transportation infrastructures, the development of an effective navigation system is a low cost option for mitigating traffic jam. Regarding a future world where automated driving technologies have become mature and most vehicles follow the pre-scheduled route suggested by a navigation system, it is likely to predict the traffic jam accurately if the navigation system can know the pre-scheduled route of each vehicle. Recently, a navigation algorithm is presented for automated driving vehicles with the assumption that all the navigating query requests are processed by a single system. However, the aforementioned algorithm does not consider any kind of uncertainty originating from accidents and destination change. To get close to the real world, we propose a navigation algorithm with near-future evaluation capability that also allows some kinds of uncertainties. We compare our algorithm with a dynamic-update based conventional navigation algorithm without near-future evaluation capability. We download some metropolitan maps from OpenStreetMap and utilize the data of traffic flow from official statistics to randomly generate many sets queries. Experimental results show that the total cruising time is improved for each case.\",\"PeriodicalId\":213351,\"journal\":{\"name\":\"2018 19th International Symposium on Quality Electronic Design (ISQED)\",\"volume\":\"43 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 19th International Symposium on Quality Electronic Design (ISQED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISQED.2018.8357324\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 19th International Symposium on Quality Electronic Design (ISQED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISQED.2018.8357324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

由于在发达城市中很难找到空地来容纳更多的交通基础设施,因此开发有效的导航系统是缓解交通拥堵的低成本选择。在自动驾驶技术成熟的未来世界,大多数车辆按照导航系统建议的预定路线行驶,如果导航系统能够知道每辆车的预定路线,就有可能准确预测交通堵塞。最近,提出了一种自动驾驶车辆导航算法,该算法假设所有导航查询请求都由单个系统处理。然而,上述算法没有考虑事故和目的地变化引起的任何不确定性。为了接近真实世界,我们提出了一种具有近未来评估能力的导航算法,该算法也允许某些不确定性。我们将该算法与基于动态更新的传统导航算法进行了比较,该算法不具有近未来评估能力。我们从OpenStreetMap下载了一些城市地图,并利用官方统计的交通流量数据随机生成了许多集查询。实验结果表明,在每种情况下,总巡航时间都有所提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Near-future traffic evaluation based navigation for automated driving vehicles considering traffic uncertainties
Because it is difficult to find empty space in a developed city to accommodate more transportation infrastructures, the development of an effective navigation system is a low cost option for mitigating traffic jam. Regarding a future world where automated driving technologies have become mature and most vehicles follow the pre-scheduled route suggested by a navigation system, it is likely to predict the traffic jam accurately if the navigation system can know the pre-scheduled route of each vehicle. Recently, a navigation algorithm is presented for automated driving vehicles with the assumption that all the navigating query requests are processed by a single system. However, the aforementioned algorithm does not consider any kind of uncertainty originating from accidents and destination change. To get close to the real world, we propose a navigation algorithm with near-future evaluation capability that also allows some kinds of uncertainties. We compare our algorithm with a dynamic-update based conventional navigation algorithm without near-future evaluation capability. We download some metropolitan maps from OpenStreetMap and utilize the data of traffic flow from official statistics to randomly generate many sets queries. Experimental results show that the total cruising time is improved for each case.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Body-biasing assisted vmin optimization for 5nm-node multi-Vt FD-SOI 6T-SRAM PDA-HyPAR: Path-diversity-aware hybrid planar adaptive routing algorithm for 3D NoCs A loop structure optimization targeting high-level synthesis of fast number theoretic transform Hybrid-comp: A criticality-aware compressed last-level cache Low power latch based design with smart retiming
×
引用
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