Filtering based parameter estimation for observer canonical state space systems with colored noise

This paper surveys the identification of observer canonical state space systems affected by colored noise. By means of the filtering technique, a filtering based recursive generalized extended least squares algorithm is proposed for enhancing the parameter identification accuracy. To ease the computational burden, the filtered regressive model is separated into two fictitious sub-models, and then a filtering based two-stage recursive generalized extended least squares algorithm is developed on the basis of the hierarchical identification. The stochastic martingale theory is applied to analyze the convergence of the proposed algorithms. An experimental example is provided to validate the proposed algorithms.     

Combined state and parameter estimation for a bilinear state space system with moving average noise

This paper considers the identification problem of bilinear systems with measurement noise in the form of the moving average model. In particular, we present an interactive estimation algorithm for unmeasurable states and parameters based on the hierarchical identification principle. For unknown states, we formulate a novel bilinear state observer from input-output measurements using the Kalman filter. Then a bilinear state observer based multi-innovation extended stochastic gradient (BSO-MI-ESG) algorithm is proposed to estimate the unknown system parameters. A linear filter is utilized to improve the parameter estimation accuracy and a filtering based BSO-MI-ESG algorithm is presented using the data filtering technique. In the numerical example, we illustrate the effectiveness of the proposed identification methods.     

Gradient-based iterative identification method for multivariate equation-error autoregressive moving average systems using the decomposition technique

This paper studies the parameter estimation problems of multivariate equation-error autoregressive moving average systems. Firstly, a gradient-based iterative algorithm is presented as a comparison. In order to improve the computational efficiency and the parameter estimation accuracy, a decomposition-based gradient iterative algorithm is presented by using the decomposition technique. The key is to transform an original system into two subsystems and to estimate the parameters of each subsystem, respectively. Compared with the gradient-based iterative algorithm, the decomposition-based algorithm requires less computational efforts, and the simulation results indicate that this algorithm is effective.     

Data filtering based maximum likelihood extended gradient method for multivariable systems with autoregressive moving average noise

For multivariable systems with autoregressive moving average noises, we decompose the multivariable system into m subsystems (m denotes the number of outputs) and present a maximum likelihood generalized extended gradient algorithm and a data filtering based maximum likelihood extended gradient algorithm to estimate the parameter vectors of these subsystems. By combining the maximum likelihood principle and the data filtering technique, the proposed algorithms are effective and have computational advantages over existing estimation algorithms. Finally, a numerical simulation example is given to support the developed methods and to show their effectiveness.     

Recursive parameter estimation algorithm for multivariate output-error systems

In this paper, we consider the parameter estimation issues of a class of multivariate output-error systems. A decomposition based recursive least squares identification method is proposed using the hierarchical identification principle and the auxiliary model idea, and its convergence is analyzed through the stochastic process theory. Compared with the existing results on parameter estimation of multivariate output-error systems, a distinct feature for the proposed algorithm is that such a system is decomposed into several sub-systems with smaller dimensions so that parameters to be identified can be estimated interactively. The analysis shows that the estimation errors converge to zero in mean square under certain conditions. Finally, in order to show the effectiveness of the proposed approach, some numerical simulations are provided.     

Maximum likelihood recursive least squares estimation for multivariate equation-error ARMA systems

This paper focuses on the parameter estimation problems of multivariate equation-error systems. A recursive generalized extended least squares algorithm is presented as a comparison. Based on the maximum likelihood principle and the coupling identification concept, the multivariate equation-error system is decomposed into several regressive identification models, each of which has only a parameter vector, and a coupled subsystem maximum likelihood recursive least squares identification algorithm is developed for estimating the parameter vectors of these submodels. The simulation example shows that the proposed algorithm is effective and has high estimation accuracy.     

Auxiliary model based recursive generalized least squares identification algorithm for multivariate output-error autoregressive systems using the decomposition technique

This paper focuses on the parameter estimation problem of multivariate output-error autoregressive systems. Based on the decomposition technique and the auxiliary model identification idea, we derive a decomposition based auxiliary model recursive generalized least squares algorithm. The key is to divide the system into two fictitious subsystems, the one including a parameter vector and the other including a parameter matrix, and to estimate the two subsystems using the recursive least squares method, respectively. Compared with the auxiliary model based recursive generalized least squares algorithm, the proposed algorithm has less computational burden. Finally, an illustrative example is provided to verify the effectiveness of the proposed algorithms.     

Soft sensor modeling with a selective updating strategy for Gaussian process regression based on probabilistic principle component analysis

Considering the deviation of the working condition and the high updating frequency of the traditional moving window methods, this paper proposes a selective strategy of moving window for the Gaussian process regression in the latent probabilistic component space. First, the probabilistic principle component analysis (PPCA) is employed to deal with the multi-dimensional issue and extract essential information of the process data. Because the latent probabilistic components are more sensitive to the deviation of the working condition in the industrial process than the original data, the regression performance is improved under the PPCA framework. Under the proposed strategy, the soft sensor is able to detect the change of the working condition, and the updating is activated only when the predicted error exceeds the preset threshold, otherwise the model is kept unchanged. Furthermore, the promotion of both predicted accuracy and efficiency can be obtained by regulating the threshold. To test the effectiveness of the proposed method, a wastewater case study is provided, and the result shows that the proposed strategy works better under the probabilistic than other conventional methods.     

Event-triggered H∞ filtering control for a class of distributed parameter systems with Markovian switching topology

The H_∞ filtering problem for distributed parameter systems with stochastic switching topology is investigated in this paper based on event-triggered control scheme. The switching topology which subjects to a Markovian chain is considered in filter design because of the communication uncertainty of practical networks. An event-triggered mechanism as a sampling scheme is developed aiming at the benefit of reducing the computation load or saving the limited network resources. Based on some novel integral inequalities, the improved delayed method is proposed for the H_∞ filtering control problem with event-triggered scheme. Moreover, by employing stochastic stability theory, filters with Markovian jump parameters are designed to guarantee that the stochastically mean square stability and H_∞ performance of the underlying error system. Finally, in order to illustrate the applicability of the obtained results, numerical examples are presented.     

A hierarchical least squares identification algorithm for Hammerstein nonlinear systems using the key term separation

Mathematical models are basic for designing controller and system identification is the theory and methods for establishing the mathematical models of practical systems. This paper considers the parameter identification for Hammerstein controlled autoregressive systems. Using the key term separation technique to express the system output as a linear combination of the system parameters, the system is decomposed into several subsystems with fewer variables, and then a hierarchical least squares (HLS) algorithm is developed for estimating all parameters involving in the subsystems. The HLS algorithm requires less computation than the recursive least squares algorithm. The computational efficiency comparison and simulation results both confirm the effectiveness of the proposed algorithms.     

Understanding the topic evolution of scientific literatures like an evolving city: Using Google Word2Vec model and spatial autocorrelation analysis

Topic evolution has been described by many approaches from a macro level to a detail level, by extracting topic dynamics from text in literature and other media types. However, why the evolution happens is less studied. In this paper, we focus on whether and how the keyword semantics can invoke or affect the topic evolution. We assume that the semantic relatedness among the keywords can affect topic popularity during literature surveying and citing process, thus invoking evolution. However, the assumption is needed to be confirmed in an approach that fully considers the semantic interactions among topics. Traditional topic evolution analyses in scientometric domains cannot provide such support because of using limited semantic meanings. To address this problem, we apply the Google Word2Vec, a deep learning language model, to enhance the keywords with more complete semantic information. We further develop the semantic space as an urban geographic space. We analyze the topic evolution geographically using the measures of spatial autocorrelation, as if keywords are the changing lands in an evolving city. The keyword citations (keyword citation counts one when the paper containing this keyword obtains a citation) are used as an indicator of keyword popularity. Using the bibliographical datasets of the geographical natural hazard field, experimental results demonstrate that in some local areas, the popularity of keywords is affecting that of the surrounding keywords. However, there are no significant impacts on the evolution of all keywords. The spatial autocorrelation analysis identifies the interaction patterns (including High-High leading, High-Low suppressing) among the keywords in local areas. This approach can be regarded as an analyzing framework borrowed from geospatial modeling. Moreover, the prediction results in local areas are demonstrated to be more accurate if considering the spatial autocorrelations.     

A new distributed Kalman filtering based on means-quare estimation upper bounds

In this paper, a novel distributed Kalman filter consisting of a bank of interlaced filters is proposed for a signal model whose dynamic equation and measurement equation are coupled. Each of the interlaced filters estimates a part of state rather than the global state using its and its neighbor information, which is different from other distributed filters already existed (e.g., distributed Kalman filter based on diffusion strategy or consensus strategy, distributed fuzzy filter and distributed particle filter with Gaussian mixer approximation, etc). This relieves the calculation and communication burden in networks. In addition, the proposed distributed Kalman filtering contains no consensus strategies, which is useful in some cases since consensus usually requires an infinite number of iterations.     

Composite anti-disturbance control for uncertain Markovian jump systems with actuator saturation based disturbance observer and adaptive neural network

This paper studies the problem of composite control for a class of uncertain Markovian jump systems (MJSs) with partial known transition rates, multiple disturbances and actuator saturation. Compared with the existing results, a novel robust composite control scheme is put forward by virtue of adaptive neural network technique. For MJSs, the partial unknown information on transition rates and the actuator saturation influence the design of disturbance observer and the robust H_∞ controller. Firstly, without taking account of external disturbances, the network reconstruction error and saturation, a novel robust adaptive control strategy is established to ensure that all the signals of the closed-loop system are asymptotically bounded in mean square. Secondly, the solvability condition for ensuring the robust H_∞ performance is given by using a modified adaptive law, where the saturation is treated as a disturbance-like signal. Finally, the simulations for a numerical example and an application example are performed to validate the effectiveness of the proposed results.     

Dissipative filtering for singular Markov jump systems with generally uncertain transition rates via new integral inequality approach

This paper considers the problem of dissipative filtering problem for singular Markov jump systems with time-varying delay and generally uncertain transition rates. Firstly, by tuning the improved integral inequality and Wirtinger-based integral inequalities, a sufficient condition is derived to guarantee that the considered system is regular, impulse-free, stochastically stable with the dissipation performance. Then, based on the derived condition, and applying linear matrix inequalities (LMIs) techniques, the filter is synthesized. Finally, some numerical examples are given to illustrate the effectiveness of the obtained theoretic results.     

Chaos control of the permanent magnet synchronous motor with time-varying delay by using adaptive sliding mode control based on DSC

This paper focuses on the problem of chaos control for the permanent magnet synchronous motor with chaotic oscillation, unknown dynamics and time-varying delay by using adaptive sliding mode control based on dynamic surface control. To reveal the mechanism of motor system and facilitate controller design, the dynamic behavior of the system is investigated. Nonlinear items of system model, upper bounds of time delays and their derivatives are taken as unknown in the overall process. A RBF neural network with an adaptive law, which eliminates restrictions on accurate model and parameters, is employed to cope with unknown dynamics. In order to solve issues such as chaotic oscillation, ‘explosion of complexity’ of backstepping, and chattering associated with sliding mode control, a sliding mode controller is developed within the framework of dynamic surface control by the hybrid of adaptive technology and RBF neural network. In addition, an appropriate Lyapunov function is employed to demonstrate the system stability. Finally, the feasibility of the proposed scheme is testified by simulation.     

Consensus analysis for multi-agent systems via periodic event-triggered algorithms with quantized information

In this article, a novel distributed event-triggered control protocol for the consensus of second-order multi-agent systems with undirected topology is studied. Based on the proposed control protocol, the event-triggered condition is evaluated only at every sampling instant. The control input for each agent will be updated with local information if and only if its condition is violated. Both ideal and quantized relative state measurements are considered under this framework. Some sufficient conditions for achieving consensus are derived using spectral properties of edge Laplacian matrix and the discrete-time Lyapunov function method. Finally, numerical examples are given to demonstrate the effectiveness of our theoretical results.     

Stochastic consensus of discrete-time second-order multi-agent systems with measurement noises and time delays

We study the consensus control of discrete-time second-order multi-agents systems with time delays and multiplicative noises, where the consensus protocol is designed by both the local relative position measurements and each agent’s absolute velocity. Due to the existence of time delays and multiplicative noises, the classical methods for deterministic models with time delays cannot work. In this paper, we apply stochastic stability theorem of discrete-time stochastic delay equations to find some explicit sufficient conditions for both mean square and almost sure consensus. It is proven that for any given noise intensities and time delays, the second-order multi-agent consensus can be achieved by choosing appropriate control gains in the relative position measurement and absolute velocity, respectively. Numerical simulation is given to demonstrate the effectiveness of the proposed protocols as well as the theoretical results.     

Adaptive synchronization of multi-agent systems via variable impulsive control

This paper mainly focuses on the adaptive synchronization problem of multi-agent systems via distributed impulsive control method. Different from the existing investigations of impulsive synchronization with fixed time impulsive inputs, the proposed distributed variable impulsive protocol allows that the impulsive inputs are chosen within a time period (namely impulsive time window) which can be described by the distances of the left (right) endpoints or the centers between two adjacent impulsive time windows. Obviously, this kind of flexible control scheme is more effective in practical systems (especially for the complex environment with physical restrictions). Moreover, the proposed adaptive control technique is helpful to solve the problem with uncertain system parameters. By means of Lyapunov stability theory, impulsive differential equations and adaptive control technique, three sufficient impulsive consensus conditions are given to realize the synchronization of a class of multi-agent nonlinear systems. Finally, two numerical simulations are provided to illustrate the validity of the theoretical analysis.     

Adaptive fault-tolerant control for a class of nonlinear multi-agent systems with actuator faults

This paper considers the distributed adaptive fault-tolerant control problem for linear multi-agent systems with matched unknown nonlinear functions and actuator bias faults. By using fuzzy logic systems to approximate the unknown nonlinear function and constructing a local observer to estimate the states, an effective distributed adaptive fault-tolerant controller is developed. Furthermore, different from the traditional method to estimate the weight matrix, only the weight vector needs to be estimated by exchanging the order of weight vectors and fuzzy basis functions in the fuzzy logic systems. In contrast to the existing results, the assumption that the dimensions of input vector and output vector are equal is removed. In addition, it is proved that the proposed control protocol guarantees all signals in the closed-loop systems are bounded and all agents converge to the leader with bounded residual errors. Finally, simulation examples are given to illustrate the effectiveness of the proposed method.