37 citations · 40 across the 2 of their papers we have counts for
2 papers
math.OC2012★ 3 cited
Approximate Dynamic Programming via Sum of Squares Programming
Tyler H. Summers, Konstantin Kunz, Nikolaos Kariotoglou +3
We describe an approximate dynamic programming method for stochastic control problems on infinite state and input spaces. The optimal value function is approximated by a linear com…
math.OC2009★ 37 cited
On the connections between PCTL and Dynamic Programming
Federico Ramponi, Debasish Chatterjee, Sean Summers +1
Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context…