2012 · 141 citations · 22 references
BusinessSystems EngineeringMarkov Decision ProcessesStochastic ModelingStochastic ProcessesOptimal ControlOptimization Under UncertaintyRobust ControlStochastic ControlStochastic Shortest Path ProblemsStochastic Systems ModelingFinite Markov ChainsMarkov Decision ModelsModel-based AlgorithmsProbabilistic Model CheckingState Transition ProbabilitiesStochastic Dynamic ProgrammingTemporal SpecificationsTransition Probabilities
We present a method for designing a robust control policy for an uncertain system subject to temporal logic specifications. The system is modeled as a finite Markov Decision Process (MDP) whose transition probabilities are not exactly known but are known to belong to a given uncertainty set. A robust control policy is generated for the MDP that maximizes the worst-case probability of satisfying the specification over all transition probabilities in this uncertainty set. To this end, we use a procedure from probabilistic model checking to combine the system model with an automaton representing the specification. This new MDP is then transformed into an equivalent form that satisfies assumptions for stochastic shortest path dynamic programming. A robust version of dynamic programming solves for a ε-suboptimal robust control policy with time complexity O(log1/ε) times that for the non-robust case.
22
Discrete abstractions of hybrid systems
Rajeev Alur, Thomas A. Henzinger, Gerardo Lafferriere et al. · Proceedings of the IEEE · 2000 · 816 citations · Full text
The complexity of probabilistic verification
Costas Courcoubetis, Mihalis Yannakakis · Journal of the ACM · 1995 · 560 citations · Full text