Velocity decision algorithm for platooning based on converging sequence and converging possibility

Taisei Tokuda, Masaki Suzuki, Shohei Kanda, H. Shigeno
{"title":"Velocity decision algorithm for platooning based on converging sequence and converging possibility","authors":"Taisei Tokuda, Masaki Suzuki, Shohei Kanda, H. Shigeno","doi":"10.1109/ITST.2011.6060145","DOIUrl":null,"url":null,"abstract":"Recently, there has been considerable research on ITS(Intelligent Transport System). The platooning of some trucks on the express way is discussed widely as an important part of ITS application. In order to organize the platooning, it is required to converge each other. However, because the sequence of converging from wide area depends on the driver's decision and there is no basis velocity for converging, it is potentially difficult to achieve efficient convergence for platooning. In this paper, we propose a velocity decision algorithm for platoon and it has two main components. The one is decision the sequence of converging and the other is call into account whether a platoon relevant truck can converge each others. We implemented and evaluated our proposition in comparison to simple converging method by computer simulation. As the result, we show that our proposal have efficacy as converging for platooning.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Conference on ITS Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITST.2011.6060145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, there has been considerable research on ITS(Intelligent Transport System). The platooning of some trucks on the express way is discussed widely as an important part of ITS application. In order to organize the platooning, it is required to converge each other. However, because the sequence of converging from wide area depends on the driver's decision and there is no basis velocity for converging, it is potentially difficult to achieve efficient convergence for platooning. In this paper, we propose a velocity decision algorithm for platoon and it has two main components. The one is decision the sequence of converging and the other is call into account whether a platoon relevant truck can converge each others. We implemented and evaluated our proposition in comparison to simple converging method by computer simulation. As the result, we show that our proposal have efficacy as converging for platooning.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于收敛序列和收敛可能性的队列速度决策算法
近年来,人们对智能交通系统(ITS)进行了大量的研究。高速公路上的货车排队问题作为ITS应用的一个重要组成部分被广泛讨论。为了组织队列,需要彼此收敛。然而,由于广域收敛的顺序取决于驾驶员的决策,并且没有收敛的基准速度,因此可能难以实现队列的有效收敛。本文提出了一种排速决策算法,该算法主要由两个部分组成。一个是确定收敛的顺序,另一个是考虑排相关卡车是否能相互收敛。通过计算机仿真,与简单的收敛方法相比,我们实现并评估了我们的命题。结果表明,该方法对队列的收敛有一定的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
From user wishes to system architecture safety for children going to and from school by bus An efficient destination-based data management policy for vehicular networks Joint IP networking and radio architecture for vehicular networks Navigation without GPS: Fake location for mobile phone tracking Analysis of robust collision resolution algorithm with successive interference cancellation and bursty arrivals
×
引用
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