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

Main Article Content

Ms. Megha G. Mathpal

Abstract

In 1900, less than 20 percent of the world populace lived in cities, in 2007, fair more than 50 percent of the world populace lived in cities. In 2050, it has been anticipated that more than 70 percent of the worldwide population (about 6.4 billion individuals) will be city tenants. There's more weight being set on cities through this increment in population [1]. With approach of keen cities, data and communication technology is progressively transforming the way city regions and city inhabitants organize and work in reaction to urban development. In this paper, we create a nonspecific plot for navigating a route throughout city A asked route is given by utilizing combination of A* Algorithm and Haversine equation. Haversine Equation gives least distance between any two focuses on spherical body by utilizing latitude and longitude. This least distance is at that point given to A* calculation to calculate minimum distance. The method for identifying the shortest path is specify in this paper.

Article Details

How to Cite
, M. M. G. M. “A Landmark Based Shortest Path Detection by Using A* and Haversine Formula”. International Journal on Recent and Innovation Trends in Computing and Communication, vol. 6, no. 7, July 2018, pp. 98-101, doi:10.17762/ijritcc.v6i7.1690.
Section
Articles