关键词: 智能交通, 检测器布局, 数形结合, 检测器, 流量守恒, 路段可检测性

Abstract:

To obtain the traffic flows on the uninstalled links, an algebraic and graphic combinational approach to determining the optimal sensor locations is proposed. Firstly, based on the connection between the topological structure of traffic network and the algebraic adjacent matrix, the definitions of the equilibrium matrix and the basic balance matrix are presented. Secondly, based on the property of the basic balance matrix, an invertible matrix whose order is one less than the number of nodes can be found out. The set of links corresponding to the above invertible matrix forms a spanning tree of the traffic network. All the links in the spanning tree need not to install sensors. At last, according to the flow conservation principle, the traffic flows on all the uninstalled links can be deduced quickly and accurately through matrix operations. The new method uncovers the algebraic and graphic connections among the link flows and avoids the complexity due to the independent application of algebraic or graphic method. The feasibility and effectiveness of this new method is verified by numerical analysis

Key words: intelligent transportation, sensor location, algebraic and graphic combination, sensor, flow conservation, link observability