اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVarious methods for queue length and traffic volume estimation using probe vehicle trajectories
362
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The rapid development of connected vehicle technology and the emergence of ride-hailing services have enabled the collection of a tremendous amount of probe vehicle trajectory data. Due to the large scale, the trajectory data have become a potential substitute for the widely used fixed-location sensors in terms of the performance measures of transportation networks. Specifically, for traffic volume and queue length estimation, most of the trajectory data based methods in the existing literature either require high market penetration of the probe vehicles to identify the shockwave or require the prior information about the queue length distribution and the penetration rate, which may not be feasible in the real world. To overcome the limitations of the existing methods, this paper proposes a series of novel methods based on probability theory. By exploiting the stopping positions of the probe vehicles in the queues, the proposed methods try to establish and solve a single-variable equation for the penetration rate of the probe vehicles. Once the penetration rate is obtained, it can be used to project the total queue length and the total traffic volume. The validation results using both simulation data and real-world data show that the methods would be accurate enough for assistance in performance measures and traffic signal control at intersections, even when the penetration rate of the probe vehicles is very low.
قيم البحث
اقرأ أيضاً
Due to urbanization and the increase of individual mobility, in most metropolitan areas around the world congestion and inefficient traffic management occur. Highly necessary intelligent traffic control systems, which are able to reduce congestion, r
ely on measurements of traffic situations in urban road networks and freeways. Unfortunately, the instrumentation for accurate traffic measurement is expensive and not widely implemented. This thesis addresses this problem, where relatively inexpensive and easy to install loop-detectors are used by a geometric deep learning algorithm, which uses loop-detector data in a spatial context of a road network, to estimate queue length in front of signalized intersections, which can be then used for following traffic control tasks. Therefore, in the first part of this work a conventional estimation method for queue length (which does not use machine learning techniques) based on second-by-second loop-detector data is implemented, which uses detected shockwaves in queues to estimate the length and point of time for the maximum queue. The method is later used as reference but also as additional input information for the geometric deep learning approach. In the second part the geometric deep learning algorithm is developed, which uses spatial correlations in the road network but also temporal correlations in detector data time sequences by new attention mechanisms, to overcome the limitations of conventional methods like excess traffic demand, lane changing and stop-and-go traffic. Therefore, it is necessary to abstract the topology of the road network in a graph. Both approaches are compared regarding their performance, reliability as well as limitations and validated by usage of the traffic simulation software SUMO (Simulation of Urban MObility). Finally, the results are discussed in the conclusions and further investigations are suggested.
Moderate length of time window can get the best accurate result in detecting the key incident time using extended spectral envelope. This paper presents a method to calculate the moderate length of time window. Two factors are mainly considered: (1)
The significant vertical lines consist of negative elements of eigenvectors; (2) the least amount of interruption. The elements of eigenvectors are transformed into binary variable to eliminate the interruption of positive elements. Sine transform is introduced to highlight the significant vertical lines of negative elements. A novel Quality Index (QI) is proposed to measure the effect of different lengths of time window. Empirical studies on four real traffic incidents in Beijing verify the validity of this method.
Traffic violations like illegal parking, illegal turning, and speeding have become one of the greatest challenges in urban transportation systems, bringing potential risks of traffic congestions, vehicle accidents, and parking difficulties. To maximi
ze the utility and effectiveness of the traffic enforcement strategies aiming at reducing traffic violations, it is essential for urban authorities to infer the traffic violation-prone locations in the city. Therefore, we propose a low-cost, comprehensive, and dynamic framework to infer traffic violation-prone locations in cities based on the large-scale vehicle trajectory data and road environment data. Firstly, we normalize the trajectory data by map matching algorithms and extract key driving behaviors, i.e., turning behaviors, parking behaviors, and speeds of vehicles. Secondly, we restore spatiotemporal contexts of driving behaviors to get corresponding traffic restrictions such as no parking, no turning, and speed restrictions. After matching the traffic restrictions with driving behaviors, we get the traffic violation distribution. Finally, we extract the spatiotemporal patterns of traffic violations, and build a visualization system to showcase the inferred traffic violation-prone locations. To evaluate the effectiveness of the proposed method, we conduct extensive studies on large-scale, real-world vehicle GPS trajectories collected from two Chinese cities, respectively. Evaluation results confirm that the proposed framework infers traffic violation-prone locations effectively and efficiently, providing comprehensive decision supports for traffic enforcement strategies.
Multi-vehicle interaction behavior classification and analysis offer in-depth knowledge to make an efficient decision for autonomous vehicles. This paper aims to cluster a wide range of driving encounter scenarios based only on multi-vehicle GPS traj
ectories. Towards this end, we propose a generic unsupervised learning framework comprising two layers: feature representation layer and clustering layer. In the layer of feature representation, we combine the deep autoencoders with a distance-based measure to map the sequential observations of driving encounters into a computationally tractable space that allows quantifying the spatiotemporal interaction characteristics of two vehicles. The clustering algorithm is then applied to the extracted representations to gather homogeneous driving encounters into groups. Our proposed generic framework is then evaluated using 2,568 naturalistic driving encounters. Experimental results demonstrate that our proposed generic framework incorporated with unsupervised learning can cluster multi-trajectory data into distinct groups. These clustering results could benefit decision-making policy analysis and design for autonomous vehicles.
Recently, an abundant amount of urban vehicle trajectory data has been collected in road networks. Many studies have used machine learning algorithms to analyze patterns in vehicle trajectories to predict location sequences of individual travelers. U
nlike the previous studies that used a discriminative modeling approach, this research suggests a generative modeling approach to learn the underlying distributions of urban vehicle trajectory data. A generative model for urban vehicle trajectories can better generalize from training data by learning the underlying distribution of the training data and, thus, produce synthetic vehicle trajectories similar to real vehicle trajectories with limited observations. Synthetic trajectories can provide solutions to data sparsity or data privacy issues in using location data. This research proposesTrajGAIL, a generative adversarial imitation learning framework for the urban vehicle trajectory generation. In TrajGAIL, learning location sequences in observed trajectories is formulated as an imitation learning problem in a partially observable Markov decision process. The model is trained by the generative adversarial framework, which uses the reward function from the adversarial discriminator. The model is tested with both simulation and real-world datasets, and the results show that the proposed model obtained significant performance gains compared to existing models in sequence modeling.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
