IDEAS home Printed from https://ideas.repec.org/a/kap/transp/v51y2024i1d10.1007_s11116-022-10320-w.html
   My bibliography  Save this article

An innovative supervised learning structure for trajectory reconstruction of sparse LPR data

Author

Listed:
  • Wenhao Li

    (Southeast University
    Northern Arizona University)

  • Chengkun Liu

    (Guilin University of Electronic Technology)

  • Tao Wang

    (Guilin University of Electronic Technology)

  • Yanjie Ji

    (Southeast University)

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.

Suggested Citation

  • Wenhao Li & Chengkun Liu & Tao Wang & Yanjie Ji, 2024. "An innovative supervised learning structure for trajectory reconstruction of sparse LPR data," Transportation, Springer, vol. 51(1), pages 73-97, February.
    • Handle: RePEc:kap:transp:v:51:y:2024:i:1:d:10.1007_s11116-022-10320-w
    DOI: 10.1007/s11116-022-10320-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11116-022-10320-w
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11116-022-10320-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Erdem Ozdemir & Ahmet E. Topcu & Mehmet Kemal Ozdemir, 2018. "A hybrid HMM model for travel path inference with sparse GPS samples," Transportation, Springer, vol. 45(1), pages 233-246, January.
    2. Fosgerau, Mogens & Frejinger, Emma & Karlstrom, Anders, 2013. "A link based network route choice model with unrestricted choice set," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 70-80.
    3. Peng, Zixuan & Shan, Wenxuan & Guan, Feng & Yu, Bin, 2016. "Stable vessel-cargo matching in dry bulk shipping market with price game mechanism," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 76-94.
    4. Haiyang Yu & Shuai Yang & Zhihai Wu & Xiaolei Ma, 2018. "Vehicle trajectory reconstruction from automatic license plate reader data," International Journal of Distributed Sensor Networks, , vol. 14(2), pages 15501477187, February.
    5. Sherali, Hanif D. & Desai, Jitamitra & Rakha, Hesham, 2006. "A discrete optimization approach for locating Automatic Vehicle Identification readers for the provision of roadway travel times," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 857-871, December.
    6. Liu, Qingchao & Cai, Yingfeng & Jiang, Haobin & Lu, Jian & Chen, Long, 2018. "Traffic state prediction using ISOMAP manifold learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 532-541.
    7. Amir H. Shahpar & Hedayat Z. Aashtiani & Ardeshir Faghri, 2011. "Development of a delay model for unsignalized intersections applicable to traffic assignment," Transportation Planning and Technology, Taylor & Francis Journals, vol. 34(5), pages 497-507, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xing, Tao & Zhou, Xuesong & Taylor, Jeffrey, 2013. "Designing heterogeneous sensor networks for estimating and predicting path travel time dynamics: An information-theoretic modeling approach," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 66-90.
    2. Saif Eddin Jabari & Laura Wynter, 2016. "Sensor placement with time-to-detection guarantees," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 415-433, December.
    3. Mogens Fosgerau & Mads Paulsen & Thomas Kj{ae}r Rasmussen, 2021. "A perturbed utility route choice model," Papers 2103.13784, arXiv.org, revised Sep 2021.
    4. Mai, Tien & Frejinger, Emma & Bastin, Fabian, 2015. "A misspecification test for logit based route choice models," Economics of Transportation, Elsevier, vol. 4(4), pages 215-226.
    5. Tien Mai & The Viet Bui & Quoc Phong Nguyen & Tho V. Le, 2022. "Estimation of Recursive Route Choice Models with Incomplete Trip Observations," Papers 2204.12992, arXiv.org.
    6. Meyer de Freitas, Lucas & Becker, Henrik & Zimmermann, Maëlle & Axhausen, Kay W., 2019. "Modelling intermodal travel in Switzerland: A recursive logit approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 119(C), pages 200-213.
    7. Longsheng Sun & Mark H. Karwan & Changhyun Kwon, 2018. "Generalized Bounded Rationality and Robust Multicommodity Network Design," Operations Research, INFORMS, vol. 66(1), pages 42-57, 1-2.
    8. Blom Västberg, Oskar & Karlström, Anders & Jonsson, Daniel & Sundberg, Marcus, 2016. "Including time in a travel demand model using dynamic discrete choice," MPRA Paper 75336, University Library of Munich, Germany, revised 11 Nov 2016.
    9. Urena Serulle, Nayel & Cirillo, Cinzia, 2017. "The optimal time to evacuate: A behavioral dynamic model on Louisiana resident data," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 447-463.
    10. Yao, Rui & Bekhor, Shlomo, 2022. "A variational autoencoder approach for choice set generation and implicit perception of alternatives in choice modeling," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 273-294.
    11. Oka, Hideki & Hagino, Yasukatsu & Kenmochi, Takeshi & Tani, Ryota & Nishi, Ryuta & Endo, Kotaro & Fukuda, Daisuke, 2019. "Predicting travel pattern changes of freight trucks in the Tokyo Metropolitan area based on the latest large-scale urban freight survey and route choice modeling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 305-324.
    12. Liu, Shan & Jiang, Hai & Chen, Shuiping & Ye, Jing & He, Renqing & Sun, Zhizhao, 2020. "Integrating Dijkstra’s algorithm into deep inverse reinforcement learning for food delivery route planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    13. Saxena, N. & Rashidi, T.H. & Dixit, V.V. & Waller, S.T., 2019. "Modelling the route choice behaviour under stop-&-go traffic for different car driver segments," Transportation Research Part A: Policy and Practice, Elsevier, vol. 119(C), pages 62-72.
    14. Peng, Zixuan & Shan, Wenxuan & Zhu, Xiaoning & Yu, Bin, 2022. "Many-to-one stable matching for taxi-sharing service with selfish players," Transportation Research Part A: Policy and Practice, Elsevier, vol. 160(C), pages 255-279.
    15. Cortés, Cristián E. & Donoso, Pedro & Gutiérrez, Leonel & Herl, Daniel & Muñoz, Diego, 2023. "A recursive stochastic transit equilibrium model estimated using passive data from Santiago, Chile," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    16. Xu, Xin-yue & Liu, Jun & Li, Hai-ying & Jiang, Man, 2016. "Capacity-oriented passenger flow control under uncertain demand: Algorithm development and real-world case study," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 130-148.
    17. Evanthia Kazagli & Michel Bierlaire & Matthieu de Lapparent, 2020. "Operational route choice methodologies for practical applications," Transportation, Springer, vol. 47(1), pages 43-74, February.
    18. Choi, Tsan-Ming & Chung, Sai-Ho & Zhuo, Xiaopo, 2020. "Pricing with risk sensitive competing container shipping lines: Will risk seeking do more good than harm?," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 210-229.
    19. Kazagli, Evanthia & Bierlaire, Michel & Flötteröd, Gunnar, 2016. "Revisiting the route choice problem: A modeling framework based on mental representations," Journal of choice modelling, Elsevier, vol. 19(C), pages 1-23.
    20. Mai, Tien & Yu, Xinlian & Gao, Song & Frejinger, Emma, 2021. "Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 151(C), pages 42-58.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:transp:v:51:y:2024:i:1:d:10.1007_s11116-022-10320-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.