基于车牌识别数据的队列长度估计的概率方法:考虑多车道超车

IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY
Lyuzhou Luo , Hao Wu , Jiahao Liu , Keshuang Tang , Chaopeng Tan
{"title":"基于车牌识别数据的队列长度估计的概率方法:考虑多车道超车","authors":"Lyuzhou Luo ,&nbsp;Hao Wu ,&nbsp;Jiahao Liu ,&nbsp;Keshuang Tang ,&nbsp;Chaopeng Tan","doi":"10.1016/j.trc.2025.105029","DOIUrl":null,"url":null,"abstract":"<div><div>Multi-section license plate recognition (LPR) data has emerged as a valuable source for lane-based queue length estimation, providing both input–output information and sampled travel times. However, existing studies often rely on restrictive assumptions such as the first-in-first-out (FIFO) rule and uniform arrival processes, which fail to capture the complexity of multi-lane scenarios, particularly regarding overtaking behaviors and traffic flow variations. To address this issue, we propose a probabilistic approach to derive the stochastic queue length by constructing a conditional probability model of <em>no-delay arrival time</em> (NAT), i.e., the arrival time of vehicles without experiencing any delay, based on multi-section LPR data. First, the NAT conditions for all vehicles are established based on upstream and downstream vehicle departure times and sequences. To reduce the computational dimensionality and complexity, a dynamic programming (DP)-based algorithm is developed for vehicle group partitioning based on potential interactions between vehicles. Then, the conditional probability of NATs of each vehicle group is derived and a Markov Chain Monte Carlo (MCMC) sampling method is employed for calculation. Subsequently, the stochastic queue profile and maximum queue length for each cycle can be derived based on the NATs of vehicles. Eventually, we extend our approach to multi-lane scenarios, where the problem can be converted to a weighted general exact coverage problem and solved by a backtracking algorithm with heuristics. Empirical and simulation experiments demonstrate that our approach outperforms the baseline method, demonstrating significant improvements in accuracy and robustness across various traffic conditions, including different V/C ratios, matching rates, miss detection rates, and FIFO violation rates. The estimated queue profiles demonstrate practical value for offset optimization in traffic signal control, achieving a 6.63% delay reduction compared to the conventional method.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"173 ","pages":"Article 105029"},"PeriodicalIF":7.6000,"publicationDate":"2025-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A probabilistic approach for queue length estimation using license plate recognition data: Considering overtaking in multi-lane scenarios\",\"authors\":\"Lyuzhou Luo ,&nbsp;Hao Wu ,&nbsp;Jiahao Liu ,&nbsp;Keshuang Tang ,&nbsp;Chaopeng Tan\",\"doi\":\"10.1016/j.trc.2025.105029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Multi-section license plate recognition (LPR) data has emerged as a valuable source for lane-based queue length estimation, providing both input–output information and sampled travel times. However, existing studies often rely on restrictive assumptions such as the first-in-first-out (FIFO) rule and uniform arrival processes, which fail to capture the complexity of multi-lane scenarios, particularly regarding overtaking behaviors and traffic flow variations. To address this issue, we propose a probabilistic approach to derive the stochastic queue length by constructing a conditional probability model of <em>no-delay arrival time</em> (NAT), i.e., the arrival time of vehicles without experiencing any delay, based on multi-section LPR data. First, the NAT conditions for all vehicles are established based on upstream and downstream vehicle departure times and sequences. To reduce the computational dimensionality and complexity, a dynamic programming (DP)-based algorithm is developed for vehicle group partitioning based on potential interactions between vehicles. Then, the conditional probability of NATs of each vehicle group is derived and a Markov Chain Monte Carlo (MCMC) sampling method is employed for calculation. Subsequently, the stochastic queue profile and maximum queue length for each cycle can be derived based on the NATs of vehicles. Eventually, we extend our approach to multi-lane scenarios, where the problem can be converted to a weighted general exact coverage problem and solved by a backtracking algorithm with heuristics. Empirical and simulation experiments demonstrate that our approach outperforms the baseline method, demonstrating significant improvements in accuracy and robustness across various traffic conditions, including different V/C ratios, matching rates, miss detection rates, and FIFO violation rates. The estimated queue profiles demonstrate practical value for offset optimization in traffic signal control, achieving a 6.63% delay reduction compared to the conventional method.</div></div>\",\"PeriodicalId\":54417,\"journal\":{\"name\":\"Transportation Research Part C-Emerging Technologies\",\"volume\":\"173 \",\"pages\":\"Article 105029\"},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2025-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part C-Emerging Technologies\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0968090X25000336\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TRANSPORTATION SCIENCE & TECHNOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part C-Emerging Technologies","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0968090X25000336","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0

摘要

多路段车牌识别(LPR)数据已经成为基于车道的队列长度估计的一个有价值的来源,它提供了输入输出信息和采样的行驶时间。然而,现有的研究往往依赖于限制性的假设,如先进先出(FIFO)规则和统一到达过程,这些假设未能捕捉到多车道场景的复杂性,特别是在超车行为和交通流变化方面。为了解决这一问题,我们提出了一种概率方法,通过构建无延迟到达时间(NAT)的条件概率模型来推导随机队列长度,即基于多段LPR数据的车辆无延迟到达时间。首先,根据上下游车辆的出发时间和出发顺序,建立所有车辆的NAT条件;为了降低计算维数和复杂度,提出了一种基于动态规划的基于车辆间潜在交互的车辆分组算法。然后,推导了各车辆组NATs的条件概率,并采用马尔可夫链蒙特卡罗(MCMC)抽样方法进行了计算。然后,根据车辆的NATs,推导出每个周期的随机队列轮廓和最大队列长度。最后,我们将我们的方法扩展到多车道场景,其中问题可以转换为加权的一般精确覆盖问题,并通过启发式回溯算法解决。经验和仿真实验表明,我们的方法优于基线方法,在各种交通条件下(包括不同的V/C比率、匹配率、缺失检测率和FIFO违规率)的准确性和鲁棒性都有显著提高。估计的队列轮廓在交通信号控制中的偏移优化中具有实用价值,与传统方法相比,延迟减少了6.63%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A probabilistic approach for queue length estimation using license plate recognition data: Considering overtaking in multi-lane scenarios
Multi-section license plate recognition (LPR) data has emerged as a valuable source for lane-based queue length estimation, providing both input–output information and sampled travel times. However, existing studies often rely on restrictive assumptions such as the first-in-first-out (FIFO) rule and uniform arrival processes, which fail to capture the complexity of multi-lane scenarios, particularly regarding overtaking behaviors and traffic flow variations. To address this issue, we propose a probabilistic approach to derive the stochastic queue length by constructing a conditional probability model of no-delay arrival time (NAT), i.e., the arrival time of vehicles without experiencing any delay, based on multi-section LPR data. First, the NAT conditions for all vehicles are established based on upstream and downstream vehicle departure times and sequences. To reduce the computational dimensionality and complexity, a dynamic programming (DP)-based algorithm is developed for vehicle group partitioning based on potential interactions between vehicles. Then, the conditional probability of NATs of each vehicle group is derived and a Markov Chain Monte Carlo (MCMC) sampling method is employed for calculation. Subsequently, the stochastic queue profile and maximum queue length for each cycle can be derived based on the NATs of vehicles. Eventually, we extend our approach to multi-lane scenarios, where the problem can be converted to a weighted general exact coverage problem and solved by a backtracking algorithm with heuristics. Empirical and simulation experiments demonstrate that our approach outperforms the baseline method, demonstrating significant improvements in accuracy and robustness across various traffic conditions, including different V/C ratios, matching rates, miss detection rates, and FIFO violation rates. The estimated queue profiles demonstrate practical value for offset optimization in traffic signal control, achieving a 6.63% delay reduction compared to the conventional method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
15.80
自引率
12.00%
发文量
332
审稿时长
64 days
期刊介绍: Transportation Research: Part C (TR_C) is dedicated to showcasing high-quality, scholarly research that delves into the development, applications, and implications of transportation systems and emerging technologies. Our focus lies not solely on individual technologies, but rather on their broader implications for the planning, design, operation, control, maintenance, and rehabilitation of transportation systems, services, and components. In essence, the intellectual core of the journal revolves around the transportation aspect rather than the technology itself. We actively encourage the integration of quantitative methods from diverse fields such as operations research, control systems, complex networks, computer science, and artificial intelligence. Join us in exploring the intersection of transportation systems and emerging technologies to drive innovation and progress in the field.
×
引用
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学术官方微信