Zhongsheng Hou

Bio: Zhongsheng Hou is an academic researcher from Qingdao University. The author has contributed to research in topics: Iterative learning control & Adaptive control. The author has an hindex of 38, co-authored 289 publications receiving 6495 citations. Previous affiliations of Zhongsheng Hou include National University of Singapore & University of Cyprus.

Data-Driven Model-Free Adaptive Control for a Class of MIMO Nonlinear Discrete-Time Systems

Abstract: In this paper, a data-driven model-free adaptive control (MFAC) approach is proposed based on a new dynamic linearization technique (DLT) with a novel concept called pseudo-partial derivative for a class of general multiple-input and multiple-output nonlinear discrete-time systems. The DLT includes compact form dynamic linearization, partial form dynamic linearization, and full form dynamic linearization. The main feature of the approach is that the controller design depends only on the measured input/output data of the controlled plant. Analysis and extensive simulations have shown that MFAC guarantees the bounded-input bounded-output stability and the tracking error convergence.

A Novel Data-Driven Control Approach for a Class of Discrete-Time Nonlinear Systems

Abstract: In this work, a novel data-driven control approach, model-free adaptive control, is presented based on a new dynamic linearization technique for a class of discrete-time single-input and single-output nonlinear systems. The main feature of the approach is that the controller design depends merely on the input and the output measurement data of the controlled plant. The theoretical analysis shows that the approach guarantees the bounded input and bounded output stability and tracking error monotonic convergence. The comparison experiments verify the effectiveness of the proposed approach.

Automatic Train Control System Development and Simulation for High-Speed Railways

Abstract: Research and development on high-speed railway systems and particularly its automatic control systems, are introduced. Numerical modeling of high-speed trains in the Chinese high-speed train system and its associate automatic control systems are described in detail. Moreover, modeling and simulation of train operation systems are analyzed and demonstrated.

On Model-Free Adaptive Control and Its Stability Analysis

Abstract: In this paper, the main issues of model-based control methods are first reviewed, followed by the motivations and the state of the art of the model-free adaptive control (MFAC). MFAC is a novel data-driven control method for a class of unknown nonaffine nonlinear discrete-time systems since neither explicit physical model nor Lyapunov stability theory or key technical lemma is used in the controller design and theoretical analysis except only for the input/output (I/O) measurement data. The basis of MFAC is the dynamic linearization data modeling method at each operating point of the closed-loop system. The established dynamic linearization data model is a virtual equivalent data relationship in the I/O sense to the original nonlinear plant by means of a novel concept called pseudo-partial derivative (PPD) or pseudo-gradient (PG) vector. Based on this virtual equivalent dynamic linearization data model and the time-varying PPD or PG estimation algorithm designed merely using the I/O measurements of a controlled plant, the MFAC system is constructed. The main contribution of this paper is that the theoretical analysis of the bounded-input bounded-output stability, the monotonic convergence of the tracking error dynamics, and the internal stability of the full form dynamic linearization based MFAC scheme are rigorously presented by the contraction mapping principle; the well known PID control and the traditional adaptive control for linear time-invariant systems are explicitly shown as the special cases of this MFAC. The simulation results verify the effectiveness of the proposed approach.

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.).

Pattern Recognition and Machine Learning

Abstract: Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Iterative Learning Control: Brief Survey and Categorization

Abstract: In this paper, the iterative learning control (ILC) literature published between 1998 and 2004 is categorized and discussed, extending the earlier reviews presented by two of the authors. The papers includes a general introduction to ILC and a technical description of the methodology. The selected results are reviewed, and the ILC literature is categorized into subcategories within the broader division of application-focused and theory-focused results.

The sector bound approach to quantized feedback control | NOVA. The University of Newcastle's Digital Repository

Abstract: This paper studies a number of quantized feedback design problems for linear systems. We consider the case where quantizers are static (memoryless). The common aim of these design problems is to stabilize the given system or to achieve certain performance with the coarsest quantization density. Our main discovery is that the classical sector bound approach is nonconservative for studying these design problems. Consequently, we are able to convert many quantized feedback design problems to well-known robust control problems with sector bound uncertainties. In particular, we derive the coarsest quantization densities for stabilization for multiple-input-multiple-output systems in both state feedback and output feedback cases; and we also derive conditions for quantized feedback control for quadratic cost and H/sub /spl infin// performances.