抽象的な

Landmark Based Shortest Path Detection by Using A* and Haversine Formula

Prof. Nitin R.Chopde, Mr. Mangesh K. Nichat

In 1900, less than 20 percent of the world population lived in cities, in 2007, just more than 50 percent of the world population lived in cities. In 2050, it has been predicted that more than 70 percent of the global population (about 6.4 billion people) will be city inhabitants. There is more pressure being placed on cities through this increase in population [1]. With advent of smart cities, information and communication technology is increasingly transforming the way city municipalities and city residents organize and operate in response to urban growth. In this paper, we create a generic scheme for navigating a route through out city. A requested route is provided by using combination of A* Algorithm and Haversine formula. Haversine Formula gives minimum distance between any two points on spherical body by using latitude and longitude. This minimum distance is then provided to A* algorithm to calculate minimum distance. The process for detecting the shortest path is mention in this paper.