Approximate dynamic programming via sum of squares programming
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
A method to synthesize shaped beams with antenna arrays is presented. Specifically, the element excitations are determined such that the array radiates a power pattern that approximates a desired shape. To efficiently solve this problem, an iterative algor ...
We consider the problem of incrementally learning different strategies of performing a complex sequential task from multiple demonstrations of an expert or a set of experts. While the task is the same, each expert differs in his/her way of performing it. W ...
In this paper we consider a linear system represented by subsystems coupled through states and propose a distributed control scheme for guaranteeing asymptotic stability and satisfaction of constraints on system inputs and states. Our design procedure enab ...
We consider the problem of incrementally learning different strategies of performing a complex sequential task from multiple demonstrations of an expert or a set of experts. While the task is the same, each expert differs in his/her way of performing it. W ...
We propose a tractable approximation scheme for convex (not necessarily linear) multi-stage robust optimization problems. We approximate the adaptive decisions by finite linear combinations of prescribed basis functions and demonstrate how one can optimize ...
In this paper, we consider nonlinear Schrodinger equations of the following type: -Delta u(x) + V (x) u(x) -q(x)|u(x)|sigma u(x) =lambda u(x), x is an element of R-N, u is an element of H-1(R-N) \ {0}, where N >= 2 and sigma > 0. We concentrate on situatio ...
Royal Society of Edinburgh Scotland Foundation, Cambridge2013
(EN)A method for continuously tracking multiple people partitioned into groups while preserving identities under global appearance constraints, wherein people's trajectories may intersect, and wherein only sparse appearance information is available is disc ...
Given an integral polyhedron P subset of R-n and a rational polyhedron Q subset of R-n containing the same integer points as P, we investigate how many iterations of the Chvatal-Gomory closure operator have to be performed on Q to obtain a polyhedron conta ...
The polynomial Hirsch conjecture states that the vertex-edge diameter of a d-dimensional polyhedron with n facets is bounded by a polynomial in d and n. For the special case where the polyhedron is defined as the set of points satisfying a system Ax ≤ b of ...
Manifold models provide low-dimensional representations that are useful for analyzing and classifying data in a transformation-invariant way. In this paper we study the problem of jointly building multiple pattern transformation manifolds from a collection ...
