Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots with Decoupled Dynamics Bounds.
Bruce Randall DonaldPatrick G. XavierPublished in: Algorithmica (1995)
Keyphrases
- approximation algorithms
- worst case
- constant factor
- upper bound
- np hard
- minimum cost
- lower bound
- average case
- vertex cover
- randomized algorithms
- error bounds
- greedy algorithm
- theoretical guarantees
- computational complexity
- approximation schemes
- primal dual
- special case
- facility location problem
- approximation guarantees
- network design problem
- np hardness
- approximation ratio
- open shop
- collision free
- objective function
- constant factor approximation
- multiple robots
- set cover
- precedence constraints
- undirected graph
- combinatorial auctions
- integer programming