Prof. Dr. Diego Eckhard

In this work, a systematic methodology to design dynamic output feedback controllers, for linear control systems presenting both actuator and sensor saturations, is proposed. A theoretical condition that ensures that the trajectories of the closed-loop system are bounded for L2 disturbances, while ensuring internal global asymptotic stability is stated. From this theoretical condition an LMI-based optimization problem to compute the controller aiming at minimizing the induced L2 gain between the disturbance and the regulated output is proposed.

This work addresses data-based control design. The properties inherent to data-based design are discussed under a common theoretical framework. The computational cost is estimated with relation to memory space and number of elementar operations. Simulations present a comparision between the studied methods.

This work solves an experiment design problem for a linear regression problem using a reduced order model. The quality of the model is assessed using a mean square error measure that depends linearly on the parameters. The designed input signal ensures a predefined quality of the model while minimizing the input energy.

Data-based control design methods most often consist of iterative adjustment of the controller?s parameters towards the parameter values which minimize an Formula performance criterion. Typically, batches of input-output data collected from the system are used to feed directly a gradient descent optimization algorithm ? no process model is used. Two topics are important regarding this algorithm: the convergence rate and the convergence to the global minimum. This paper discusses these issues and provides a method for choosing the step size to ensure convergence with high convergence rate, as well as a test to verify at each step whether or not the algorithm is converging to the global minimum.

Data-based control design methods consist of adjusting the parameters of the controller directly from batches of input-output data of the process; no process model is used. The adjustment is done by solving an optimization problem, which searches the argument that minimizes a specific cost function. Iterative algorithms based on the gradient are applied to solve the optimization problem, like the steepest descent algorithm, Newton algorithm and some variations. The only information utilized for the steepest descent algorithm is the gradient of the cost function, while the others need more information like the hessian. Longer and more complex experiments are used to obtain more informations, that turns the application more complicated. For this reason, the steepest descent method was chosen to be studied in this work. The convergence of the steepest descent algorithm to the global minimum is not fully studied in the literature. This convergence depends on the initial conditions of the algorithm and on the step size. The initial conditions must be inside a specific domain of attraction, and how to enlarge this domain is treated by the methodology Cost Function Shaping. The main contribution of this work is a method to compute efficiently the step size, to ensure convergence to the global minimum. Some informations about the process are utilized, and this work presents how to estimate these informations. Simulations and experiments demonstrate how the methods work.

This paper presents a remote experimentation plataform with didactic purposes. Fisically, the plataform is basically composed by a system of coupled tanks, where the sensors and actuators are intelligent equipements which use a Foundation Fieldbus communication protocol. A supervisory system and a web server interface the experiments with internet. A distance education plataform is therefore developed to provide access to the experiments, on-line courses, and to assist the student-instructor communication.

Data-based control design methods most often consist of iterative adjustment of the controller's parameters towards the parameter values which minimize an H2 performance criterion. Typically, batches of input-output data collected from the system are used to feed directly a gradient descent optimization - no process model is used. The convergence to the global minimum of the performance criterion depends on the initial controller parameters and on the step size of each iteration. This paper discusses these issues and provides a method for choosing the step size to ensure convergence to the global minimum utilizing the lowest possible number of iterations.

The Output Error Method is related to an optimization problem based on a multi-modal criterion. Iterative algorithms like the steepest descent are usually used to look for the global minimum of the criterion. This algorithms can get stuck at a local minimum. This paper presents sufficient conditions about the convergence of the steepest descent algorithm to the global minimum of the cost function. Moreover, it presents constraints to the input spectrum which ensure that the convergence conditions are satisfied. This constraints are convex and can easily be included in an experiment design approach to ensure the convergence of the iterative algorithms to the global minimum of the criterion.

Os métodos de projeto de controladores baseado em dados são um conjunto de técnicas utilizadas para ajustar os ganhos de controladores, que não utilizam um modelo matemático do processo na sintonia dos parâmetros. Alguns destes métodos são o Iterative Feedback Tuning (IFT), Correlation based Tuning (CbT), Virtual Reference Feedback Tuning (VRFT) e Optimal Controller Identification (OCI). Apesar de algumas destas t{ écnicas existirem por mais de uma década, são encontrados poucos trabalhos na literatura que demonstram a aplicabilidade dos métodos em sistemas industriais. Neste trabalho duas técnicas de projeto de controladores baseado em dados não-iterativas (VRFT e OCI) são aplicadas em em um sistema de controle de nível industrial, que utiliza uma rede Foundation Fieldbus H1. O trabalho demostra que as técnicas apresentadas podem ser aplicadas com facilidade em sistemas industriais gerando repostas dinâmicas satisfatórias.

The Prediction Error Method (PEM) is related to an optimization problem built on input/output data collected from the system to be identified. It is often hard to find the global solution of this optimization problem because the corresponding objective function presents local minima and/or the search space is constrained to a nonconvex set. The shape of the cost function, and hence the difficulty in solving the optimization problem, depends directly on the experimental conditions, more specifically on the spectrum of the input/output data collected from the system. Therefore, it seems plausible to improve the convergence to the global minimum by properly choosing the spectrum of the input; in this paper, we address this problem. We present a condition for convergence to the global minimum of the cost function and propose its inclusion in the input design. We present the application of the proposed approach to case studies where the algorithms tend to get trapped in nonglobal minima.

This work addresses data-based (DB) control design; the properties and limitations inherent to DB design are discussed under a common theoretical framework and illustrated through experimental results. Theoretical results concerning the convergence and precision are discussed and specified for a particular class of processes. Two DB methods, representative of this design approach, are used to illustrate the general properties of DB design: the Virtual Reference Feedback Tuning (VRFT) and the Iterative Feedback Tuning (IFT).

Data-based control design methods most often consist of iterative adjustment of the controller's parameters towards the parameter values which minimize an H2 performance criterion. Typically, batches of input-output data collected from the system are used to feed directly a gradient descent optimization - no process model is used. The convergence to the global minimum of the performance criterion depends on the initial controller parameters, as well as on the size and direction of the steps taken at each iteration. This paper discusses these issues and provides a method for choosing the search direction and the step size at each optimization step so that convergence to the global minimum is obtained with high convergence rate.

The Prediction Error Method (PEM) is related to an optimization problem built on input/output data collected from the system to be identified. It is often hard to find the global solution of this optimization problem because the corresponding objective function presents local minima and/or the search space is constrained to a nonconvex set. The existence of local minima, and hence the difficulty in solving the optimization, depends mainly on the experimental conditions, more specifically on the spectrum of the input/output data collected from the system. It is therefore possible to avoid the existence of local minima by properly choosing the spectrum of the input; in this paper we show how to perform this choice. We present sufficient conditions for the convergence of PEM to the global minimum and from these conditions we derive two approaches to avoid the existence of nonglobal minima. We present the application of one of these two approaches to a case study where standard identification toolboxes tend to get trapped in nonglobal minima.

Iterative data-based controller tuning consists of iterative adjustment of the controller parameters towards the parameter values which minimise an {H2} performance criterion. The convergence to the global minimum of the performance criterion depends on the initial controller parameters and on the step size of each iteration. This article presents convergence properties of iterative algorithms when they are affected by disturbances.

The Prediction Error Method is related to a non-convex optimization problem. It is usual to apply iterative algorithms to solve this optimization problem. However, iterative algorithms can get stuck at a local minimum of the cost function or converge to the border of the searching space. An analysis of the cost function and sufficient conditions to ensure the convergence of the iterative algorithms to the global minimum are presented in this work. It is observed that this conditions depend on the spectrum of the input signal used in the experiment. This work presents tools to improve the convergence of the algorithms to the global minimum, which are based on the manipulation of the input spectrum.

Abstract Identification of an output error model using the prediction error method leads to an optimization problem built on input/output data collected from the system to be identified. It is often hard to find the global solution of this optimization problem because in most cases both the corresponding objective function and the search space are nonconvex. The difficulty in solving the optimization problem depends mainly on the experimental conditions, more specifically on the spectra of the input/output data collected from the system. It is therefore possible to improve the convergence of the algorithms by properly choosing the data prefilters; in this paper we show how to perform this choice. We present the application of the proposed approach to case studies where the standard algorithms tend to fail to converge to the global minimum.