.png){kind=icon}
返回
The observability problem in traffic network models
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1467-8667.2008.00531.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article deals with the problem of observability of traffic networks, understanding as such the problem of identifying which is the subset of OD-pair and link flows that can be calculated based on a subset of observed OD-pair and link flows and related problems. Two algebraic methods for solving the observability problems are given, one global approach based on null-spaces and a step by step procedure allowing updating the information once each item of information (OD-pair or link flow) becomes available. In particular, seven different observability problems are stated and solved using the proposed methods, which are illustrated by their application to the Nguyen-Dupuis network problem. The results show that the proposed methods provide useful information on which OD-pair or link flows are informative on other OD-pair and link flows, and that the methods are applicable to large networks.
Keyword:
ORIGIN-DESTINATION MATRICES
STATE ESTIMATION
IDENTIFICATION
ALGORITHM
LOCATIONS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
9.1
论文数:
2.0K
被引数:
10.0K
机构
引用论文
State estimation observability based on the null space of the measurement Jacobian matrix基于测量雅可比矩阵零空间的状态估计可观测性
PREAI
分享收藏
Influência do pH nas propriedades físico-químicas, térmicas e mecânicas de filmes de poli(vinil álcool)/poli(ácido acrílico)/aciclovir.png)
Química Nova
OAAI
Química NovaIF0
OAAI分享收藏
查看更多内容