Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees.
Lucas LiebenweinCenk BaykalIgor GilitschenskiSertac KaramanDaniela RusPublished in: Robotics: Science and Systems (2018)
Keyphrases
- approximation algorithms
- approximation guarantees
- reachability analysis
- markov decision processes
- model checking
- np hard
- special case
- timed automata
- approximation ratio
- worst case
- vertex cover
- minimum cost
- incremental algorithms
- constant factor
- greedy algorithm
- facility location problem
- approximation schemes
- network design problem
- primal dual
- open shop
- polynomial time approximation
- state space
- combinatorial auctions
- set cover
- precedence constraints
- randomized algorithms
- long run
- knapsack problem
- distributed systems
- disjoint paths
- constant factor approximation