Automated Parking System using Graph Algorithm

Abstract

The system proposed in this paper aims to reduce time complexity while parking vehicles in automated parking systems through the generation of an algorithm and subsequent code using Breadth First Search (BFS). The proposed system utilizes the mechanism of the BFS algorithm which is such that it enables nodes to be traversed breadthwise in graph data structures. This proposed algorithm is supported by mathematical analyses and study of existing automated parking systems. The premise of the study is rooted in the growing global population and, consequently, the tumultuous increase in the number of vehicles worldwide. Despite the surge in number of vehicles, owners are troubled by a myriad of problems owing to most parking systems being manual. With this in view, it is imperative that people have proper parking systems which ensure that they can park their vehicles efficiently while not having to concede the opportunity of receiving proper security facilities. Although in recent years there are many automated parking system concepts that have been proposed, not all such automated parking system concepts are efficient. In order to establish the algorithm, calculations of several aspects of prior existing models were compared. On the basis of the analyses, this paper proposes a system which will help people to find empty parking spaces with the least time complexity along with also proposing actions to take during emergency cases.