Lecture

StateSpace ControlCanonical: Canonical Forms

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.

In course

ME-321: Control systems + TP

Provides the students with basic notions and tools for the analysis and control of dynamic systems. Shows them how to design controllers and analyze the performance of controlled systems. ...

Description

This lecture covers the concept of control canonical form, which allows for simple modification of system dynamics by introducing an intermediary variable. The transformation from input to state equations and state to output equations is explained, along with the block diagram representation. State transformations and the relationship between state matrices are discussed, leading to the general procedure for converting any representation to control canonical form. The lecture concludes with the design of full state feedback control law.

Instructors (2)

Christophe Salzmann

Expertise Real-time Internet ServicesReal-time controlQuality of Service and Bandwidth adaptationLabVIEW Education PhD | Remote experimentation, Network 2005 – 2005 EPFL Directed by Denis Gillet MS. Degree | Computer Science 1999 – 1999 University of Florida Directed by Prof. H. Latchman Teaching & PhD Past EPFL PhD Students as codirector Damien Perritaz, Evgeny Bogdanov, Wissam Halimi Courses Control systems + TP ME

Colin Neil Jones

Colin Jones is an Associate Professor in the Automatic Control Laboratory at the Ecole Polytechnique Federale de Lausanne (EPFL) in Switzerland. He was a Senior Researcher at the Automatic Control Lab at ETH Zurich until 2011 and obtained a PhD in 2005 from the University of Cambridge for his work on polyhedral computational methods for constrained control. Prior to that, he was at the University of British Columbia in Canada, where he took a BASc and MASc in Electrical Engineering and Mathematics. Colin has worked in a variety of industrial roles, ranging from commercial building control to the development of custom optimization tools focusing on retail human resource scheduling. His current research interests are in the theory and computation of predictive control and optimization, and their application to green energy generation, distribution and management.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (31)

Diagonal matrix

In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal matrix is , while an example of a 3×3 diagonal matrix is. An identity matrix of any size, or any multiple of it (a scalar matrix), is a diagonal matrix. A diagonal matrix is sometimes called a scaling matrix, since matrix multiplication with it results in changing scale (size).

Invertible matrix

In linear algebra, an n-by-n square matrix A is called invertible (also nonsingular, nondegenerate or (rarely used) regular), if there exists an n-by-n square matrix B such that where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix B is uniquely determined by A, and is called the (multiplicative) inverse of A, denoted by A−1. Matrix inversion is the process of finding the matrix B that satisfies the prior equation for a given invertible matrix A.

State-space representation

In control engineering, model based fault detection and system identification a state-space representation is a mathematical model of a physical system specified as a set of input, output and variables related by first-order (not involving second derivatives) differential equations or difference equations. Such variables, called state variables, evolve over time in a way that depends on the values they have at any given instant and on the externally imposed values of input variables.

Affine transformation

In Euclidean geometry, an affine transformation or affinity (from the Latin, affinis, "connected with") is a geometric transformation that preserves lines and parallelism, but not necessarily Euclidean distances and angles. More generally, an affine transformation is an automorphism of an affine space (Euclidean spaces are specific affine spaces), that is, a function which maps an affine space onto itself while preserving both the dimension of any affine subspaces (meaning that it sends points to points, lines to lines, planes to planes, and so on) and the ratios of the lengths of parallel line segments.

Hermitian matrix

In mathematics, a Hermitian matrix (or self-adjoint matrix) is a complex square matrix that is equal to its own conjugate transpose—that is, the element in the i-th row and j-th column is equal to the complex conjugate of the element in the j-th row and i-th column, for all indices i and j: or in matrix form: Hermitian matrices can be understood as the complex extension of real symmetric matrices.

Related lectures (64)

Density Operator: Matrix to the System State

Explores density operator matrix transformation in quantum physics and the implications of measuring the system, leading to state collapse.

Characteristic Polynomials and Similar Matrices

Explores characteristic polynomials, similarity of matrices, and eigenvalues in linear transformations.

Change of Frames in 2D

Explores changing frames in 2D through translations, rotations, and the introduction of a transformation matrix U.

State-Space Representation: Controllability and Observability

Explores state-space representation, controllability, observability, and regulator calculation using the Ackermann method.

Linear Algebra: Reduction of Linear Application