首页> 外文期刊>Journal of Intelligent Transportation Systems >Fuzing license plate recognition data and vehicle trajectory data for lane-based queue length estimation at signalized intersections
【24h】

Fuzing license plate recognition data and vehicle trajectory data for lane-based queue length estimation at signalized intersections

机译:在信号交叉口的基于车道的队列长度估计的uuzing牌照识别数据和车辆轨迹数据

获取原文
获取原文并翻译 | 示例
           

摘要

Queue length is one of the most important performance measures for signalized intersections. With recent advancements in connected vehicles and intelligent mobility technologies, utilizing vehicle trajectory data to estimate queue length has received considerable attentions. However, most of the existing methods are based on some assumptions, such as known arrival patterns and/or high penetration rates. Besides, existing models would probably be unstable or invalid under sparse trajectory environment. Hence, license plate recognition (LPR) data is introduced in this study to fuze with the vehicle trajectory data, and then, a lane-based queue length estimation method is proposed. First, by matching the LPR data with probe vehicle data, the two-dimensional probability density distribution of discharge headway and stop-line crossing time of various kinds of vehicles, i.e., queued and nonqueued vehicle for undersaturated condition and twice-queued and once-queued vehicle for oversaturated condition, can be calibrated. Then, the Bayesian theory is adopted to derive the lane-based queue length for undersaturated condition as well as the initial queue for oversaturated condition with the largest possibility, respectively. Where probe vehicle trajectories, if existed, will provide the boundaries for the estimated queue lengths. Finally, the performance of the proposed method is evaluated using both simulation and empirical data. Simulation results show that the proposed method could produce accurate estimates of queue lengths for both undersaturated and oversaturated conditions and can achieve reliable estimates even under low penetration rate (3%). Empirical results show that the proposed method outperforms an existing method using probe vehicle trajectories only.
机译:队列长度是信号交叉口最重要的性能措施之一。随着最近连接的车辆和智能移动技术的进步,利用车辆轨迹数据来估计队列长度已得到相当大的关注。然而,大多数现有方法基于一些假设,例如已知的到达模式和/或高穿透率。此外,在稀疏轨迹环境下,现有模型可能是不稳定或无效的。因此,在本研究中引入了许可证板识别(LPR)数据,以引发车辆轨迹数据,然后提出了一种基于车道的队列长度估计方法。首先,通过将LPR数据与探测车辆数据匹配,排出头路的二维概率密度分布和各种车辆的停止线路交叉时间,即排队和非水性载体的欠饱和条件和两次排队和一次 - 排队车辆用于过度饱和条件,可以校准。然后,采用贝叶斯理论用于推导出基于车道的队列长度,以分别具有不饱和条件的基于车道的队列长度以及具有最大可能性的过饱和条件的初始排队。如果存在探测器轨迹,如果存在,则为估计的队列长度提供边界。最后,使用模拟和经验数据评估所提出的方法的性能。仿真结果表明,该方法可以为不饱和和过饱和条件产生准确的队列长度估计,并且即使在低渗透率(3%)也可以实现可靠的估计。经验结果表明,该方法仅突出了使用探头车辆轨迹的现有方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号