Richard H. Middleton

Bio: Richard H. Middleton is an academic researcher from University of Newcastle. The author has contributed to research in topics: Control theory & Linear system. The author has an hindex of 48, co-authored 393 publications receiving 12037 citations. Previous affiliations of Richard H. Middleton include Hamilton Institute & University of California.

On the robustness of multivariable algebraic loops with sector nonlinearities

Abstract: The paper is motivated by multivariable 'anti-windup' schemes Such schemes are often described in a form that includes a multivariable algebraic loop Multivariable algebraic loops may be particularly problematic in terms of well-posedness (the existence and uniqueness of the solutions) and robust stability Conditions for well-posedness of such loops have been analysed previously Here we extend this analysis to consider robust stability of the algebraic loop with small time-delays It is shown that sufficient conditions for robustness of the algebraic loop can be directly incorporated into an LMI based static anti-windup controller synthesis In addition, an alternative implementation of the algebraic loop is shown to have robustness without altering the LMI set up

Best Achievable Tracking Performance in Sampled-Data Systems via LTI Controllers

Abstract: In this paper, we study the problem of tracking a step reference signal using sampled-data control systems. We are interested in the tracking performance, defined as the integral square of the tracking error response between the system's output and the reference input. This performance is deemed the best achievable by a sampled-data controller with a linear time-invariant discrete-time compensator if it is the minimal attainable by all such controllers that stabilize the system. Our primary objective is to investigate the fundamental tracking performance limit in sampled-data systems, and to understand whether and how sampling and hold in a sampled-data system may impose intrinsic barriers to performance. We consider two tracking performance measures, with one defined with respect to the unit step signal, and another with respect to a delayed step signal and averaged over one sampling period. We derive an analytical closed-form expression in each case for the best achievable performance. The results show that a performance loss is generally incurred in a sampled-data system, in comparison to the tracking performance achievable by analog controllers. This loss of performance, as so demonstrated by the expressions, is attributed to the non-minimum phase behaviors as well as the intersample effects generated by samplers and hold devices. Thus, sampled-data controllers do result in an additional performance limit, which is seen as a necessary tradeoff for other advantages offered by this class of controllers.

Integral control of port-Hamiltonian systems: non-passive outputs without coordinate transformation

Abstract: In this paper we present a method for the addition of integral action to non-passive outputs of a class of port-Hamiltonian systems. The proposed integral controller is a dynamic extension, constructed from the open loop system, such that the closed loop preserves the port-Hamiltonian form. It is shown that the controller is able to reject the effects of both matched and unmatched disturbances, preserving the regulation of the non-passive outputs. Previous solutions to this problem have relied on a change of coordinates whereas the presented solution is developed using the original state vector and, therefore, retains its physical interpretation. In addition, the resulting closed loop dynamics have a natural interpretation as a Control by Interconnection scheme.

Cell-Free Massive MIMO for Wireless Federated Learning

Abstract: This paper proposes a novel scheme for cell-free massive multiple-input multiple-output (CFmMIMO) networks to support any federated learning (FL) framework. This scheme allows each instead of all the iterations of the FL framework to happen in a large-scale coherence time to guarantee a stable operation of an FL process. To show how to optimize the FL performance using this proposed scheme, we consider an existing FL framework as an example and target FL training time minimization for this framework. An optimization problem is then formulated to jointly optimize the local accuracy, transmit power, data rate, and users' processing frequency. This mixed-timescale stochastic nonconvex problem captures the complex interactions among the training time, and transmission and computation of training updates of one FL process. By employing the online successive convex approximation approach, we develop a new algorithm to solve the formulated problem with proven convergence to the neighbourhood of its stationary points. Our numerical results confirm that the presented joint design reduces the training time by up to $55\%$ over baseline approaches. They also show that CFmMIMO here requires the lowest training time for FL processes compared with cell-free time-division multiple access massive MIMO and collocated massive MIMO.

Low order sampled data H/sub /spl infin// control using the delta operator and LMIs

Abstract: A procedure for H/sub /spl infin// optimization of low order controllers for discrete-time and sampled-data systems is presented in this paper. Generally, low order H/sub /spl infin// controllers may be achieved by solving bilinear matrix inequalities (BMIs). In this paper an iterative alternation between two LMIs gives a suboptimal solution. To avoid local minima in this search the initial controller is obtained by a frequency weighted controller reduction scheme, where the closed loop properties of a full order controller is taken into account. A minimal number of parameters in the state space realization of the controller also reduces the complexity and improves numerical robustness. The complete presentation is based on delta operator models, which shows a close relationship between the continuous- and discrete-time solutions. The sensitivity of the ordinary discrete-time shift operator LMI formulation to small sampling periods is also analyzed.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Machine learning

Abstract: Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Phd by thesis

Abstract: Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Principles of Neural Science

Abstract: I have developed "tennis elbow" from lugging this book around the past four weeks, but it is worth the pain, the effort, and the aspirin. It is also worth the (relatively speaking) bargain price. Including appendixes, this book contains 894 pages of text. The entire panorama of the neural sciences is surveyed and examined, and it is comprehensive in its scope, from genomes to social behaviors. The editors explicitly state that the book is designed as "an introductory text for students of biology, behavior, and medicine," but it is hard to imagine any audience, interested in any fragment of neuroscience at any level of sophistication, that would not enjoy this book. The editors have done a masterful job of weaving together the biologic, the behavioral, and the clinical sciences into a single tapestry in which everyone from the molecular biologist to the practicing psychiatrist can find and appreciate his or

Robust adaptive control

Abstract: 1. Introduction. Control System Design Steps. Adaptive Control. A Brief History. 2. Models for Dynamic Systems. Introduction. State-Space Models. Input/Output Models. Plant Parametric Models. Problems. 3. Stability. Introduction. Preliminaries. Input/Output Stability. Lyapunov Stability. Positive Real Functions and Stability. Stability of LTI Feedback System. Problems. 4. On-Line Parameter Estimation. Introduction. Simple Examples. Adaptive Laws with Normalization. Adaptive Laws with Projection. Bilinear Parametric Model. Hybrid Adaptive Laws. Summary of Adaptive Laws. Parameter Convergence Proofs. Problems. 5. Parameter Identifiers and Adaptive Observers. Introduction. Parameter Identifiers. Adaptive Observers. Adaptive Observer with Auxiliary Input. Adaptive Observers for Nonminimal Plant Models. Parameter Convergence Proofs. Problems. 6. Model Reference Adaptive Control. Introduction. Simple Direct MRAC Schemes. MRC for SISO Plants. Direct MRAC with Unnormalized Adaptive Laws. Direct MRAC with Normalized Adaptive Laws. Indirect MRAC. Relaxation of Assumptions in MRAC. Stability Proofs in MRAC Schemes. Problems. 7. Adaptive Pole Placement Control. Introduction. Simple APPC Schemes. PPC: Known Plant Parameters. Indirect APPC Schemes. Hybrid APPC Schemes. Stabilizability Issues and Modified APPC. Stability Proofs. Problems. 8. Robust Adaptive Laws. Introduction. Plant Uncertainties and Robust Control. Instability Phenomena in Adaptive Systems. Modifications for Robustness: Simple Examples. Robust Adaptive Laws. Summary of Robust Adaptive Laws. Problems. 9. Robust Adaptive Control Schemes. Introduction. Robust Identifiers and Adaptive Observers. Robust MRAC. Performance Improvement of MRAC. Robust APPC Schemes. Adaptive Control of LTV Plants. Adaptive Control for Multivariable Plants. Stability Proofs of Robust MRAC Schemes. Stability Proofs of Robust APPC Schemes. Problems. Appendices. Swapping Lemmas. Optimization Techniques. Bibliography. Index. License Agreement and Limited Warranty.