Safest path Algorithm using Hardware Accelerators and Node Parsing
Keywords:
Dijkstra Algorithm; Machine learning; compound polarity; safe zones.Abstract
The project is to calculate and find out the safest zone to travel from one location to another. The main
idea is to use motion sensors on the streetlights to detect movement of vehicles or people. The frequency of the
data collected from sensors will tell us about the density of people in the entire area and frequency of vehicles. In
addition to this, the number of police stations, malls, hospitals will also be taken into consideration. We will also
take a note of nearby areas that are usually crowded using Google maps API and Google places API that are
present in the entire path of travel. We are finding safest zone during travel assuming the maximum number of
crimes happen in less crowded areas. The data of criminal activities happening in various locations is also taken
into consideration so that we can identify the highly vulnerable zones and can notify the user to be on high alert
in those areas. We can decrease the crime rate on a very high scale and can help people to have a safe journey by
selecting the safest path to travel.
