Improved Optimal Path Finding Algorithm of Multistorey Car Park Based on MCP Protocol

To address the urgent issue of car owners wasting a lot of time because they cannot find empty parking spaces in the largely multistorey car park, the paper conceives a solution including algorithm ParkIG. This scheme uses the infrared photoelectric switch to monitor the parking space status. At the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Wireless communications and mobile computing 2022-03, Vol.2022, p.1-9
Hauptverfasser: Liu, Zhendong, Li, Dongyan, Chen, Xi, Lv, Xinrong, Yang, Yurong, Bai, Ke, Qin, Mengying, He, Zhiqiang, Li, Xiaofeng, Dai, Qionghai
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:To address the urgent issue of car owners wasting a lot of time because they cannot find empty parking spaces in the largely multistorey car park, the paper conceives a solution including algorithm ParkIG. This scheme uses the infrared photoelectric switch to monitor the parking space status. At the same time, we define a special communication protocol named MCP to analyze the parking space data when analyzing the data transmitted by the photoelectric switch. Algorithm ParkIG is used in finding the nearest empty parking space and optimal path planning. Based on the MCP protocol and navigation system, the algorithm ParkIG initially identifies the layer of multistorey where the car is positioned. Our algorithm ParkIG greatly reduces the time and space size of the search domain and update domain when searching for vacant parking spaces in optimal path planning and ends the algorithm running to avoid a lot of computations that are not essential when the algorithm found an optimal path from the entrance to empty of parking space. Simulation experiments show that the performance of our scheme has been significantly improved, such as the time that it takes for the car owner to search for a vacant parking space is decreased by about 25.8% and reduced the space size of search domain and update domain by 70% compared to the algorithm Dijkstra.
ISSN:1530-8669
1530-8677
DOI:10.1155/2022/3821414