Can I read Extended Dijkstra Algorithm for Path Search on EtoBox?
Extended Dijkstra Algorithm for Path Search by dny is a document available to read on EtoBox.
What is Extended Dijkstra Algorithm for Path Search about?
The document proposes an extended Dijkstra algorithm to find near-optimal shortest paths more quickly than the standard Dijkstra algorithm. It extends the Dijkstra method by running searches from both the start and end points simultaneously, limiting the concentric expansion of the search region. A simulation showed the extended method returns paths close to the optimal solution in less time by checking fewer nodes than the standard Dijkstra algorithm.
- Author
- dny
- Language
- EN