Advertisement
Published in:
12-08-2022
An innovative supervised learning structure for trajectory reconstruction of sparse LPR data
Published in: Transportation | Issue 1/2024
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
The automatic license plate recognition (LPR) system has the advantages of strong continuity, high data accuracy, and large detection samples. The detection data can be used as quasi and full sample sampling of road network vehicles. However, the system has the disadvantage of sparse geographical location, so the data is difficult to be used effectively. In order to obtain the full sample vehicle travel trajectory on an urban road network, this paper investigates the sparse trajectory recovery problem based on LPR data. A trajectory reconstruction algorithm based on the Markov decision process (MDP) in road network space is proposed. The algorithm is divided into two stages, including off-line training and on-line prediction. In the off-line training stage, the LPR data is transformed into the trajectory set represented by the link edge sequence in the road network space. The MDP model is used to describe the vehicle driving behavior, and the design rules of the link reward function in the model are discussed. An unsupervised Bayesian inverse reinforcement learning algorithm is proposed to train the historical vehicle trajectory data and learn the model parameters. In the online prediction stage, the transfer probability between links is calculated according to the trained model. The negative logarithm of the transfer probability modified by the spatio-temporal coefficient is used as the edge weight to construct a directed graph. The shortest path search is used to obtain the path with the highest probability to restore the missing path. The proposed method is implemented on a realistic urban traffic network in Ningbo, China. The comparison with the baseline algorithms indicates that the proposed method has higher accuracy, especially when the coverage rate of the LPR device is low. When the coverage rate is more than 60%, the comprehensive accuracy of the proposed algorithm is more than 85%, and reliable path estimation results can be obtained.