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.
This paper proposes an online tree-based Bayesian approach for reinforcement learning. For inference, we employ a generalised context tree model. This defines a distribution on multivariate Gaussian piecewise-linear models, which can be updated in closed f ...
We characterize the maximum controlled invariant (MCI) set for discrete-time systems as the solution of an infinite-dimensional linear programming problem. In the case of systems with polynomial dynamics and semialgebraic state and control constraints, we ...
In this paper, a new method for fixed-order controller design of systems with polytopic uncertainty in their state space representation is proposed. The approach uses the strictly positive realness (SPRness) of some transfer functions, as a tool to decoupl ...
State-feedback model predictive control (MPC) of constrained discrete-time periodic affine systems is considered. The periodic systems’ states and inputs are subject to periodically time-dependent, hard, polyhedral constraints. Disturbances are additive, b ...
This paper presents a vector control strategy for regulating the current of grid-tied voltage source converters (VSCs) in a rotating reference frame. The proposed approach is based on shaping the open-loop and closed-loop transfer matrices of the system. S ...
Institute of Electrical and Electronics Engineers2013
We describe a framework for analyzing probabilistic reachability and safety problems for discrete time stochastic hybrid systems within a dynamic games setting. In particular, we consider finite horizon zero-sum stochastic games in which a control has the ...
In this work we illustrate how approximate dynamic programing can be utilized to address problems of stochastic reachability in infinite state and control spaces. In particular we focus on the reach-avoid problem and approximate the value function on a lin ...
We propose a partition-based state estimator for linear discrete-time systems composed by coupled subsystems affected by bounded disturbances. The architecture is distributed in the sense that each subsystem is equipped with a local state estimator that ex ...
The paper demonstrates a phase estimation method in fringe analysis. The proposed method relies on local polynomial phase approximation and subsequent state-space formulation. The polynomial approximation of phase transforms phase extraction into a paramet ...
This paper presents a state estimation approach for legged robots based on stochastic filtering. The key idea is to extract information from the kinematic constraints given through the intermittent contacts with the ground and to fuse this information with ...
