A Landmark Based Shortest Path Detection by Using A* and Haversine Formula
Total Page:16
File Type:pdf, Size:1020Kb
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169 Volume: 6 Issue: 7 98 - 101 ______________________________________________________________________________________ A Landmark Based Shortest Path Detection by Using A* and Haversine Formula Ms. Megha G. Mathpal Department of Information Technology Government Engineering College Modasa, Gujarat, India [email protected] 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. Keywords- Haversine Formula, Dijkstra Algorithm, Google Map, XML. ________________________________________________*****_________________________________________________ I. INTRODUCTION II. PROBLEM DEFINATION The downsides happened in past paper of shortest path The Point of Paper is to discover out the route in between two discovery by utilizing Dijkstra calculation is recuperated in spots/junctions inside a city entered by client by making use of this paper by employing A* calculation. A* calculation is the Intersections in between the Source and Goal spots/junctions. heuristic in nature. The point of Paper is to discover the route The main motto behind it is to progress the navigation of client between two places inside a city entered by client utilizing inside a city; particularly in Indian cities where Town Arranging the Intersections between Source and Goal intersections. The approach doesn’t take after a standard rule for numbering or witticism behind it is to progress navigation of client inside a naming the distinctive spots or places. Most of the times an city; particularly in India where Town Arranging approach obscure individual can’t discover indeed the most famous places doesn’t take after a standard rule for naming the diverse inside the city due to nonappearance of naming sheets or other places. Most of the times an unknown person can’t discover noteworthy identities. Subsequently the project is intended to indeed the foremost popular places inside the city due to allow a suitable route to client by coordinating it through various nonappearance of noteworthy identities. Hence the paper is junctions and streets which is able be easily identified by the planning to allow a suitable route to client by coordinating it related landmarks given with the route. The requested route is through different intersections and streets which will be given to client in terms of the intersections present in between the effortlessly distinguished by the related landmarks and a Google map. The route is given in two parts as: 1) Content source and goal route along with landmarks and streets route containing route giving a intersection to intersection interfacing them. The Landmarks utilized within the route may be movement to client in conjunction with the appropriate noteworthy Buildings, Statues, Streets, Complexes, Landmarks, directions and turnings directing the client to induce the Sanctuaries, etc. The use of Landmarks includes an advantage of precise halfway intersections or landmarks 2) Google Map getting to the exact place having no critical personality whereas for correct requested route. Paper uses client-server voyaging through route provided to client making the application engineering. Communication between them is entirely in friendly to the client obscure of the city to discover out the route XML for adaptability. The client has client interface from in between any two spots or intersections within the city. The where an input is taken in XML for processing. The server application is bound to deliver the shortest route providing a comprises of a Java Processing Application and Database for junction to junction movement to client in conjunction with the it. The Database utilized by handling application could be a appropriate directions and turnings directing the client to induce Social database containing whole information around city. the precise intermediate intersections (with their significant The processing application after parsing request computes landmarks) or landmarks in specific zones in between two route between them with all necessary subtle elements with junctions/spots provided by client. Latitude/Longitude for Google map and sends it as XML response. Client once more parsing response gets it on Client Interface with Google map handling done in JavaScript. 98 IJRITCC | July 2018, Available @ http://www.ijritcc.org _______________________________________________________________________________________ International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169 Volume: 6 Issue: 7 98 - 101 ______________________________________________________________________________________ III. LITERATURE SURVEY closedset := the empty set // The set of nodes already evaluated. This paper contains “great circle distance” which speaks to openset := {start} // The set of tentative nodes to be evaluated, the shortest path for distance modeling and optimal facility initially containing the start node area on spherical surface. Great circle distances take into came_from := the empty map // The map of navigated nodes. consideration the geometrical reality of the spherical Earth g_score[start] := 0 // Cost from start along best known path. and offers an elective to broadly held idea that travel over // Estimated total cost from start to goal through y. water can be precisely displayed by Euclidean distances. The f_score[start] := g_score[start] + heuristic_cost_estimate(start, need for geometrical presentation of the spherical earth gets goal) while openset is not empty current: = the node in openset having the lowest f_score[] value to be exceptionally important when we take into thought an if current = goal ever-expanding junction inside a city. The utilize of “Great return reconstruct_path(came_from, goal) circle distances” opens another avenue for merging of remove current from openset Navigation and Spherical Trigonometry into progression of add current to closedset logistics and facility location. In this paper an assessment of for each neighbour in neighbor_nodes(current) distance area utilizing great circle distances is utilized to tentative_g_score:=g_score[current]+ illustrate the application of the concept [4][3]. This paper dist_between(current,neighbor) proposes and executes a strategy for performing shortest if neighbor in closedset path calculations taking crowdsourced information, in the if tentative_g_score>= g_score[neighbor] form of imperatives and impediments, into consideration. continue The strategy is built on top of Google Maps (GM) and if neighbor not in openset or tentative_g_score<g_score[neighbor] employments its directing benefit to calculate the most came_from[neighbor] := current limited distance between two areas. Clients give the g_score[neighbor] := tentative_g_score limitations and obstacles in the form of polygons which f_score[neighbor]:=g_score[neighbor]+heuristic_cost_estimate(ne identify closed areas in the real world [5]. ighbor, goal) if neighbor not in openset A.Haversine Formula add neighbor to openset The Haversine formula is an equation important in return failure; navigation, giving great-circle distances between two points function reconstruct_path(came_from, current_node) on a sphere from their longitudes and latitudes [4]. These if current_node in came_from names follow from the fact that they are customarily written p:=reconstruct_path(came_fromcame_from[current_node]) in terms of the haversine function, given by haversin (θ) = return (p + current_node) sin2 (θ/2). The haversine formula is used to calculate the else distance between two points on the Earth’s surface specified return current_node. in longitude and latitude. d is the distance between two points with longitude and latitude (ψ,φ) and r is the radius of the The above pseudo code assumes that the heuristic function is Earth. Translation to SQL statement[1] 3956 * 2 * ASIN ( monotonic, which is a frequent case in many practical problems, SQRT (POWER(SIN((orig.lat - dest.lat)*pi()/180 / 2), 2) such as the Shortest Distance Path in road networks. However, if +COS(orig.lat *pi()/180) *COS(dest.lat * pi()/180) the assumption is not true, nodes in the closed set may be *POWER(SIN((orig.lon - dest.lon) * pi()/180 / 2), 2)) ) AS rediscovered and their cost improved. distance [2]. IV. SYSTEM DESIGN B.A* Algorithm The Point of the paper is to discover out the route in between any A* uses a best-first search and finds a least-cost path from a two spots inside a city entered by the client. This may be given beginning node to one objective node (out of one or implemented