500 citations · 2.4k across the 118 of their papers we have counts for
11 papers · 1 filter
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…
Topology Design for Optimal Network Coherence
Tyler Summers, Iman Shames, John Lygeros +1
We consider a network topology design problem in which an initial undirected graph underlying the network is given and the objective is to select a set of edges to add to the graph…
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…
Decentralized Convergence to Nash Equilibria in Constrained Deterministic Mean Field Control
Sergio Grammatico, Francesca Parise, Marcello Colombino +1
This paper considers decentralized control and optimization methodologies for large populations of systems, consisting of several agents with different individual behaviors, constr…
A Tractable Fault Detection and Isolation Approach for Nonlinear Systems with Probabilistic Performance
Peyman Mohajerin Esfahani, John Lygeros
This article presents a novel perspective along with a scalable methodology to design a fault detection and isolation (FDI) filter for high dimensional nonlinear systems. Previous…
Efficient Approximation of Channel Capacities
Tobias Sutter, David Sutter, Peyman Mohajerin Esfahani +1
We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on d…