Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open-Chain Manipulators.
Bruce Randall DonaldPatrick G. XavierPublished in: Algorithmica (1995)
Keyphrases
- approximation algorithms
- worst case
- minimum cost
- constant factor
- np hard
- special case
- vertex cover
- upper bound
- robotic systems
- facility location problem
- approximation schemes
- mobile robot
- motion planning
- network design problem
- error bounds
- path planning
- multi robot
- dynamic programming
- multiple robots
- approximation guarantees
- set cover
- approximation ratio
- optimal solution
- randomized algorithms
- constant factor approximation
- open shop
- undirected graph
- collision free
- network flow
- lower bound
- polynomial time approximation
- humanoid robot
- branch and bound algorithm
- greedy algorithm