Intelligent Hamilton Path: Using Artificial Intelligent A* Algorithm and Hamilton Path to Navigate Multiple Destinations

Abstract

Navigation applications are becoming an essential need for travellers holding mobile devices. Finding the best path (time and distance) from one address to another is one of the most asked queries by travellers. A more difficult problem is finding the best path to visit multiple destinations in a single trip, which could be a common query for many including sales people, tourists, and delivery drivers. Google maps, Yahoo maps, and the like are examples of navigation mobile applications. Calculating the best driving path between multiple addresses is subject to many factors including distance, road situation, road traffic, speed limitations and others. This paper presents the use of smart heuristic functions, intelligent algorithms A*, traditional graph algorithms like Hamilton path as well as efficient data structures in finding efficient path between multiple addresses. It presents graph algorithms and notations, existing smart graph algorithms, heuristics in graph problems, and finally a smart solution, A* Hamilton, to determine the best path between given multiple destinations.