Research on sensor location problem based on connected and automated vehicles

2021 ◽  
Author(s):  
Lixin Chen
2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Minhua Shao ◽  
Lijun Sun ◽  
Xianzhi Shao

The sensor location problem (SLP) discussed in this paper is to find the minimum number and optimum locations of the flow counting points in the road network so that the traffic flows over the whole network can be inferred uniquely. Flow conservation system at intersections is formulated firstly using the turning ratios as the prior information. Then the coefficient matrix of the flow conservation system is proved to be nonsingular. Based on that, the minimal number of counting points is determined to be the total number of exclusive incoming roads and dummy roads, which are added to the network to represent the trips generated on real roads. So the task of SLP model based on turning ratios is just to determine the optimal sensor locations. The following analysis in this paper shows that placing sensors on all the exclusive incoming roads and dummy roads can always generate a unique network flow vector for any network topology. After that, a detection set composed of only real roads is proven to exist from the view of feasibility in reality. Finally, considering the roads importance and cost of the sensors, a weighted SLP model is formulated to find the optimal detection set. The greedy algorithm is proven to be able to provide the optimal solution for the proposed weighted SLP model.


2020 ◽  
Vol 150 ◽  
pp. 106827 ◽  
Author(s):  
Victor Hugo Souza de Abreu ◽  
Pedro Henrique González ◽  
Geraldo Regis Mauri ◽  
Glaydston Mattos Ribeiro ◽  
Romulo Dante Orrico ◽  
...  

Transport ◽  
2017 ◽  
Vol 32 (2) ◽  
pp. 113-119 ◽  
Author(s):  
Evangelos Mitsakis ◽  
Evangelia Chrysohoou ◽  
Josep Maria Salanova Grau ◽  
Panagiotis Iordanopoulos ◽  
Georgia Aifadopoulou

The sensor location problem is of particular importance when planning the allocation of limited field equipment intended to be used for advanced traffic management systems and traveller information services. The locations within a network that satisfy specific goals need to be carefully selected, based on predefined goals related to the effective collection of data and the subsequent estimation of traffic related information. The detection of traffic volumes is mainly associated with two purposes, the travel time and the Origin–Destination (O–D) trip matrix estimation. In this context, this paper presents a quadratic programing model, able to determine the optimal location of tracking sensors. The model is implemented in the urban road network of the city of Thessaloniki (Greece) in which specific number of sensors is installed and utilized for real-time travel time information provision. The proposed methodology models the sensor location problem under the general framework of a set covering problem, which is one of the most popular optimization problems and has been applied in many industrial problems. The results of the case study in Thessaloniki reveal that the proposed model defines the optimal location of the limited number of sensors in such a way that the network, which is created having all sensors as origin or destination of all possible paths, represents to great extent (87% of the traffic flow along the major paths) the traffic volumes of the whole road network of the city.


Automatica ◽  
2008 ◽  
Vol 44 (8) ◽  
pp. 2074-2080 ◽  
Author(s):  
Christian Commault ◽  
Jean-Michel Dion ◽  
Sameh Yacoub Agha

Sign in / Sign up

Export Citation Format

Share Document