Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A heuristic optimization path-finding algorithm based on Dijkstra algorithm

From MaRDI portal
Publication:5456022
Jump to:navigation, search

zbMATH Open1141.68339MaRDI QIDQ5456022FDOQ5456022


Authors: Jingcun Wang, Xiaotong Zhang, Bin Chen, Heping Chen Edit this on Wikidata


Publication date: 4 April 2008





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


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)



Cited In (2)

  • Algorithms for path optimizations: a short survey
  • 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5456022&oldid=20230341"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 9 February 2024, at 10:41. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki