Smart Priority Park Framework Based on DDGP3

Abstract

This paper provide an algorithm for detecting a place to park inside a multi-level garage. The study is based on setting a different priority for each user, so the results of algorithm will vary depending on the user's priority (disabled people, police, etc.). The conditions of use are related to very crowded parking, so individual users will receive custom maps where the places will appear according to the priorities assigned to them. To achieve this objective, we shall use On Board Units (OBUs) and Road Side Units (RSUs) to build the distance matrix among all the sensors, but inside the VANET (Vehicular Ad Hoc Networks) the information is not exchanged indifferently for all users, but is suitably filtered and sorted by priority. In this way everyone will see only the places where they can park while others will be obscured. In the solution of the algorithm for calculating positions on the map we shall solve a Distance Geometry Problem, however, to locate the parking positions we use the DGP (Distance Geometry Problem) algorithm with the simplifications from continuous to discrete, reducing it to a DDGP3 (Discretizable Distance Geometry Problem in R3), and then solving it with a branch and pruning algorithm. We adopt a linear approximation techniques to resolve an intersection problem among three spheres.