使用计算机视觉和相扑的交通管理

Bodicherla Digvijay Sri Sai, Ramisetty Nikhil, Payarda Santosh Babu, Nenavath Srinivas Naik
{"title":"使用计算机视觉和相扑的交通管理","authors":"Bodicherla Digvijay Sri Sai, Ramisetty Nikhil, Payarda Santosh Babu, Nenavath Srinivas Naik","doi":"10.1109/INDICON52576.2021.9691665","DOIUrl":null,"url":null,"abstract":"Traffic signals play a crucial role in the transportation system. They guarantee a safe drive at the road intersections. Traffic signals reduces traffic flow as the traditional signal scheduling gives green light to each direction for a predetermined time. In traditional signal scheduling, Green signal is allocated to all directions, one after another. If there is heavy traffic in one direction and less in another, Traditional scheduling method does not show any bias among them. This results in over traffic accumulation and traffic congestion at the road intersections. To give priority to the directions that has the maximum vehicle count, we propose an algorithm. The proposed algorithm takes vehicle count of all directions into consideration and gives immediate attention to direction where traffic is getting accumulated. The signal allocation does not only consider vehicle count. It is done in such a way that no direction gets to wait too long. Hence, the algorithm we propose gives equal importance to both Traffic density and Waiting Time. Moreover, it aims to minimize total waiting time of all the vehicles. We performed various experiments, from the obtained results, we were able to highly reduce the overall waiting time of vehicles in all directions.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Traffic Management using Computer Vision and SUMO\",\"authors\":\"Bodicherla Digvijay Sri Sai, Ramisetty Nikhil, Payarda Santosh Babu, Nenavath Srinivas Naik\",\"doi\":\"10.1109/INDICON52576.2021.9691665\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traffic signals play a crucial role in the transportation system. They guarantee a safe drive at the road intersections. Traffic signals reduces traffic flow as the traditional signal scheduling gives green light to each direction for a predetermined time. In traditional signal scheduling, Green signal is allocated to all directions, one after another. If there is heavy traffic in one direction and less in another, Traditional scheduling method does not show any bias among them. This results in over traffic accumulation and traffic congestion at the road intersections. To give priority to the directions that has the maximum vehicle count, we propose an algorithm. The proposed algorithm takes vehicle count of all directions into consideration and gives immediate attention to direction where traffic is getting accumulated. The signal allocation does not only consider vehicle count. It is done in such a way that no direction gets to wait too long. Hence, the algorithm we propose gives equal importance to both Traffic density and Waiting Time. Moreover, it aims to minimize total waiting time of all the vehicles. We performed various experiments, from the obtained results, we were able to highly reduce the overall waiting time of vehicles in all directions.\",\"PeriodicalId\":106004,\"journal\":{\"name\":\"2021 IEEE 18th India Council International Conference (INDICON)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 18th India Council International Conference (INDICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDICON52576.2021.9691665\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 18th India Council International Conference (INDICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDICON52576.2021.9691665","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

交通信号在交通系统中起着至关重要的作用。它们保证在十字路口行车安全。传统的信号调度方法是在预定时间内给各个方向开绿灯,从而减少交通流量。在传统的信号调度中,绿色信号被依次分配到各个方向。当一个方向的交通流量大,而另一个方向的交通流量少时,传统的调度方法不会显示出它们之间的偏差。这就造成了交通的过度积聚和十字路口的交通堵塞。为了优先考虑车辆数量最多的方向,我们提出了一种算法。该算法考虑了各个方向的车辆数量,并立即关注交通聚集的方向。信号分配不单单考虑车辆数量。它是这样做的,没有方向等待太久。因此,我们提出的算法对交通密度和等待时间同等重要。此外,它的目标是最小化所有车辆的总等待时间。我们进行了各种实验,从得到的结果来看,我们能够大大减少各个方向车辆的总体等待时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Traffic Management using Computer Vision and SUMO
Traffic signals play a crucial role in the transportation system. They guarantee a safe drive at the road intersections. Traffic signals reduces traffic flow as the traditional signal scheduling gives green light to each direction for a predetermined time. In traditional signal scheduling, Green signal is allocated to all directions, one after another. If there is heavy traffic in one direction and less in another, Traditional scheduling method does not show any bias among them. This results in over traffic accumulation and traffic congestion at the road intersections. To give priority to the directions that has the maximum vehicle count, we propose an algorithm. The proposed algorithm takes vehicle count of all directions into consideration and gives immediate attention to direction where traffic is getting accumulated. The signal allocation does not only consider vehicle count. It is done in such a way that no direction gets to wait too long. Hence, the algorithm we propose gives equal importance to both Traffic density and Waiting Time. Moreover, it aims to minimize total waiting time of all the vehicles. We performed various experiments, from the obtained results, we were able to highly reduce the overall waiting time of vehicles in all directions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信