A service for finding free parking spaces
Students Name: Salamakha Oleksandr Ihorovych
Qualification Level: magister
Speciality: Computer Systems and Networks
Institute: Institute of Computer Technologies, Automation and Metrology
Mode of Study: full
Academic Year: 2020-2021 н.р.
Language of Defence: ukrainian
Abstract: This master’s qualification work, service has been developed for a quick and convenient search for free parking spaces. The goal is to create an application that, using access to a database and GPS tools, will allow the user to find the most convenient and shortest way to park their car. The development of the structural scheme, the functional purpose of the main nodes in the structural scheme, the main modes of operation of this program. In the process of performing the master’s thesis, several algorithms for finding the nearest free parking space were analyzed, and the most optimal one was selected. The level of competitiveness of the system and the profitability of its manufacture were determined. Smart Parking means a kind of typical smart system, and as a result, smart parking is a good example of how to make the Internet a part of everyday life so that there is instant access to information online that is useful for everyday life. The Internet can be used to give the driver access to Smart Parking through a mobile app that he can download from the App store to reserve a parking space at any available parking lot. This makes it possible to pay or prepay for a parking space online, ie through various payment services such as google pay, etc. The Smart Parking system allows you to find free parking spaces, and report the likelihood that space is currently still available provides the possibility of reservation and prepayment for a parking space [3]. The main task of the Smart Parking system is to monitor the parking lot, where each parking space is equipped with a motion sensor, cameras to detect the presence or absence of vehicles to create a map that can be used to manage parking, reservations, and other services. An important point in understanding the concept of Smart Parking is to build an optimal network topology that is touch and wireless. Due to this, saving money on equipment for sensor wireless networks will attract more attention to different types of 8 investors, for example, owners of shopping centers, owners of parking lots to the Smart Parking system. Also, a big plus is that the amount of work for network engineers will be reduced by automating the process of creating a warm wireless network in parking spaces. That is, a program that will calculate the optimal topology of the wireless network will not only save money on network equipment but also free network engineers from this task, which is an unconditional advantage. The program will also allow you to change the configuration of devices for the wireless network, as well as develop and upload to it any parking schemes, described in the correct format (JSON or XML). This will allow you to use the program for any network devices and their various parking configurations [1]. Problem-solving. Of all the algorithms that currently exist, the following was selected: "Dijkstra Algorithm". The algorithm works step by step, at each step it visits the top and tries to reduce the labels. The work of the algorithm ends when all the vertices have been visited. The label of the vertex a = 0, and the labels of all other vertices are equal to infinity, this reflects the fact that the distance from a to other vertices is not yet known. If all vertices are visited, the algorithm terminates. Otherwise, from the visited vertices the vertex u which has the minimum label is chosen. We consider all possible routes in which u represents the last point. The vertices into which the edges with u lead are called the neighbors of this vertex. For each neighbor of the vertex u, in addition to those marked as visited, consider a new path length equal to the sum of the values of the current label u and the length of the edge connecting u with this neighbor. If the obtained length value is less than the value of the neighbor’s label, replace the value of the label with the obtained length value. Considering all the neighbors, we denote the vertex u as visited and repeat the step of the algorithm [4]. Regarding our task of finding the shortest path from point a to point b as a given vertex a, we specify the Client vertex and look for the shortest path to the Parking lot vertex. , and Parking lot = infinity, as the distance from the client to the parking lot, is 9 not yet known. If the program visits all parking spaces, the algorithm ends, otherwise, the Parking lot with the lowest label is selected. As a result of the application of this algorithm, we will receive a sequence of vertices of the graph designating the places which in the best way suitable for the best parking. The object of study - a smart parking system The subject of research - a system for finding free parking, for the use of cameras and motion sensors. The purpose of the study: to create an additional one that uses access to the database and GPS tools, to allow members to find the most convenient and shortest way to park their car Research results: All types of motion sensors, video cameras and typical systems for finding free parking space were considered and analyzed List of used literature sources: 1. Jian, M.-S.; Yang, K. S.; Lee, C.-L. Modular RFID parking management system based on existed gate system integration. WSEAS Trans. Syst. 2008, 7, 706– 716. 2. Pala, Z.; Inanc, N. Smart parking applications using RFID technology. In Proceedings of the 1 st RFID Eurasia Conference, Istanbul, Turkey, 5–6 September 2007; pp. 121– 123. 3. Yass, A.A.; Yasin, N.M.; Zaidan, B.B.; Zeiden, A.A. New design for intelligent parking system using the principles of management information system and image detection system. In Proceedings of the 2009 International Conference on Computer Engineering and Applications, Manila, Philippines, 6–8 June 2011; Volume 2, pp. 360–364. 4. Bong, D.B.L.; Ting, K.C.; Lai, K.C. Integrated approach in the design of car park occupancy information system (COINS). IAENG Int. J. Comput. Sci. 2008, 35, 7–14.