Pseudo approximation algorithms, with applications to optimal motion planning.
Tetsuo AsanoDavid G. KirkpatrickChee-Keng YapPublished in: SCG (2002)
Keyphrases
- approximation algorithms
- motion planning
- worst case
- minimum cost
- constant factor
- np hard
- degrees of freedom
- mobile robot
- path planning
- trajectory planning
- special case
- robot arm
- vertex cover
- approximation schemes
- robotic arm
- approximation ratio
- approximation guarantees
- collision free
- randomized algorithms
- upper bound
- autonomous mobile robot
- obstacle avoidance
- set cover
- multi robot
- mechanical systems
- humanoid robot
- open shop
- robotic tasks
- collision avoidance
- configuration space
- precedence constraints
- optimal path
- primal dual
- dynamic environments
- dynamic programming
- lower bound
- optimality criterion
- optimal solution