Approximate dynamic programming for stochastic reachability

2013 European Control Conference, ECC 2013

Volumn , Issue , 2013, Pages 584-589

  Kariotoglou, Nikolaos ^a   Summers, Sean ^a   Summers, Tyler ^a   Kamgarpour, Maryam ^a   Lygeros, John ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

RADIAL BASIS FUNCTION NETWORKS; STOCHASTIC SYSTEMS;

APPROXIMATE DYNAMIC PROGRAMMING; COMPUTATIONAL ADVANTAGES; CURSE OF DIMENSIONALITY; DYNAMIC PROGRAMING; LINEAR COMBINATIONS; OPTIMAL PERFORMANCE; RADIAL BASIS FUNCTIONS; REACHABILITY PROBLEM;

DYNAMIC PROGRAMMING;

EID: 84893316515     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.23919/ecc.2013.6669603     Document Type: Conference Paper

References (15)

1. A. Abate, M. Prandini, J. Lygeros, and S. Sastry, "Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems, " Automatica, vol. 44, no. 11, pp. 2724-2734, 2008.
2. S. Summers and J. Lygeros, "Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem, " Automatica, vol. 46, no. 12, pp. 1951-1961, 2010.
3. C. Guestrin, M. Hauskrecht, and B. Kveton, "Solving factored mdps with continuous and discrete variables, " in Proceedings of the 20th conference on Uncertainty in artificial intelligence, pp. 235-242, AUAI Press, 2004.
4. O. Hernández-Lerma and J. Lasserre, Discrete-time Markov control processes: basic optimality criteria. Springer New York, 1996.
5. M. Puterman, Markov decision processes: Discrete stochastic dynamic programming. John Wiley & Sons, Inc., 1994.
6. D. de Farias and B. Van Roy, "The linear programming approach to approximate dynamic programming, " Operations Research, vol. 51, no. 6, pp. 850-865, 2003.
7. M. Hauskrecht and B. Kveton, "Linear program approximations to factored continuous-state markov decision processes, " NIPS-17, 2003.
8. Y. Wang and S. Boyd, "Approximate dynamic programming via iterated bellman inequalities, " 2010.
9. F. Ramponi, D. Chatterjee, S. Summers, and J. Lygeros, "On the connections between pctl and dynamic programming, " in Proceedings of the 13th ACM international conference on Hybrid Systems: Computation and Control, pp. 253-262, ACM, 2010.
10. M. Campi and S. Garatti, "The exact feasibility of randomized solutions of uncertain convex programs, " SIAM Journal on Optimization, vol. 19, no. 3, pp. 1211-1230, 2008.
11. G. Calafiore and M. Campi, "The scenario approach to robust control design, " Automatic Control, IEEE Transactions on, vol. 51, no. 5, pp. 742-753, 2006.
12. T. Summers, K. Kunz, N. Kariotoglou, M. Kamgarpour, S. Summers, and J. Lygeros, "Approximate dynamic programming via sum of squares programming, " Submitted to the IEEE European Control Conference, 2013.
13. J. Park and I. Sandberg, "Universal approximation using radial-basisfunction networks, " Neural computation, vol. 3, no. 2, pp. 246-257, 1991.
14. D. Bertsekas, Dynamic programming and optimal control, vol. 1. Athena Scientific Belmont, MA, 1995.
15. M. Campi, S. Garatti, and M. Prandini, "The scenario approach for systems and control design, " Annual Reviews in Control, vol. 33, no. 2, pp. 149-157, 2009.