Controller certification

A modern problem from aerospace control involves the certification of a large set of potential controllers with either a single plant or a fleet of potential plant systems, with both plants and controllers being MIMO and, for the moment, linear. Experiments on a limited number of controller/plant pairs should establish the stability and a certain level of margin of the complete set. We consider this certification problem for a set of controllers and provide algorithms for selecting an efficient subset for testing. This is done for a finite set of candidate controllers and, at least for SISO plants, for compact infinite set. In doing this, the ν-gap metric will be the main tool. Computational examples are given, including one of certification of an aircraft engine controller. The overarching aim is to introduce truly MIMO margin calculations and to understand their efficacy in certifying stability over a set of controllers and in replacing legacy single-loop gain and phase margin calculations.     

A discrete-time stable controller for an omni-directional mobile robot based on an approximated model

An adaptive controller based on multi-input fuzzy rules emulated networks (MIFRENs) is introduced for omni-directional mobile robot systems in the discrete-time domain without any kinematic or dynamic models. An approximated model for unknown systems is developed by using two MIFRENs with an online learning algorithm in addition to the stability analysis. The main theorem in this model is proposed to guarantee closed-loop performance and system robustness for all adjustable parameters inside MIFRENs. The system is validated by an experimental setup with a FESTO omni-directional mobile robot called Robotino^®. The proposed algorithm is shown to have superior performance compared to that of an algorithm that uses only an embedded controller. The advantage of the MIFREN initial setting is verified comparing its results with those of a controller that is based on neural networks.     

Approximate dynamic programming-based approaches for input-output data-driven control of nonlinear processes

We propose two approximate dynamic programming (ADP)-based strategies for control of nonlinear processes using input-output data. In the first strategy, which we term ‘J-learning,’ one builds an empirical nonlinear model using closed-loop test data and performs dynamic programming with it to derive an improved control policy. In the second strategy, called ‘Q-learning,’ one tries to learn an improved control policy in a model-less manner. Compared to the conventional model predictive control approach, the new approach offers some practical advantages in using nonlinear empirical models for process control. Besides the potential reduction in the on-line computational burden, it offers a convenient way to control the degree of model extrapolation in the calculation of optimal control moves. One major difficulty associated with using an empirical model within the multi-step predictive control setting is that the model can be excessively extrapolated into regions of the state space where identification data were scarce or nonexistent, leading to performances far worse than predicted by the model. Within the proposed ADP-based strategies, this problem is handled by imposing a penalty term designed on the basis of local data distribution. A CSTR example is provided to illustrate the proposed approaches.     

Computation, approximation and stability of explicit feedback min-max nonlinear model predictive control

This paper presents an approximate multi-parametric Nonlinear Programming (mp-NLP) approach to explicit solution of feedback min-max NMPC problems for constrained nonlinear systems in the presence of bounded disturbances and/or parameter uncertainties. It is based on an orthogonal search tree structure of the state space partition and consists in constructing a piecewise nonlinear (PWNL) approximation to the optimal sequence of feedback control policies. Conditions guaranteeing the robust stability of the closed-loop system in terms of a finite l₂-gain are derived.     

Stability properties of reset systems

Stability properties for a class of reset systems, such as systems containing a Clegg integrator, are investigated. We present Lyapunov based results for verifying L₂ and exponential stability of reset systems. Our results generalize the available results in the literature and can be easily modified to cover L_p stability for arbitrary p∈[1,∞]. Several examples illustrate that introducing resets in a linear system may reduce the L₂ gain if the reset controller parameters are carefully tuned.     

Guaranteed robustness bounds for matched-disturbance nonlinear systems

This paper considers input affine nonlinear systems with matched disturbances and shows how to compute an a priori upper bound of the H_∞ attenuation level achieved by the optimal L₂ controller and the suboptimal H_∞ central controller. The case where the disturbance contains a constant term is also discussed. These bounds are shown to depend only on the function mapping the control input to the performance variable. This result is used to derive a robust control design for a special, but practically important, class of non-input affine nonlinear systems consisting of the series connection of a nonlinear state and input dependent map and of a nonlinear input affine dynamical system. Approximate inversion of the nonlinear static map leads to a robust control problem which fits into the framework. The effectiveness of the theoretical results is shown by its use for the robust control design of a diesel engine test bench.     

Anti-windup synthesis for linear control systems with input saturation: Achieving regional, nonlinear performance

In this paper, we present LMI-based synthesis tools for regional stability and performance of linear anti-windup compensators for linear control systems. We consider both static and dynamic compensators. Algorithms are developed that minimize the upper bound on the regional L₂ gain for exogenous inputs with L₂ norm bounded by a given value, and that minimize this upper bound with a guaranteed reachable set or domain of attraction. Based on the structure of the optimization problems, it is shown that for systems whose plants have poles in the closed left-half plane, plant-order dynamic anti-windup can achieve semiglobal exponential stability and finite L₂ gain for exogenous inputs with L₂ norm bounded by any finite value. The problems are studied in a general setting where the only requirement on the linear control system is well-posedness and internal stability. The effectiveness of the proposed techniques is illustrated with an example.     

Model-free Q-learning designs for linear discrete-time zero-sum games with application to H-infinity control

In this paper, the optimal strategies for discrete-time linear system quadratic zero-sum games related to the H-infinity optimal control problem are solved in forward time without knowing the system dynamical matrices. The idea is to solve for an action dependent value function Q(x,u,w) of the zero-sum game instead of solving for the state dependent value function V(x) which satisfies a corresponding game algebraic Riccati equation (GARE). Since the state and actions spaces are continuous, two action networks and one critic network are used that are adaptively tuned in forward time using adaptive critic methods. The result is a Q-learning approximate dynamic programming (ADP) model-free approach that solves the zero-sum game forward in time. It is shown that the critic converges to the game value function and the action networks converge to the Nash equilibrium of the game. Proofs of convergence of the algorithm are shown. It is proven that the algorithm ends up to be a model-free iterative algorithm to solve the GARE of the linear quadratic discrete-time zero-sum game. The effectiveness of this method is shown by performing an H-infinity control autopilot design for an F-16 aircraft.     

Supremum metric on the space of fuzzy sets and common fixed point theorems for fuzzy mappings

This paper generalizes a classical result about the space of bounded closed sets with the Hausdorff metric, and establishes the completeness of CB(X) with respect to the completeness of the metric space X, where CB(X) is the class of fuzzy sets with nonempty bounded closed α-cut sets, equipped with the supremum metric d_∞ which takes the supremum on the Hausdorff distances between the corresponding α-cut sets. In addition, some common fixed point theorems for fuzzy mappings are proved and two examples are given to illustrate the validity of the main results in fixed point theory.     

A distributed controller approach for delay-independent stability of networked control systems

This article introduces a novel distributed controller approach for networked control systems (NCS) to achieve finite gain L₂ stability independent of constant time delay. The proposed approach represents a generalization of the well-known scattering transformation which applies for passive systems only. The main results of this article are (a) a sufficient stability condition for general multi-input-multi-output (MIMO) input-feedforward-output-feedback-passive (IF-OFP) nonlinear systems and (b) a necessary and sufficient stability condition for linear time-invariant (LTI) single-input-single-output (SISO) systems. The performance advantages of the proposed approach are reduced sensitivity to time delay and improved steady state error compared to alternative known delay-independent small gain type approaches. Simulations validate the proposed approach.     

Robust model selection with flexible trimming

The forward search provides data-driven flexible trimming of a C_p statistic for the choice of regression models that reveals the effect of outliers on model selection. An informed robust model choice follows. Even in small samples, the statistic has a null distribution indistinguishable from an F distribution. Limits on acceptable values of the C_p statistic follow. Two examples of widely differing size are discussed. A powerful graphical tool is the generalized candlestick plot, which summarizes the information on all forward searches and on the choice of models. A comparison is made with the use of M-estimation in robust model choice.     

State feedback control of continuous-time T-S fuzzy systems via switched fuzzy controllers

This paper studies the problem of state feedback control of continuous-time T-S fuzzy systems. Switched fuzzy controllers are exploited in the control design, which are switched based on the values of membership functions, and the control scheme is an extension of the parallel distributed compensation (PDC) scheme. Sufficient conditions for designing switched state feedback controllers are obtained with meeting an H_∞ norm bound requirement and quadratic D stability constraints. It is shown that the new control design method provides less conservative results than the corresponding ones via the parallel distributed compensation (PDC) scheme. A numerical example is given to illustrate the effectiveness of the proposed method.     

Multi-frequency disturbance rejection via blending control technique for hard disk drives

This paper is concerned with the rejection of multiple narrowband disturbances in hard disk drives (HDDs). Inspired by a control blending idea, the multi-frequency disturbance rejection is formulated as a blending control problem. Each disturbance rejection is accomplished by using the H₂ optimal control method. Based on all H₂ optimal controllers, the blending technique is applied to yield a single controller which is capable of achieving rejection of all disturbances. Rejections of two and three disturbances for a 1.8-inch HDD VCM actuator are taken as application examples in the paper. Simulation and experimental results show that the ultimate controller results in a simultaneous attenuation of disturbances with frequencies higher or lower than the closed-loop system bandwidth. Moreover, the method turns out to be able to lift phase and thus prevent phase margin loss when it is used to deal with disturbances near bandwidth.     

Approximation capabilities of multilayer fuzzy neural networks on the set of fuzzy-valued functions

This paper first introduces a piecewise linear interpolation method for fuzzy-valued functions. Based on this, we present a concrete approximation procedure to show the capability of four-layer regular fuzzy neural networks to perform approximation on the set of all d_p continuous fuzzy-valued functions. This approach can also be used to approximate d_∞ continuous fuzzy-valued functions. An example is given to illustrate the approximation procedure.     

A subband coding approach to control under limited data rates and message losses

For the design of networked control systems, we employ a subband coding technique to efficiently use the available data rate. Such coding schemes have widely been used in signal processing for data compression. We take an approach suitable from the control perspective in that frequency characteristics of a controller are directly used. In particular, we propose a three-step design procedure for the overall controller having the following features: On the coder side, it uses a controller consisting of a filter bank whose outputs are subband signals of the control input. On the decoder side is another filter bank for reconstruction of the subband signals. This decoder is capable to account for random message losses that occur in communication and is designed via an H^∞-type method. For the quantizers in the coder, an efficient bit allocation scheme is also developed.     

Likelihood-free Bayesian estimation of multivariate quantile distributions

In this paper, we present new multivariate quantile distributions and utilise likelihood-free Bayesian algorithms for inferring the parameters. In particular, we apply a sequential Monte Carlo (SMC) algorithm that is adaptive in nature and requires very little tuning compared with other approximate Bayesian computation algorithms. Furthermore, we present a framework for the development of multivariate quantile distributions based on a copula. We consider bivariate and time series extensions of the g-and-k distribution under this framework, and develop an efficient component-wise updating scheme free of likelihood functions to be used within the SMC algorithm. In addition, we trial the set of octiles as summary statistics as well as functions of these that form robust measures of location, scale, skewness and kurtosis. We show that these modifications lead to reasonably precise inferences that are more closely comparable to computationally intensive likelihood-based inference. We apply the quantile distributions and algorithms to simulated data and an example involving daily exchange rate returns.     

Online computation with advice

We consider a model for online computation in which the online algorithm receives, together with each request, some information regarding the future, referred to as advice. The advice is a function, defined by the online algorithm, of the whole request sequence. The advice provided to the online algorithm may allow an improvement in its performance, compared to the classical model of complete lack of information regarding the future. We are interested in the impact of such advice on the competitive ratio, and in particular, in the relation between the size b of the advice, measured in terms of bits of information per request, and the (improved) competitive ratio. Since b=0 corresponds to the classical online model, and b=⌈log∣A∣⌉, where A is the algorithm’s action space, corresponds to the optimal (offline) one, our model spans a spectrum of settings ranging from classical online algorithms to offline ones.In this paper we propose the above model and illustrate its applicability by considering two of the most extensively studied online problems, namely, metrical task systems (MTS) and the k-server problem. For MTS we establish tight (up to constant factors) upper and lower bounds on the competitive ratio of deterministic and randomized online algorithms with advice for any choice of 1≤b≤Θ(logn), where n is the number of states in the system: we prove that any randomized online algorithm for MTS has competitive ratio Ω(log(n)/b) and we present a deterministic online algorithm for MTS with competitive ratio O(log(n)/b). For the k-server problem we construct a deterministic online algorithm for general metric spaces with competitive ratio k^O(1/b) for any choice of Θ(1)≤b≤logk.     

Robust PID controller tuning based on the constrained particle swarm optimization

This paper proposes a novel tuning strategy for robust proportional-integral-derivative (PID) controllers based on the augmented Lagrangian particle swarm optimization (ALPSO). First, the problem of PID controller tuning satisfying multiple H_∞ performance criteria is considered, which is known to suffer from computational intractability and conservatism when any existing method is adopted. In order to give some remedy to such a design problem without using any complicated manipulations, the ALPSO based robust gain tuning scheme for PID controllers is introduced. It does not need any conservative assumption unlike the conventional methods, and often enables us to find the desired PID gains just by solving the constrained optimization problem in a straightforward way. However, it is difficult to guarantee its effectiveness in a theoretical way, because PSO is essentially a stochastic approach. Therefore, it is evaluated by several simulation examples, which demonstrate that the proposed approach works well to obtain PID controller parameters satisfying the multiple H_∞ performance criteria.     

Bayesian analysis of semiparametric reproductive dispersion mixed-effects models

Semiparametric reproductive dispersion mixed-effects model (SPRDMM) is an extension of the reproductive dispersion model and the semiparametric mixed model, and it includes many commonly encountered models as its special cases. A Bayesian procedure is developed for analyzing SPRDMMs on the basis of P-spline estimates of nonparametric components. A hybrid algorithm combining the Gibbs sampler and the Metropolis-Hastings algorithm is used to simultaneously obtain the Bayesian estimates of unknown parameters, smoothing function and random effects, as well as their standard error estimates. The Bayes factor for model comparison is employed to select better approximation of the smoothing function via path sampling. Several simulation studies and a real example are used to illustrate the proposed methodologies.