Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract)
Kenneth L. ClarksonPublished in: STOC (1987)
Keyphrases
- motion planning
- extended abstract
- approximation algorithms
- shortest path
- degrees of freedom
- np hard
- shortest path problem
- mobile robot
- humanoid robot
- path planning
- shortest path algorithm
- minimum cost
- special case
- worst case
- vertex cover
- road network
- path length
- multi robot
- obstacle avoidance
- travel time
- shortest distance
- constant factor
- optimal path
- constant factor approximation
- reinforcement learning
- finding the shortest path
- weighted graph
- undirected graph
- knapsack problem
- dynamic environments
- dynamic programming
- optimal solution