A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract).
Jean-Daniel BoissonnatSylvain LazardPublished in: SCG (1996)
Keyphrases
- shortest path
- extended abstract
- shortest path problem
- shortest path algorithm
- optimal path
- optimal solution
- finding the shortest path
- dynamic programming
- path length
- routing algorithm
- np hard
- search space
- minimum spanning tree
- dijkstra algorithm
- strongly connected components
- objective function
- path planning
- combinatorial optimization
- road network
- evolutionary algorithm
- lower bound
- minimum cost flow