An improved shortest path algorithm based on Dijkstra for indoor mobile navigation

DOI10.12046/J.ISSN.1000-5277.2017.03.003zbMATH Open1399.90281MaRDI QIDQ4640429FDOQ4640429

Authors: Yikun Huang 

Publication date: 25 May 2018

Recommendations

• Optimizing Dijkstra algorithm design and accomplishment for parking routine programming based on weight caculation
• An improved Dijkstra's shortest path algorithm for sparse network
• An improvement of Dijkstra's method for finding a shortest path in a graph
• A heuristic optimization path-finding algorithm based on Dijkstra algorithm
• A study of improvement of D\(^*\) algorithms for mobile robot path planning in partial unknown environments

zbMATH Keywords

shortest pathDijkstra algorithmindoor positioningmobile navigation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (3)

• Multi-objective indoor path planning method with dynamic environment awareness
• Optimizing Dijkstra algorithm design and accomplishment for parking routine programming based on weight caculation
• A heuristic optimization path-finding algorithm based on Dijkstra algorithm

This page was built for publication: An improved shortest path algorithm based on Dijkstra for indoor mobile navigation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640429)