.png){kind=icon}
返回
Modeling measurement errors and missing initial values in freeway dynamic origin-destination estimation systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2006.10.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Most existing dynamic origin-destination (O-D) estimation approaches are grounded on the assumption that a reliable initial O-D set is available and traffic volume data from detectors are accurate. However, in most traffic systems, both types of critical information are either not available or subjected to some level of measurement errors such as traffic counts and speed measurement from sensors. To contend with those critical issues, this study presents two robust algorithms, one for estimation of an initial O-D set and the other for tackling the input measurement errors with an extended estimation algorithm. The core concept of the initial O-D estimation algorithm is to decompose the target network in a number of sub-networks based on proposed rules, and then execute the estimation of the initial O-D set iteratively with the observable information at the first time interval. To contend with the inevitable detector measurement error, this study proposes an interval-based estimation algorithm that converts each model input data as an interval with its boundaries being set based on some prior knowledge. The performance of both proposed algorithms has been tested with a simulated system, the I-95 freeway corridor between I-495 and I-695, and the results are quite promising. (c) 2006 Elsevier Ltd. All rights reserved.
Keyword:
dynamic origin-destination matrix
initial value
interval Kalman filter
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.9
论文数:
4.9K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Estimation of origin-destination matrices from link flows on uncongested networks根据不拥塞网络上的链路流估计起点-目的地矩阵
PREAI
分享收藏
查看更多内容