Publication

On infinite dimensional linear programming approach to stochastic control * *This research is partially supported by M. Kamgarpour’s European Union ERC Starting Grant, CONENE and by T. Summers’ the US National Science Foundation under grant CNS-1566127.

Publications associées (32)

A Semidefinite Programming Approach to Control Synthesis for Stochastic Reach-Avoid Problems

We propose a computational approach to approximate the value function and control poli- cies for a finite horizon stochastic reach-avoid problem as follows. First, we formulate an infinite dimensional linear program whose solution characterizes the optimal ...

EPiC Series in Computing2017

The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes

Maryam Kamgarpour, John Lygeros, Tyler Summers

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-avoid problem, in which the objective is to synthesize a control policy to max ...

2017

Finite strain FFT-based non-linear solvers made simple

Thomas Willem Jan de Geus

Computational micromechanics and homogenization require the solution of the mechanical equilibrium of a periodic cell that comprises a (generally complex) microstructure. Techniques that apply the Fast Fourier Transform have attracted much attention as the ...

Elsevier2017

MATHICSE Technical Report : Low-rank updates and a divideand- conquer method for linear matrix equations

Daniel Kressner, Stefano Massei

Linear matrix equations, such as the Sylvester and Lyapunov equations, play an important role in various applications, including the stability analysis and dimensionality reduction of linear dynamical control systems and the solution of partial differentia ...

MATHICSE2017

Moment-sum-of-squares hierarchies for set approximation and optimal control

Milan Korda

This thesis uses the idea of lifting (or embedding) a nonlinear controlled dynamical system into an infinite-dimensional space of measures where this system is equivalently described by a linear equation. This equation and problems involving it are subsequ ...

EPFL2016

Reduced Basis Methods: From Low-Rank Matrices To Low-Rank Tensors

Daniel Kressner, Jonas Ballani

We propose a novel combination of the reduced basis method with low-rank tensor techniques for the efficient solution of parameter-dependent linear systems in the case of several parameters. This combination, called rbTensor, consists of three ingredients. ...

Siam Publications2016

Low-rank methods for parameter-dependent eigenvalue problems and matrix equations

Petar Sirkovic

The focus of this thesis is on developing efficient algorithms for two important problems arising in model reduction, estimation of the smallest eigenvalue for a parameter-dependent Hermitian matrix and solving large-scale linear matrix equations, by extra ...

EPFL2016

Distributed synthesis and stability of cooperative distributed model predictive control for linear systems

Colin Neil Jones, Melanie Nicole Zeilinger

This paper presents a new formulation and synthesis approach for stabilizing cooperative distributed model predictive control (MPC) for networks of linear systems, which are coupled in their dynamics. The controller is defined by a network-wide constrained ...

Elsevier2016

MATHICSE Technical Report: Reduced basis methods: from low-rank matrices to low-rank tensor

Daniel Kressner, Jonas Ballani

MATHICSE2015

Bivariate Matrix Functions

Daniel Kressner

A definition of bivariate matrix functions is introduced and some theoretical as well as algorithmic aspects are analyzed. It is shown that our framework naturally extends the usual notion of (univariate) matrix functions and allows to unify existing resul ...

Element2014

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search