An algorithm for searching shortest path by propagating wave fronts in four quadrants.
Xiong Ji-GuangTokinori KozawaPublished in: DAC (1981)
Keyphrases
- shortest path
- shortest path problem
- objective function
- np hard
- dynamic programming
- optimal path
- shortest path algorithm
- finding the shortest path
- dijkstra algorithm
- path length
- path planning
- search space
- graph structure
- knapsack problem
- road network
- minimum spanning tree
- collision free
- minimum cost flow
- strongly connected components
- optimal solution