A shortest path planning algorithm for cloud computing environment based on multi-access point topology analysis for complex indoor spaces

Due to the increasing complexity of internal spaces and dynamic change in certain specific partitions in large indoor areas, indoor navigation has become more important as it is useful to help people find their destination or evacuate from dangerous areas. A shortest path planning method is the main technique used in an indoor navigation system. Hence, we proposed a shortest path planning algorithm based on multi-access point topological analysis for a dynamically changing indoor navigation path. To support the dynamically changing characteristics, we pre-construct an indoor route when the route is requested. Further, we dynamically update its internal path information when the route changes. The proposed method is suitable for both simple and complex large-scale indoor spaces, even when the related indoor maps are difficult to be used for navigation. We conduct a performance evaluation to compare the proposed method with the current research approaches. The results show that our method provides improved performance for indoor navigation.