Constrained optimal control theory for differential linear repetitive processes

Differential repetitive processes are a distinct class of continuous-discrete two-dimensional linear systems of both systems theoretic and applications interest. These processes complete a series of sweeps termed passes through a set of dynamics defined over a finite duration known as the pass length, and once the end is reached the process is reset to its starting position before the next pass begins. Moreover the output or pass profile produced on each pass explicitly contributes to the dynamics of the next one. Applications areas include iterative learning control and iterative solution algorithms, for classes of dynamic nonlinear optimal control problems based on the maximum principle, and the modeling of numerous industrial processes such as metal rolling, long-wall cutting, etc. In this paper we develop substantial new results on optimal control of these processes in the presence of constraints where the cost function and constraints are motivated by practical application of iterative learning control to robotic manipulators and other electromechanical systems. The analysis is based on generalizing the well-known maximum and $\epsilon$-maximum principles to the

Zonotopic fault detection observer design for Takagi–Sugeno fuzzy systems

This paper considers zonotopic fault detection observer design in the finite-frequency domain for discrete-time Takagi–Sugeno fuzzy systems with unknown but bounded disturbances and measurement noise. We present a novel fault detection observer structure, which is more general than the commonly used Luenberger form. To make the generated residual sensitive to faults and robust against disturbances, we develop a finite-frequency fault detection observer based on generalised Kalman–Yakubovich–Popov lemma and P-radius criterion. The design conditions are expressed in terms of linear matrix inequalities. The major merit of the proposed method is that residual evaluation can be easily implemented via zonotopic approach. Numerical examples are conducted to demonstrate the proposed methodPeer ReviewedPostprint (author's final draft

Stabilization and Controller Design of 2D Discrete Switched Systems with State Delays under Asynchronous Switching

This paper is concerned with the problem of robust stabilization for a class of uncertain two-dimensional (2D) discrete switched systems with state delays under asynchronous switching. The asynchronous switching here means that the switching instants of the controller experience delays with respect to those of the system. The parameter uncertainties are assumed to be norm-bounded. A state feedback controller is proposed to guarantee the exponential stability. The dwell time approach is utilized for the stability analysis and controller design. A numerical example is given to illustrate the effectiveness of the proposed method

Locally Minimum-Variance Filtering of 2-D Systems over Sensor Networks with Measurement Degradations: A Distributed Recursive Algorithm

10.13039/501100012166-National Key Research and Development Program of China (Grant Number: 2018AAA0100202); 10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61673110, 61873148, 61933007, 61903082 and 61973080); 10.13039/501100002858-China Postdoctoral Science Foundation (Grant Number: 2018M640443); Jiangsu Planned Projects for Postdoctoral Research Funds of China (Grant Number: 2019K192); 10.13039/100005156-Alexander von Humboldt Foundation of German

Iterative learning control: algorithm development and experimental benchmarking

This thesis concerns the general area of experimental benchmarking of Iterative Learning Control (ILC) algorithms using two experimental facilities. ILC is an approach which is suitable for applications where the same task is executed repeatedly over the necessarily finite time duration, known as the trial length. The process is reset prior to the commencement of each execution. The basic idea of ILC is to use information from previously executed trials to update the control input to be applied during the next one. The first experimental facility is a non-minimum phase electro-mechanical system and the other is a gantry robot whose basic task is to pick and place objects on a moving conveyor under synchronization and in a fixed finite time duration that replicates many tasks encountered in the process industries. Novel contributions are made in both the development of new algorithms and, especially, in the analysis of experimental results both of a single algorithm alone and also in the comparison of the relative performance of different algorithms. In the case of non-minimum phase systems, a new algorithm, named Reference Shift ILC (RSILC) is developed that is of a two loop structure. One learning loop addresses the system lag and another tackles the possibility of a large initial plant input commonly encountered when using basic iterative learning control algorithms. After basic algorithm development and simulation studies, experimental results are given to conclude that performance improvement over previously reported algorithms is reasonable. The gantry robot has been previously used to experimentally benchmark a range of simple structure ILC algorithms, such as those based on the ILC versions of the classical proportional plus derivative error actuated controllers, and some state-space based optimal ILC algorithms. Here these results are extended by the first ever detailed experimental study of the performance of stochastic ILC algorithms together with some modifications necessary to their configuration in order to increase performance. The majority of the currently reported ILC algorithms mainly focus on reducing the trial-to-trial error but it is known that this may come at the cost of poor or unacceptable performance along the trial dynamics. Control theory for discrete linear repetitive processes is used to design ILC control laws that enable the control of both trial-to-trial error convergence and along the trial dynamics. These algorithms can be computed using Linear Matrix Inequalities (LMIs) and again the results of experimental implementation on the gantry robot are given. These results are the first ever in this key area and represent a benchmark against which alternatives can be compared. In the concluding chapter, a critical overview of the results presented is given together with areas for both short and medium term further researc

Measurements, Models, Systems and Design

531 s.

Structure-Preserving Model Reduction of Physical Network Systems

This paper considers physical network systems where the energy storage is naturally associated to the nodes of the graph, while the edges of the graph correspond to static couplings. The first sections deal with the linear case, covering examples such as mass-damper and hydraulic systems, which have a structure that is similar to symmetric consensus dynamics. The last section is concerned with a specific class of nonlinear physical network systems; namely detailed-balanced chemical reaction networks governed by mass action kinetics. In both cases, linear and nonlinear, the structure of the dynamics is similar, and is based on a weighted Laplacian matrix, together with an energy function capturing the energy storage at the nodes. We discuss two methods for structure-preserving model reduction. The first one is clustering; aggregating the nodes of the underlying graph to obtain a reduced graph. The second approach is based on neglecting the energy storage at some of the nodes, and subsequently eliminating those nodes (called Kron reduction).</p