Matching conditions for stability analysis of nonlinear feedback control systems

The differential geometry approach for exact input-output linearizable nonlinear systems usually results in a complicated nonlinear controller that is difficult to implement. To overcome this difficulty, we propose to approximate the nonlinear controller by a canonical piecewise linear expression within an allowable error bound. This design procedure can reduce a tremendous amount of computation in the design and the synthesis. The resulting controller turns out to be fairly simple in general and can achieve many performance specifications. Some sufficient conditions for guaranteeing the closed-loop system stability using this controller design method is derived in the present paper. An application to a chemical reactor system is also briefly discussed.     

Quantized-states-based adaptive control against unknown slippage effects of uncertain mobile robots with input and state quantization

An adaptive tracking design strategy based on quantized state feedback is developed for uncertain nonholonomic mobile robots with unknown wheel slippage effects. All state variables and control torques are assumed to be quantized by the state and input quantizers, respectively, in a network control environment. Thus, the quantized state feedback information is only available for the tracking control design. An approximation-based adaptive controller using quantized states is recursively designed to ensure the robust adaptive tracking against unknown wheel slippage effects where the quantized-states-based adaptive mechanism is derived to compensate for unknown wheel slippage effects, system nonlinearities, and quantization errors. The boundedness of the quantization errors and estimated parameters in the closed-loop system is analyzed by presenting some theoretical lemmas. Based on these lemmas, we prove the uniform ultimate boundedness of closed-loop signals and the convergence of the trajectory tracking error in the presence of wheel slippage effects. Simulations verify the effectiveness of the resulting tracking scheme.     

Fuzzy guaranteed cost controller for trajectory tracking in nonlinear systems

In this paper, we propose a fuzzy logic based guaranteed cost controller for trajectory tracking in nonlinear systems. Takagi–Sugeno (T–S) fuzzy model is used to represent the dynamics of a nonlinear system and the controller design is carried out using this fuzzy model. State feedback law is used for building the fuzzy controller whose performance is evaluated using a quadratic cost function. For designing the fuzzy logic based controller which satisfies guaranteed performance, linear matrix inequality (LMI) approach is used. Sufficient conditions are derived in terms of matrix inequalities for minimizing the performance function of the controller. The performance function minimization problem with polynomial matrix inequalities is then transformed into a problem of minimizing a convex performance function involving standard LMIs. This minimization problem can be solved easily and efficiently using the LMI optimization techniques. Our controller design method also ensures that the closed-loop system is asymptotically stable. Simulation study is carried out on a two-link robotic manipulator tracking a reference trajectory. From the results of the simulation study, it is observed that our proposed controller tracks the reference trajectory closely while maintaining a guaranteed minimum cost.     

Composite nonlinear feedback based discrete integral sliding mode controller for uncertain systems

In this paper, a discrete integral sliding mode (ISM) controller based on composite nonlinear feedback (CNF) method is proposed. The aim of the controller is to improve the transient performance of uncertain systems. The CNF based discrete ISM controller consists of a linear and a nonlinear term. The linear control law is used to decrease the damping ratio of the closed-loop system for yielding a quick transient response. The nonlinear feedback control law is used to increase the damping ratio with an aim to reduce the overshoot of the closed-loop system as it approaches the desired reference position. It is observed that the discrete CNF-ISM controller produces superior transient performance as compared to the discrete ISM controller. The closed-loop control system remains stable during the sliding condition. Simulation results demonstrate the effectiveness of the proposed controller.     

Dual-Sampling-Rate Moving-Horizon Control of a Class of Linear Systems with Input Saturation and Plant Uncertainty

Moving-horizon control is a type of sampled-data feedback control in which the control over each sampling interval is determined by the solution of an open-loop optimal control problem. We develop a dual-sampling-rate moving-horizon control scheme for a class of linear, continuous-time plants with strict input saturation constraints in the presence of plant uncertainty and input disturbances. Our control scheme has two components: a slow-sampling moving-horizon controller for a nominal plant and a fast-sampling state-feedback controller whose function is to force the actual plant to emulate the nominal plant. The design of the moving-horizon controller takes into account the nonnegligible computation time required to compute the optimal control trajectory.We prove the local stability of the resulting feedback system and illustrate its performance with simulations. In these simulations, our dual-sampling-rate controller exhibits performance that is considerably superior to its single-sampling-rate moving-horizon controller counterpart.     

An efficient generalized least squares algorithm for periodic trended regression with autoregressive errors

Time series data with periodic trends like daily temperatures or sales of seasonal products can be seen in periods fluctuating between highs and lows throughout the year. Generalized least squares estimators are often computed for such time series data as these estimators have minimum variance among all linear unbiased estimators. However, the generalized least squares solution can require extremely demanding computation when the data is large. This paper studies an efficient algorithm for generalized least squares estimation in periodic trended regression with autoregressive errors. We develop an algorithm that can substantially simplify generalized least squares computation by manipulating large sets of data into smaller sets. This is accomplished by coining a structured matrix for dimension reduction. Simulations show that the new computation methods using our algorithm can drastically reduce computing time. Our algorithm can be easily adapted to big data that show periodic trends often pertinent to economics, environmental studies, and engineering practices.     

Suboptimal feedback control of linear periodic systems

A method is developed for the approximate design of an optimal state regulator for a linear periodically varying system with quadratic performance index. The periodic term is taken to be a perturbation to the system. By making use of a power-series expansion in a small parameter, associated with periodic terms, a set of matrix equations is derived for determining successively a feedback gain. Given periodic terms of a Fourier-series form, explicit solutions are obtained for those matrix equations. A sufficient condition for existence and periodicity of the solution is also shown. Further, the performance degradation resulting from a truncation of the power-series solution is investigated. The method may effectively be used in a computer-programmed computation.     

A direct error analysis for least squares

A direct error analysis is given for orthogonal factorization methods for calculating the least squares solution of an overdetermined system of linear equations. The direct method has the interesting advantage in that it permits the separation of errors occurring in the transformation and back-substitution phases of solution. This shows the partial elimination of potentially significant terms occurring in different stages of the algorithm. Presumably it is prudent to minimize the error at each stage of the algorithm, so it is significant that numerical evidence shows column pivoting can reduce the magnitude of these terms. This is offered as an explanation for the common observation that column pivoting is beneficial in least squares calculations. We also summarize the corresponding error analysis for the calculation of the minimum norm solution of an underdetermined system using orthogonal transformations.     

Suboptimal Explicit Receding Horizon Control via Approximate Multiparametric Quadratic Programming

Algorithms for solving multiparametric quadratic programming (MPQP) were recently proposed in Refs. 1–2 for computing explicit receding horizon control (RHC) laws for linear systems subject to linear constraints on input and state variables. The reason for this interest is that the solution to MPQP is a piecewise affine function of the state vector and thus it is easily implementable online. The main drawback of solving MPQP exactly is that, whenever the number of linear constraints involved in the optimization problem increases, the number of polyhedral cells in the piecewise affine partition of the parameter space may increase exponentially. In this paper, we address the problem of finding approximate solutions to MPQP, where the degree of approximation is arbitrary and allows to tradeoff between optimality and a smaller number of cells in the piecewise affine solution. We provide analytic formulas for bounding the errors on the optimal value and the optimizer, and for guaranteeing that the resulting suboptimal RHC law provides closed-loop stability and constraint fulfillment.     

Robust multivariable implicit self-tuning control

A robust multivariable linear quadratic implicit self-tuningalgorithm is presented. It is shown that the closed-loop outputerror is bounded for multiplicative modelling uncertainty, providedthat all the unstable zeros of the plant are captured in thenominal model. The algorithm can be applied to nonminimum-phasesystems, and does not require the explicit solution of the algebraicmatrix polynomial equation. The controller parameters are directlyestimated from two implicit prediction models which containthe plant and controller parameters in bilinear form. The stability analysis is performed by applying conic-sectortheory to a new error equation which is decomposed into twocomponents embodying a linear and non-linear operator, namelythe modelling uncertainty and the parameter estimator respectively.Simulation results are presented to demonstrate the performanceof the proposed adaptive controller.     

有限时间迭代学习控制

针对任意初态情形, 借助于初始修正吸引子的概念,讨论不确定时变系统能够达到实际完全跟踪性能的迭代学习控制方法.闭环系统中含有限时间控制作用, 在预先指定的区间上实现零误差跟踪,且起始段的系统输出轨迹也可预先规划.分别讨论部分限幅学习与完全限幅学习, 证明闭环系统中各变量的一致有界性以及误差序列的一致收敛性. 变量有界性证明得益于提出的限幅学习算法,特别是完全限幅学习算法可确保参数估值的变化范围.     

Nonlinear feedback controllers and compensators: a state-dependent Riccati equation approach

State-dependent Riccati equation (SDRE) techniques are rapidly emerging as general design and synthesis methods of nonlinear feedback controllers and estimators for a broad class of nonlinear regulator problems. In essence, the SDRE approach involves mimicking standard linear quadratic regulator (LQR) formulation for linear systems. In particular, the technique consists of using direct parameterization to bring the nonlinear system to a linear structure having state-dependent coefficient matrices. Theoretical advances have been made regarding the nonlinear regulator problem and the asymptotic stability properties of the system with full state feedback. However, there have not been any attempts at the theory regarding the asymptotic convergence of the estimator and the compensated system. This paper addresses these two issues as well as discussing numerical methods for approximating the solution to the SDRE. The Taylor series numerical methods works only for a certain class of systems, namely with constant control coefficient matrices, and only in small regions. The interpolation numerical method can be applied globally to a much larger class of systems. Examples will be provided to illustrate the effectiveness and potential of the SDRE technique for the design of nonlinear compensator-based feedback controllers.     

Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations

Many problems arising in different fields of science and engineering can be reduced, by applying some appropriate discretization, either to a system of linear algebraic equations or to a sequence of such systems. The solution of a system of linear algebraic equations is very often the most time-consuming part of the computational process during the treatment of the original problem, because these systems can be very large (containing up to many millions of equations). It is, therefore, important to select fast, robust and reliable methods for their solution, also in the case where fast modern computers are available. Since the coefficient matrices of the systems are normally sparse (i.e. most of their elements are zeros), the first requirement is to efficiently exploit the sparsity. However, this is normally not sufficient when the systems are very large. The computation of preconditioners based on approximate LU-factorizations and their use in the efforts to increase further the efficiency of the calculations will be discussed in this paper. Computational experiments based on comprehensive comparisons of many numerical results that are obtained by using ten well-known methods for solving systems of linear algebraic equations (the direct Gaussian elimination and nine iterative methods) will be reported. Most of the considered methods are preconditioned Krylov subspace algorithms.     

单A直和子空间

引入单直和子空间的概念,证明了线性空间可唯一分解为单直和子空间的直和,并且给出了计算方法.     

Robust adaptive control of linear time-delay systems with point time-varying delays via multiestimation

This paper presents an adaptive pole-placement based controller for continuous-time linear systems with unknown and eventually time-varying point delays under uncertainties consisting of unmodeled dynamics and eventual bounded disturbances. A multiestimation scheme is designed for improving the identification error performance and then to deal with possibly errors between the true basic delay compared to that used in regressor vector of measurements of the adaptive scheme and also to prevent the closed-loop system against potential instability. Each estimation scheme in the parallel disposal possesses a relative dead-zone which freezes the adaptation process for small sizes of the adaptation error compared to the estimated size of the absolute value of the contribution of the uncertainties to the filtered output versus time. All the estimation schemes run in parallel but only that which is currently in operation parameterizes the adaptive controller to generate the plant input at each time. A supervisor chooses the appropriate estimator in real time which respects a prescribed minimum residence time at each estimation algorithm in operation. That strategy is the main tool used to ensure the closed-loop stability under estimates switching. The relative dead-zone in the adaptation mechanism prevents the closed-loop system against potential instability caused by uncertainties.     

Stability and Accuracy of Inexact Interior Point Methods for Convex Quadratic Programming

We consider primal–dual interior point methods where the linear system arising at each iteration is formulated in the reduced (augmented) form and solved approximately. Focusing on the iterates close to a solution, we analyze the accuracy of the so-called inexact step, i.e., the step that solves the unreduced system, when combining the effects of both different levels of accuracy in the inexact computation and different processes for retrieving the step after block elimination. Our analysis is general and includes as special cases sources of inexactness due either to roundoff and computational errors or to the iterative solution of the augmented system using typical procedures. In the roundoff case, we recover and extend some known results.     

Unified Gradient Approach to Performance Optimization Under a Pole Assignment Constraint

General closed-loop performance optimization problems with pole assignment constraint are considered in this paper under a unified framework. By introducing a free-parameter matrix and a matrix function based on the solution of a Sylvester equation, the constrained optimization problem is transformed into an unconstrained one, thus reducing the problem of closed-loop performance optimization with pole placement constraint to the computation of the gradient of the performance index with respect to the free-parameter matrix. Several classical performance indices are then optimized under the pole placement constraint. The effectiveness of the proposed gradient method is illustrated with an example.     

A stochastic optimal control approach to a class of production and inventory problems

A comprehensible and unified system control approach is presented to solve a class of production/inventory smoothing problems. A nonstationary, non-Gaussian, finite-time linear optimal solution with an attractive computation scheme is obtained for a general quadratic and linear cost structure. A complete solution to a classical production/inventory control problem is given as an example. A general solution to the discrete-time optimal regulator with arbitrary but known disturbance is provided and discussed in detail. A computationally attractive closed-loop suboptimal scheme is presented for problems with constraints or nonquadratic costs. Implementation and interpretation of the results are discussed.     

Iterative identification and control design using finite-signal-to-noise models

In this paper, a model is said to be validated for control design if using the model-based controller, the closed loop performance of the real plant satisfies a specified performance bound. To improve the model for control design, only closed loop response data is available to deduce a new model of the plant. Hence the procedure described herein involves three steps in each iteration: (i) closed loop identification; (ii) plant model extraction from the closed loop model; (iii) controller design. Thus our criteria for model validation involve both the control design procedure by which the closed loop system performance is evaluated, and the identification procedure by which a new model of the plant is deduced from the closed loop response data. This paper proposes new methods for both parts, and also proposes an iterative algorithm to connect the two parts. To facilitate both the identification and control tasks, the new finite-signal-to-noise (FSN) model of linear systems is utilized. The FSN model allows errors in variables whose noise covariances are proportional to signal covariances. Allowing the signal to noise ratios to be bounded but uncertain, a control theory to guarantee a variance upper bound is developed for the discrete version of this new FSN model. The identification of the closed loop system is accomplished by a new type of q-Markov Cover, adjusted to accommodate the assumed FSN structure of the model. The model of the plant is extracted from the closed loop identification model. This model is then used for control design and the process is repeated until the closed loop performance validates the model. If the iterations produce no such a controller, we say that this specific procedure cannot produce a model valid for control design and the level of the required performance must be reduced.     

Control of time-periodic systems via symbolic computation with application to chaos control

A general method for the control of linear time-periodic systems employing symbolic computation of Floquet transition matrix is considered in this work. It is shown that this method is applicable to chaos control. Nonlinear chaotic systems can be driven to a desired periodic motion by designing a combination of a feedforward controller and a feedback controller. The design of the feedback controller is achieved through the symbolic computation of fundamental solution matrix of linear time-periodic systems in terms of unknown control gains. Then, the Floquet transition matrix (state transition matrix evaluated at the end of the principal period) can determine the stability of the system owing to classical techniques such as pole placement, Routh–Hurwitz criteria, etc. Thus it is possible to place the Floquet multipliers in the desired locations to determine the control gains. This method can be applied to systems without small parameters. The Duffing’s oscillator, the Rössler system and the nonautonomous parametrically forced Lorenz equations are chosen as illustrative examples to demonstrate the application.