Skip to main content
Erschienen in: Mobile Networks and Applications 1/2023

22.03.2023

Applying Probabilistic Model Checking to Path Planning for a Smart Multimodal Transportation System Using IoT Sensor Data

verfasst von: Xiaoxian Yang, Yuting Wei, Linxiang Shi, Lin Chen

Erschienen in: Mobile Networks and Applications | Ausgabe 1/2023

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

With the development of artificial intelligence (AI) and the Internet of Things (IoT), public transportation systems in our daily lives are smarter than ever. A large number of wireless sensors are distributed in roadside units (RSUs), collecting traffic flow and public vehicle information to monitor and learn about road congestion, subway arrival, and traffic accidents in real-time. In this paper, we propose probabilistic model checking based path planning for a multimodal transportation system. First, a traffic network with different means of travel is formalized as a directional graph, and the traffic congestion probability is generated from IoT sensor data. Moreover, a discrete-time Markov chain (DTMC) is introduced as the formal model to support quantitative verification. Second, users may have different travel requirements except the shortest path, so user-oriented critical paths are proposed. Then, the minimum cost and the minimum congestion requirements are defined in the form of probabilistic computation tree logic (PCTL) to describe the verification property for evaluating the selected path. We focus on the temporal relations of key points that a user needs to visit to build the travel path. Third, the optimal path is identified and confirmed based on the quantitative results returned by the probabilistic model checker, PRISM, which is a supporting tool that verifies the property against the formal model. Finally, case studies are conducted to demonstrate the feasibility and availability of our proposed method for the smart transportation system.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Weitere Produktempfehlungen anzeigen
Fußnoten
1
https://​github.​com/​cocoasspu/​Applying-Probabilistic-Model-Checking-to-Path-Planningxhttps://​github.​com/​cocoasspu/​Applying-Probabilistic-Model-Checking-to-Path-Planningx
Table 3
Top 5 user-oriented critical paths of the KSP algorithm
ID
Path
Weight
Route 1
s1→s2→s5→s9→s13→s16→s17
6
Route 2
s1→s4→s5→s9→s13→s16→s17
6
Route 3
s1→s4→s8→s9→s13→s16→s17
6
Route 4
s1→s4→s8→s11→s12→s15→s16→s17
7
Route 5
s1→s4→s8→s11→s14→s15→s16→s17
7
 
Literatur
1.
Zurück zum Zitat Chaturvedi M, Srivastava S (2017) Multi-modal design of an intelligent transportation system. IEEE Trans Intell Transp Syst 18(8):2017–2027CrossRef Chaturvedi M, Srivastava S (2017) Multi-modal design of an intelligent transportation system. IEEE Trans Intell Transp Syst 18(8):2017–2027CrossRef
2.
Zurück zum Zitat 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–308 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–308
4.
Zurück zum Zitat 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–200 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–200
5.
Zurück zum Zitat Schafle TR, Uchiyama N (2021) Probabilistic robust path planning for nonholonomic arbitrary-shaped mobile robots using a hybrid a* algorithm. IEEE Access 9:93466–93479CrossRef Schafle TR, Uchiyama N (2021) Probabilistic robust path planning for nonholonomic arbitrary-shaped mobile robots using a hybrid a* algorithm. IEEE Access 9:93466–93479CrossRef
6.
Zurück zum Zitat Gao H, Miao H, Zeng H (2013) Predictive web service monitoring using probabilistic model checking. Appl Math Inf Sci 7(1):139–148MathSciNetCrossRef Gao H, Miao H, Zeng H (2013) Predictive web service monitoring using probabilistic model checking. Appl Math Inf Sci 7(1):139–148MathSciNetCrossRef
7.
Zurück zum Zitat Svorenova M, Kwiatkowska M (2016) Quantitative verification and strategy synthesis for stochastic games. Eur J Control 30:15–30MathSciNetCrossRefMATH Svorenova M, Kwiatkowska M (2016) Quantitative verification and strategy synthesis for stochastic games. Eur J Control 30:15–30MathSciNetCrossRefMATH
8.
Zurück zum Zitat Patle BK, Pandey A, Jagadeesh A, Parhi DR (2018) Path planning in uncertain environment by using firefly algorithm. Defence Technol 14(6):691–701CrossRef Patle BK, Pandey A, Jagadeesh A, Parhi DR (2018) Path planning in uncertain environment by using firefly algorithm. Defence Technol 14(6):691–701CrossRef
9.
Zurück zum Zitat 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–1917CrossRef 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–1917CrossRef
10.
Zurück zum Zitat 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–143 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–143
11.
Zurück zum Zitat 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–200 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–200
12.
Zurück zum Zitat 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–1628MathSciNetMATH 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–1628MathSciNetMATH
13.
Zurück zum Zitat 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–15922CrossRef 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–15922CrossRef
14.
Zurück zum Zitat 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–5649CrossRef 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–5649CrossRef
15.
Zurück zum Zitat Jie KW, Zhao GC, Sun XJ (2019) The shortest path problem and its critical edge in uncertain environment. IEEE Access 7:154414–154423CrossRef Jie KW, Zhao GC, Sun XJ (2019) The shortest path problem and its critical edge in uncertain environment. IEEE Access 7:154414–154423CrossRef
16.
Zurück zum Zitat Sheng Y, Yuan G (2016) Shortest path problem of uncertain random network. Comput Ind Eng 99:97–105CrossRef Sheng Y, Yuan G (2016) Shortest path problem of uncertain random network. Comput Ind Eng 99:97–105CrossRef
17.
Zurück zum Zitat Chatterjee K., De A., Chan FTS (2019) Real time traffic delay optimization using shadowed type-2 fuzzy rule base. Appl Soft Comput 74:226–241CrossRef Chatterjee K., De A., Chan FTS (2019) Real time traffic delay optimization using shadowed type-2 fuzzy rule base. Appl Soft Comput 74:226–241CrossRef
18.
Zurück zum Zitat 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–1970CrossRef 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–1970CrossRef
19.
Zurück zum Zitat 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– 19638CrossRef 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– 19638CrossRef
20.
Zurück zum Zitat Bielli M, Boulmakoul A, Mouncif H (2006) Object modeling and path computation for multimodal travel systems. Eur J Oper Res 175(3):1705–1730CrossRefMATH Bielli M, Boulmakoul A, Mouncif H (2006) Object modeling and path computation for multimodal travel systems. Eur J Oper Res 175(3):1705–1730CrossRefMATH
24.
Zurück zum Zitat 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–27CrossRef 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–27CrossRef
25.
Zurück zum Zitat 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–2380CrossRef 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–2380CrossRef
26.
Zurück zum Zitat Bi K, Han D, Wang JK (2016) Maximum probability attack paths dynamic generation algorithm. Comput Sci Inf Syst 13(2):677–689CrossRef Bi K, Han D, Wang JK (2016) Maximum probability attack paths dynamic generation algorithm. Comput Sci Inf Syst 13(2):677–689CrossRef
28.
Zurück zum Zitat 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–3653 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–3653
29.
Zurück zum Zitat 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–178MathSciNetCrossRefMATH 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–178MathSciNetCrossRefMATH
30.
Zurück zum Zitat Wu C, Zhou S, Xiao L (2020) Dynamic path planning based on improved ant colony algorithm in traffic congestion. IEEE Access 8:180773–180783CrossRef Wu C, Zhou S, Xiao L (2020) Dynamic path planning based on improved ant colony algorithm in traffic congestion. IEEE Access 8:180773–180783CrossRef
31.
Zurück zum Zitat 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–55CrossRef 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–55CrossRef
33.
34.
Zurück zum Zitat 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–1005CrossRefMATH 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–1005CrossRefMATH
Metadaten
Titel
Applying Probabilistic Model Checking to Path Planning for a Smart Multimodal Transportation System Using IoT Sensor Data
verfasst von
Xiaoxian Yang
Yuting Wei
Linxiang Shi
Lin Chen
Publikationsdatum
22.03.2023
Verlag
Springer US
Erschienen in
Mobile Networks and Applications / Ausgabe 1/2023
Print ISSN: 1383-469X
Elektronische ISSN: 1572-8153
DOI
https://doi.org/10.1007/s11036-023-02089-8

Weitere Artikel der Ausgabe 1/2023

Mobile Networks and Applications 1/2023 Zur Ausgabe

Neuer Inhalt