Mobile Application based Indoor Positioning and Navigational System using Dijkstra’s Algorithm

Abstract

Abstract This paper offers a method for developing an efficient indoor navigation system with the consideration of the shortest path between source and destination. The challenge for the indoor navigation system is to provide personal navigation information and the optimal route. Applications of indoor navigation systems need consideration of the Shortest Path problem. The shortest pathways can be used to find solutions to the current problems using Dijkstra’s algorithm. Based on the issue with the indoor navigation system, the shortest way and the best path are calculated. This is crucial to navigation systems since it can aid in making wise decisions and time-saving choices. The primary goal is to obtain the implementation at an affordable price. These applications and services are made available indoors, where the GPS does not function. The goal of indoor navigation is to direct users inside buildings. Dijkstra’s algorithm for locating objects and for moving along the shortest path in an indoor setting are examined in this work. Experimental results of indoor navigation systems were carried out on my organization’s indoor environment and verified the applicability of the presented Indoor Navigation System. The techniques provided include map digitization, locating a user, and choosing the shortest route. This is accomplished through a mobile application created for the Android operating system, and indoor navigation is carried out by using Dijkstra’s algorithm. The proposed method is implemented in our college academic block, and the experimental results show that our navigation method is feasible and effective. To verify the reliability of the algorithm, the proposed application fulfils the criteria of an indoor navigation system to produce the optimal route between two points when applied to a map of our college’s indoor terrain.