You are on page 1of 4

# GOVERNMENT COLLEGE OF TECHNOLOGY COIMBATORE

## FINDING PARKED VEHICLES MADE EASY

Anugraha Devan IIIrd year Computer Science Engineering, Government College of Technology anugraha93@gmail.com Mob no: 9500194925 Abeno Odyuo IIIrd year Computer Science Engineering, Government College of Technology benodys@gmail.com Mob no: 8754830720

## Finding Parked Vehicles Made Easy

AbstractGlobal Position System (GPS) in vehicles and
other devices have become a common trend this days. It has a whole set of applications and we plan to add one more to it. Malls and public gathering places usually have wide space to park vehicles. And it becomes difficult to find our cars among thousands parked in the same place. So we have devised an idea to make it easier for the people to find their vehicle easily.

the shortest path between any two nodes because it tries out all possible routes before arriving at a solution. Depth First Search traverses all levels of a particular node before going to the next node in the same level. So though it is sure to find a solution, it may not always be the shortest one.

IV.Djikstras Algorithm
1. For each vertex v in G 1. Label v as Unprocessed 2. Set (v) = &infinity 3. Set source (v) as undefined 2. 3. Set (o) = 0 While any vertex is Unburned

I.Introduction
Malls and other public places have a very large parking lot and several entrances and exits. So people find themselves coming out at exits far from where they entered the place and thus from their parked vehicle. As a result it becomes difficult to find the parked vehicle. By fitting a small GPS in the vehicle, we can find the shortest path to the vehicle from wherever we are by applying Djikstras Shortest Path Algorithm. This can be achieved by collaborating with the owners, as we need blueprint to design the path to be taken.

1. Call the Unprocessed vertex with smallest &delta value 2. Label u as Processed 3. For each neighbor n of u 1. If (u) + w ( u , n) < &delta(n) 1. 2. 4. Set (n) = (u) + w ( u , n)

II.Graph Theory
Graph Theory is the representation and study of real life path explorations in the form of nodes (vertices) and edges. The nodes represent various points on the graph or area and the edges represent the path between any two nodes. There are two types of traversals in Graph Theory: (i)Breadth First Search (ii)Depth First Search

## Set source (n) = u End

Breadth First Search is the idea behind Djikstras algorithm. Breadth First Search (BFS) is a search technique where all the nodes at a particular level are traversed before going down to the next level. As a result, BFS can be used to find

.Weight of an edge is the distance between any two nodes. Each node in the graph is initially labeled as unprocessed. A node is selected as the source node. And the shortest distance to reach another node from the source is labeled as infinity. The node that is closest to the source node is identified. It is found whether the distance to the

other unprocessed nodes (x) directly from this node is lesser than the distance from the source node. If it is, then this node is labeled as parent node to x and the shortest distance to reach the node(x) is set to the distance of the node x from the recently set parent node. Then this node is set as processed node. In this way, the above steps are repeated till all the nodes are marked as processed.

* Satellite position at the time of message transmission. The receiver uses the messages it receives to determine the transmit time of each message and computes the distance to each satellite using the speed of light. Each of these distances and satellites locations define a sphere. The receiver is on the surface of each of these spheres when the distances and the satellites locations are correct. Location of receiver is then computed using navigation equation.

V.Requirements
This project requires the owners of public places like malls, etc. to support it by providing blueprints. It also uses GPS (Global Positioning System) to track the vehicles parking space. So a GPS needs to be installed in the vehicle to track it. A mobile which supports android.

VII.GPS Tracker
It is generally installed in cars , etc. and it uses GPS to find its location and it can thus send its location to the owner.

## VI .Global Positioning System (GPS)

GPS is a space-based satellite navigation system that provides location and time information in all weather conditions anywhere on or near the Earth. A GPS receiver calculates its position by precisely timing the signals sent by GPS satellites high above the Earth. Each satellite continually transmits messages that include * The time the message was transmitted.

## VIII. Project Implementation

The place where the person is standing is considered as the source node and the place where the vehicle is parked is considered as the destination node. There may be many paths leading to the destination. In the paths a dead end is considered as a node and the way to reach the another node as edge. So by getting a blueprint of the mall or any

public place, we can demarcate the nodes and apply Djikstras algorithm to find the shortest path from the source node to the destination node. Start at the source node and find all possibilities of reaching the nearest dead node that is on the path of the destination. After this is traversed, find if this is the best path so far ( i.e shortest path) then continue . Else take a new path which is shorter than the already traversed path.

XI. Conclusion

## Fig. parking lot

Thus by using the Shortest Path Algorithm finding our cars parked among thousands is made very easy. People in a hurry need not fret over where
their parked vehicle is. Need not waste energy after a tiring day working or having fun around.