A heuristic optimization path-finding algorithm based on Dijkstra algorithm

MaRDI QIDQ5456022zbMATHFDO

Authors Jingcun Wang, Xiaotong Zhang, Bin Chen, Heping Chen

Publication date 4 April 2008

zbMATH Keywords

heuristicnavigationpath-finding

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 4035604
• A Shortest Path Algorithm Based on Limited Search Heuristics
• Computational Science - ICCS 2004
• An improved shortest path algorithm based on Dijkstra for indoor mobile navigation
• scientific article; zbMATH DE number 3880462

Cited in

(4)

• Algorithms for path optimizations: a short survey
• An improved shortest path algorithm based on Dijkstra for indoor mobile navigation
• Optimizing Dijkstra algorithm design and accomplishment for parking routine programming based on weight caculation
• Computational Science - ICCS 2004

This page was built for publication: A heuristic optimization path-finding algorithm based on Dijkstra algorithm

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