3 citations · 6 across the 3 of their papers we have counts for
4 papers · 1 filter
Upper bounds for the reach-avoid probability via robust optimization
Nikolaos Kariotoglou, Maryam Kamgarpour, Tyler H. Summers +1
We consider finite horizon reach-avoid problems for discrete time stochastic systems. Our goal is to construct upper bound functions for the reach-avoid probability by means of tra…
On the computational complexity and generalization properties of multi-stage and recursive scenario programs
Nikolaos Kariotoglou, Kostas Margellos, John Lygeros
We discuss the computational complexity and feasibility properties of scenario based techniques for uncertain optimization programs. We consider different solution alternatives ran…
The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes
Nikolaos Kariotoglou, Maryam Kamgarpour, Tyler Summers +1
One of the most fundamental problems in Markov decision processes is analysis and control synthesis for safety and reachability specifications. We consider the stochastic reach-avo…
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…