Finding obstacle-avoiding shortest paths using implicit connection graphs.
Si-Qing ZhengJoon Shik LimS. Sitharama IyengarPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1996)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- shortest path algorithm
- shortest path problem
- edge weights
- strongly connected components
- road network
- path length
- travel time
- mobile robot
- graph search
- betweenness centrality
- geodesic distance
- optimal path
- flow graph
- image sequences
- np complete
- spatial networks
- dynamic programming
- shortest distance
- state space
- optimal solution