{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T03:31:20Z","timestamp":1770607880643,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902236"],"award-info":[{"award-number":["61902236"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11036-023-02089-8","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T03:18:39Z","timestamp":1679887119000},"page":"382-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Applying Probabilistic Model Checking to Path Planning for a Smart Multimodal Transportation System Using IoT Sensor Data"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0945-4194","authenticated-orcid":false,"given":"Xiaoxian","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuting","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linxiang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,22]]},"reference":[{"issue":"8","key":"2089_CR1","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1109\/TITS.2016.2631221","volume":"18","author":"M Chaturvedi","year":"2017","unstructured":"Chaturvedi M, Srivastava S (2017) Multi-modal design of an intelligent transportation system. IEEE Trans Intell Transp Syst 18(8):2017\u20132027","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2089_CR2","doi-asserted-by":"crossref","unstructured":"Rakkesh ST, Weerasinghe AR, Ranasinghe RAC (2016) Effective urban transport planning using multi-modal traffic simulations approach. In: 2016 Moratuwa engineering research conference, pp 303\u2013308","DOI":"10.1109\/MERCon.2016.7480158"},{"issue":"3","key":"2089_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1080\/10798587.2016.12201","volume":"23","author":"P Chinnasamy","year":"2016","unstructured":"Chinnasamy P., J P, K L, D VA (2016) Region based find and spray scheme for co-operative data communication in vehicular cyber-physical systems. Intell Autom Soft Comput 23(3):501\u2013507. https:\/\/doi.org\/10.1080\/10798587.2016.12201","journal-title":"Intell Autom Soft Comput"},{"issue":"2","key":"2089_CR4","first-page":"189","volume":"16","author":"JR Chang","year":"2015","unstructured":"Chang JR, Jheng YH, Chang CH, Lo CH (2015) An efficient algorithm for vehicle guidance combining Dijkstra and a algorithm with fuzzy inference theory. J Internet Technol 16(2):189\u2013200","journal-title":"J Internet Technol"},{"key":"2089_CR5","doi-asserted-by":"publisher","first-page":"93466","DOI":"10.1109\/ACCESS.2021.3093471","volume":"9","author":"TR Schafle","year":"2021","unstructured":"Schafle TR, Uchiyama N (2021) Probabilistic robust path planning for nonholonomic arbitrary-shaped mobile robots using a hybrid a* algorithm. IEEE Access 9:93466\u201393479","journal-title":"IEEE Access"},{"issue":"1","key":"2089_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.12785\/amis\/071L20","volume":"7","author":"H Gao","year":"2013","unstructured":"Gao H, Miao H, Zeng H (2013) Predictive web service monitoring using probabilistic model checking. Appl Math Inf Sci 7(1):139\u2013148","journal-title":"Appl Math Inf Sci"},{"key":"2089_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejcon.2016.04.009","volume":"30","author":"M Svorenova","year":"2016","unstructured":"Svorenova M, Kwiatkowska M (2016) Quantitative verification and strategy synthesis for stochastic games. Eur J Control 30:15\u201330","journal-title":"Eur J Control"},{"issue":"6","key":"2089_CR8","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/j.dt.2018.06.004","volume":"14","author":"BK Patle","year":"2018","unstructured":"Patle BK, Pandey A, Jagadeesh A, Parhi DR (2018) Path planning in uncertain environment by using firefly algorithm. Defence Technol 14(6):691\u2013701","journal-title":"Defence Technol"},{"issue":"4","key":"2089_CR9","doi-asserted-by":"publisher","first-page":"1907","DOI":"10.1109\/TITS.2013.2270282","volume":"14","author":"BY Chen","year":"2013","unstructured":"Chen BY, Lam WHK, Li Q, Sumalee A, Yan K (2013) Shortest path finding problem in stochastic time-dependent road networks with stochastic first-in-first-out property. IEEE Trans Intell Transp Syst 14(4):1907\u20131917","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2089_CR10","doi-asserted-by":"crossref","unstructured":"Zhu L, Liu Q, Gao C, Wang J (2014) Research and realization of KTH path planning algorithm under large-scale data which meets the requirement for repeatability. In: 2014 seventh international symposium on computational intelligence & design, pp 138\u2013143","DOI":"10.1109\/ISCID.2014.148"},{"issue":"2","key":"2089_CR11","first-page":"189","volume":"16","author":"JR Chang","year":"2015","unstructured":"Chang JR, Jheng YH, Chang CH, Lo CH (2015) An Efficient Algorithm For Vehicle Guidance Combining Dijkstra and a algorithm with fuzzy inference theory. J Internet Technol 16(2):189\u2013200","journal-title":"J Internet Technol"},{"issue":"5","key":"2089_CR12","first-page":"1619","volume":"32","author":"S Zhang","year":"2018","unstructured":"Zhang S, Liu X, Wang M (2018) A novel ant colony optimization algorithm for the shortest-path problem in traffic networks. Autom Control Comput Sci 32(5):1619\u20131628","journal-title":"Autom Control Comput Sci"},{"issue":"1","key":"2089_CR13","doi-asserted-by":"publisher","first-page":"15907","DOI":"10.1109\/ACCESS.2020.2966995","volume":"1","author":"N Sun","year":"2020","unstructured":"Sun N, Shi H, Han G, Wang B, Shu L (2020) Dynamic path planning algorithms with load balancing based on data prediction for smart transportation systems. IEEE Access 1(1):15907\u201315922","journal-title":"IEEE Access"},{"issue":"7","key":"2089_CR14","doi-asserted-by":"publisher","first-page":"5635","DOI":"10.1109\/TVT.2018.2806979","volume":"67","author":"C Guo","year":"2018","unstructured":"Guo C, Li D, Zhang G, Zhai M (2018) Real-time path planning in urban area via VANET-assisted traffic information sharing. IEEE Trans Veh Technol 67(7):5635\u20135649","journal-title":"IEEE Trans Veh Technol"},{"key":"2089_CR15","doi-asserted-by":"publisher","first-page":"154414","DOI":"10.1109\/ACCESS.2019.2948958","volume":"7","author":"KW Jie","year":"2019","unstructured":"Jie KW, Zhao GC, Sun XJ (2019) The shortest path problem and its critical edge in uncertain environment. IEEE Access 7:154414\u2013154423","journal-title":"IEEE Access"},{"key":"2089_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cie.2016.07.011","volume":"99","author":"Y Sheng","year":"2016","unstructured":"Sheng Y, Yuan G (2016) Shortest path problem of uncertain random network. Comput Ind Eng 99:97\u2013105","journal-title":"Comput Ind Eng"},{"key":"2089_CR17","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.asoc.2018.10.008","volume":"74","author":"K Chatterjee","year":"2019","unstructured":"Chatterjee K., De A., Chan FTS (2019) Real time traffic delay optimization using shadowed type-2 fuzzy rule base. Appl Soft Comput 74:226\u2013241","journal-title":"Appl Soft Comput"},{"issue":"11","key":"2089_CR18","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1017\/S0263574719000377","volume":"37","author":"XY Yu","year":"2019","unstructured":"Yu XY, Fan ZY, Ou LL, Zhu F, Guo YK (2019) Optimal path planning satisfying complex task requirement in uncertain environment. Robotica 37(11):1956\u20131970","journal-title":"Robotica"},{"key":"2089_CR19","doi-asserted-by":"publisher","first-page":"19632","DOI":"10.1109\/ACCESS.2021.3052865","volume":"9","author":"L Liu","year":"2021","unstructured":"Liu L, Yao J, He D, Chen J, Guo J (2021) Global dynamic path planning fusion algorithm combining jump-A* algorithm and dynamic window approach. IEEE Access 9:19632\u2013 19638","journal-title":"IEEE Access"},{"issue":"3","key":"2089_CR20","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1016\/j.ejor.2005.02.036","volume":"175","author":"M Bielli","year":"2006","unstructured":"Bielli M, Boulmakoul A, Mouncif H (2006) Object modeling and path computation for multimodal travel systems. Eur J Oper Res 175(3):1705\u20131730","journal-title":"Eur J Oper Res"},{"issue":"6","key":"2089_CR21","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.3390\/su12062435","volume":"12","author":"Y Yang","year":"2020","unstructured":"Yang Y, Chen J, Du Z (2020) Analysis of the passenger flow transfer capacity of a bus-subway transfer hub in an urban multi-mode transportation network. Sustainability 12(6):2435. https:\/\/doi.org\/10.3390\/su12062435","journal-title":"Sustainability"},{"key":"2089_CR22","doi-asserted-by":"publisher","first-page":"107154","DOI":"10.1016\/j.ast.2021.107154","volume":"119","author":"W Dai","year":"2021","unstructured":"Dai W, Pang B, Low KH (2021) Conflict-free four-dimensional path planning for urban air mobility considering airspace occupancy. Aerosp Sci Technol 119:107154. https:\/\/doi.org\/10.1016\/j.ast.2021.107154","journal-title":"Aerosp Sci Technol"},{"key":"2089_CR23","doi-asserted-by":"publisher","first-page":"107302","DOI":"10.1016\/j.cie.2021.107302","volume":"157","author":"M Davoodi","year":"2021","unstructured":"Davoodi M, Ghaffari M (2021) Shortest path problem on uncertain networks: An efficient two phases approach. Comput Ind Engi 157:107302. https:\/\/doi.org\/10.1016\/j.cie.2021.107302","journal-title":"Comput Ind Engi"},{"issue":"1","key":"2089_CR24","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s40747-020-00143-6","volume":"7","author":"X Liao","year":"2021","unstructured":"Liao X, Wang JY, Ma L (2021) An algorithmic approach for finding the fuzzy constrained shortest paths in a fuzzy graph. Complex Intell Syst 7(1):17\u201327","journal-title":"Complex Intell Syst"},{"issue":"8","key":"2089_CR25","doi-asserted-by":"publisher","first-page":"2367","DOI":"10.1109\/TITS.2016.2521779","volume":"17","author":"G Kim","year":"2016","unstructured":"Kim G, Ong YS, Cheong T, Tan PS (2016) Solving the dynamic vehicle routing problem under traffic congestion. IEEE Trans Intell Transp Syst 17(8):2367\u20132380","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"2","key":"2089_CR26","doi-asserted-by":"publisher","first-page":"677","DOI":"10.2298\/CSIS160227022B","volume":"13","author":"K Bi","year":"2016","unstructured":"Bi K, Han D, Wang JK (2016) Maximum probability attack paths dynamic generation algorithm. Comput Sci Inf Syst 13(2):677\u2013689","journal-title":"Comput Sci Inf Syst"},{"key":"2089_CR27","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1186\/s40064-016-3180-7","volume":"5","author":"GH Shirdel","year":"2016","unstructured":"Shirdel GH, Abdolhosseinzadeh M (2016) The shortest path problem in the stochastic networks with unstable topology. SpringerPlus 5:1529. https:\/\/doi.org\/10.1186\/s40064-016-3180-7","journal-title":"SpringerPlus"},{"issue":"6","key":"2089_CR28","first-page":"3635","volume":"25","author":"D Veysmoradi","year":"2018","unstructured":"Veysmoradi D, Vahdani B, Sartangi MF, Mousavi SM (2018) Multi-objective open location-routing model for relief distribution networks with split delivery and multi-mode transportation under uncertainty. Sci Iran 25(6):3635\u20133653","journal-title":"Sci Iran"},{"issue":"1","key":"2089_CR29","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00186-020-00729-3","volume":"93","author":"P Buchholz","year":"2020","unstructured":"Buchholz P, Dohndorf I (2020) A multi-objective approach for PH-graphs with applications to stochastic shortest paths. Math Methods Oper Res 93(1):153\u2013178","journal-title":"Math Methods Oper Res"},{"key":"2089_CR30","doi-asserted-by":"publisher","first-page":"180773","DOI":"10.1109\/ACCESS.2020.3028467","volume":"8","author":"C Wu","year":"2020","unstructured":"Wu C, Zhou S, Xiao L (2020) Dynamic path planning based on improved ant colony algorithm in traffic congestion. IEEE Access 8:180773\u2013180783","journal-title":"IEEE Access"},{"issue":"6","key":"2089_CR31","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MWC.001.1900151","volume":"26","author":"A Ahmad","year":"2019","unstructured":"Ahmad A, Din S, Paul A, Jeon G, Ahmad M (2019) Real-time route planning and data dissemination for urban scenarios using the Internet of Things. IEEE Wirel Commun 26(6):50\u201355","journal-title":"IEEE Wirel Commun"},{"issue":"12","key":"2089_CR32","doi-asserted-by":"publisher","first-page":"4275","DOI":"10.3390\/s18124275","volume":"18","author":"D Zhu","year":"2018","unstructured":"Zhu D, Du H, Sun Y (2018) Research on path planning model based on short-term traffic flow prediction in intelligent transportation system. Sensors 18(12):4275. https:\/\/doi.org\/10.3390\/s18124275","journal-title":"Sensors"},{"issue":"2","key":"2089_CR33","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein D (1998) SIAM. Finding the K shortest paths. SIAM J Comput 28(2):652\u2013673","journal-title":"SIAM J Comput"},{"issue":"2","key":"2089_CR34","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/s00500-020-05194-y","volume":"25","author":"P Kumar","year":"2021","unstructured":"Kumar P, Dudeja C (2021) Shadowed type 2 fuzzy-based Markov model to predict shortest path with optimized waiting time. Soft Comput 25(2):995\u20131005","journal-title":"Soft Comput"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-023-02089-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11036-023-02089-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-023-02089-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T20:49:51Z","timestamp":1694119791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11036-023-02089-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["2089"],"URL":"https:\/\/doi.org\/10.1007\/s11036-023-02089-8","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]},"assertion":[{"value":"22 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}