Highlights ► The full and partial link flow observability problems are generalized. ► Efficient solution algorithm that does not require path enumeration is presented. ► Real-world instances now become practical and computationally feasible. ► Interesting numerical insights into a new problem are presented.
Abstract Recently, a new methodology (“synergistic sensor location”) has been introduced to efficiently determine all link flows in a road network by using only a subset of the link flow measurements. In this paper, we generalize this previous work by solving the following problem: Suppose that one is only interested in a subset of the link flows, and that certain link flows are known a priori. At a minimum, what link flows are needed to be able to uniquely determine the desired link flows? An algorithm is presented that does not require the need for path enumeration.
Partial link flow observability in the presence of initial sensors: Solution without path enumeration
2012-10-23
5 pages
Article (Journal)
Electronic Resource
English
Link observability without path enumeration: A revisit
IEEE | 2012
|Synergistic sensor location for link flow inference without path enumeration: A node-based approach
Online Contents | 2012
|Non-planar hole-generated networks and link flow observability based on link counters
Online Contents | 2014
|