An Anytime Algorithm for Reachability on Uncountable MDP.
Kush GroverJan KretínskýTobias MeggendorferMaximilian WeiningerPublished in: CoRR (2020)
Keyphrases
- np hard
- computational complexity
- learning algorithm
- detection algorithm
- cost function
- dynamic programming
- high accuracy
- markov decision processes
- matching algorithm
- theoretical analysis
- experimental evaluation
- significant improvement
- state space
- linear programming
- computationally efficient
- k means
- search space
- preprocessing
- path planning
- genetic algorithm
- simulated annealing
- clustering method
- utility function
- image segmentation
- linear program
- times faster
- finite state