Publication

Discrete-time regional pole-placement using convex approximations: Theory and application to a boost converter

Emilio Maddalena
2019
Journal Articles

Abstract

The problem of allocating the closed-loop poles of linear systems in specific regions of the complex plane defined by discrete time-domain requirements is addressed. The resulting non-convex set is inner-approximated by a convex region described with linear matrix inequalities. The proposed approach enables a trade-off between computational complexity in terms of mathematical program size and conservativeness. A case study is then carried out on a step-up power converter, comparing three different techniques. Experimental results are provided to show how the proposed control strategy can be employed to enhance its start-up and transient responses when subjected to input voltage and load variations.

Official source

https://infoscience.epfl.ch/entities/publication/d2b83e3c-84a6-4a28-b3c6-9c6aa92b6c7c

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

Emilio Maddalena
2019
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/d2b83e3c-84a6-4a28-b3c6-9c6aa92b6c7c

About this result

Related concepts (32)

Convex hull

In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset. Convex hulls of open sets are open, and convex hulls of compact sets are compact.

Convex set

In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex region is a subset that intersects every line into a single line segment (possibly empty). For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary of a convex set is always a convex curve.

Linear time-invariant system

In system analysis, among other fields of study, a linear time-invariant (LTI) system is a system that produces an output signal from any input signal subject to the constraints of linearity and time-invariance; these terms are briefly defined below. These properties apply (exactly or approximately) to many important physical systems, in which case the response y(t) of the system to an arbitrary input x(t) can be found directly using convolution: y(t) = (x ∗ h)(t) where h(t) is called the system's impulse response and ∗ represents convolution (not to be confused with multiplication).

Related publications (32)

Discrete-time regional pole-placement using convex approximations: Theory and application to a boost converter

Chat with Graph Search

Koopman-based Data-driven Robust Control of Nonlinear Systems Using Integral Quadratic Constraints

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Efficient Continual Finite-Sum Minimization