An iterative method for the identification of nonlinear systems using a Uryson model

A new model for identifying nonlinear systems is presented. The multipath structure with each path consisting of a polynomial followed by linear dynamics is a direct extension of the single path Hammerstein model. An iterative algorithm for obtaining the dynamics from finite length input and noisy output data records is presented and shown to converge for a class of inputs including colored Gaussian processes. Computer simulations demonstrate the feasibility of the model and algorithm.     

An open-closed-loop iterative learning control approach for nonlinear switched systems with application to freeway traffic control

For nonlinear switched discrete-time systems with input constraints, this paper presents an open-closed-loop iterative learning control (ILC) approach, which includes a feedforward ILC part and a feedback control part. Under a given switching rule, the mathematical induction is used to prove the convergence of ILC tracking error in each subsystem. It is demonstrated that the convergence of ILC tracking error is dependent on the feedforward control gain, but the feedback control can speed up the convergence process of ILC by a suitable selection of feedback control gain. A switched freeway traffic system is used to illustrate the effectiveness of the proposed ILC law.     

An iterative approach to verification of real-time systems

Verification of real-time systems is a complex problem, requiring construction of aregion automaton with a state space growing exponentially in the number of timing constraints and the sizes of constants in those constraints. However, some properties can be verified even when some quantitative timing information is abstracted. We propose a new verification procedure, where increasingly more complex abstractions of the region automaton are iteratively constructed. In many cases, the procedure can be stopped early, and thus can avoid the state space explosion problem.     

An approach to backward analysis for linear and nonlinear iterative methods

In this paper a general model for the analysis of the limiting accuracy of linear and nonlinear iterative methods under the influence of approximation and roundoff errors is presented. A number of numerical methods for which this question up to now has been answered by the use of specialized and rather complicated techniques only can be treated with great ease and generality.     

An energy-gain bounding approach to robust fuzzy identification

A novel method for the robust identification of interpretable fuzzy models, based on the criterion that identification errors are least sensitive to data uncertainties and modelling errors, is suggested. The robustness of identification errors towards unknown disturbances (data uncertainties, modelling errors, etc.) is achieved by bounding (i.e. minimizing) the maximum possible value of energy-gain from disturbances to the identification errors. The solution of energy-gain bounding problem, being robust, shows an improved performance of the identification method. The flexibility of the proposed framework is shown by designing the variable learning rate identification algorithms in both deterministic and stochastic frameworks.     

一种间歇反应过程迭代动态规划方法

随着工业过程对降低产品成本、改进产品质量、满足安全要求和环境规范,间歇反应过程的优化变得越来越重要.本文因此给出了一种有效的基于随机选点的间歇反应过程迭代动态规划算法,并给出了算法实现的详细步骤,能够有效实现间歇反应过程中温度、浓度等变量的动态优化问题.所述的迭代动态规划算法通过调节分段数P和离散点数(N和M)可以有效的避免计算量激增的问题,具有稳定可靠、易寻找到全局最优解的优点.以典型的间歇反应动态优化问题作为实例进行了研究,并与国际上公开报道结果进行了详细的比较研究,结果表明了所述方法的可靠有效性.     

An adaptive robust M-estimator for nonparametric nonlinear system identification

An adaptive robust M-estimator for nonparametric nonlinear system identification is proposed. This M-estimator is optimal over a broad class of distributions in the sense of maximum likelihood estimation. The error distributions are described by the generalized exponential distribution family. It combines non-parametric regression techniques to form a powerful procedure for nonlinear system identification. The adaptive procedure's excellent performance characteristics are illustrated in a Monte Carlo study by comparing the results with previous methods.     

A methodology for control-relevant nonlinear system identification using restricted complexity models

A broadly-applicable, control-relevant system identification methodology for nonlinear restricted complexity models (RCMs) is presented. Control design based on RCMs often leads to controllers which are easy to interpret and implement in real-time. A control-relevant identification method is developed to minimize the degradation in closed-loop performance as a result of RCM approximation error. A two-stage identification procedure is presented. First, a nonlinear ARX model is estimated from plant data using an orthogonal least squares algorithm; a Volterra series model is then generated from the nonlinear ARX model. In the second stage, a RCM with the desired structure is estimated from the Volterra series model through a model reduction algorithm that takes into account closed-loop performance requirements. The effectiveness of the proposed method is illustrated using two chemical reactor examples.     

Least-squares-based iterative identification algorithm for Hammerstein nonlinear systems with non-uniform sampling

This paper focuses on identification problems for Hammerstein systems with non-uniform sampling. By using the over-parameterization technique, we derive a linear regressive identification model with different input updating rates. To solve the identification problem of Hammerstein output error systems with the unmeasurable variables in the information vector, the least-squares-based iterative algorithm is presented by replacing the unmeasurable variables with their corresponding iterative estimates. The performances of the proposed algorithm are analysed and compared by using a numerical example.     

A switching robust model predictive control approach for nonlinear systems

This work considers enhancing the stability and improving the economic performance of nonlinear model predictive control in the presence of disturbances or model uncertainties. First, a robust control Lyapunov function (RCLF)-based predictive control strategy is proposed. Second, the approximate dynamic programming (ADP) is employed to further improve regulation performance. Finally, the ADP and RCLF-MPC are combined to provide a switching control scheme, which is illustrated on a CSTR example to show its effectiveness.     

An iterative approach to robust and integrated aircraft routing and crew scheduling

In airline scheduling a variety of planning and operational decision problems have to be solved. We consider the problems aircraft routing and crew pairing: aircraft and crew must be allocated to flights in a schedule in a minimal cost way. Although these problems are not independent, they are usually formulated as independent mathematical optimisation models and solved sequentially. This approach might lead to a suboptimal allocation of aircraft and crew, since a solution of one of the problems may restrict the set of feasible solutions of the problem solved later. Also, when minimal cost solutions are used in operations, a short delay of one flight can cause very severe disruptions of the schedule later in the day. We generate solutions that incur small costs and are also robust to typical stochastic variability in airline operations. We solve the two original problems iteratively. Starting from a minimal cost solution, we produce a series of solutions which are increasingly robust. Using data from domestic airline schedules we evaluate the benefits of the approach as well as the trade-off between cost and robustness. We extend our approach considering the aircraft routing problem together with two crew pairing problems, one for technical crew and one for flight attendants.     

An iterative approach to the optimal co-design of linear control systems

This paper investigates the optimal co-design of both physical plants and control policies for a class of continuous-time linear control systems. The optimal co-design of a specific linear control system is commonly formulated as a nonlinear non-convex optimisation problem (NNOP), and solved by using iterative techniques, where the plant parameters and the control policy are updated iteratively and alternately. This paper proposes a novel iterative approach to solve the NNOP, where the plant parameters are updated by solving a standard semi-definite programming problem, with non-convexity no longer involved. The proposed system design is generally less conservative in terms of the system performance compared to the conventional system-equivalence-based design, albeit the range of applicability is slightly reduced. A practical optimisation algorithm is proposed to compute a sub-optimal solution ensuring the system stability, and the convergence of the algorithm is established. The effectiveness of the proposed algorithm is illustrated by its application to the optimal co-design of a physical load positioning system.     

An LMI approach for robust iterative learning control with quadratic performance criterion

This paper presents the design of iterative learning control based on quadratic performance criterion (Q-ILC) for linear systems subject to additive uncertainty. The robust Q-ILC design can be cast as a min–max problem. We propose a novel approach which employs an upper bound of the worst-case performance, then formulates a non-convex quadratic minimization problem to get the update of iterative control inputs. Applying Lagrange duality, the Lagrange dual function of the non-convex quadratic problem is equivalent to a convex optimization over linear matrix inequalities (LMIs). An LMI algorithm with convergence properties is then given for the robust Q-ILC design. Finally, we provide a numerical example to illustrate the effectiveness of the proposed method.     

An iterative learning approach to formation control of multi-agent systems

In this paper, an efficient framework is proposed to the formation control problem of multiple agents with unknown nonlinear dynamics, by means of the iterative learning approach. In particular, a distributed D-type iterative learning scheme is developed for the multi-agent system with switching topology, whose switching time and sequence are allowed to be varied at different iterations according to the actual trajectories of agents, and a sufficient condition is derived to ensure that the desired formation can be always preserved from the initial starting location to the final one after some iterations. Simulation results are provided to verify the effectiveness of the proposed approach.     

A convex optimization approach to robust iterative learning control for linear systems with time-varying parametric uncertainties

In this paper, we present a new robust iterative learning control (ILC) design for a class of linear systems in the presence of time-varying parametric uncertainties and additive input/output disturbances. The system model is described by the Markov matrix as an affine function of parametric uncertainties. The robust ILC design is formulated as a min–max problem using a quadratic performance criterion subject to constraints of the control input update. Then, we propose a novel methodology to find a suboptimal solution of the min–max optimization problem. First, we derive an upper bound of the worst-case performance. As a result, the min–max problem is relaxed to become a minimization problem in the form of a quadratic program. Next, the robust ILC design is cast into a convex optimization over linear matrix inequalities (LMIs) which can be easily solved using off-the-shelf optimization solvers. The convergences of the control input and the error are proved. Finally, the robust ILC algorithm is applied to a physical model of a flexible link. The simulation results reveal the effectiveness of the proposed algorithm.     

Networked iterative learning control approach for nonlinear systems with random communication delay

This paper constructs a proportional-type networked iterative learning control (NILC) scheme for a class of discrete-time nonlinear systems with the stochastic data communication delay within one operation duration and being subject to Bernoulli-type distribution. In the scheme, the communication delayed data is replaced by successfully captured one at the concurrent sampling moment of the latest iteration. The tracking performance of the addressed NILC algorithm is analysed by statistic technique in virtue of mathematical expectation. The analysis shows that, under certain conditions, the expectation of the tracking error measured in the form of 1-norm is asymptotically convergent to zero. Numerical experiments are carried out to illustrate the validity and effectiveness.     

An optimal control approach to robust tracking of linear systems

In our early work, we show that one way to solve a robust control problem of an uncertain system is to translate the robust control problem into an optimal control problem. If the system is linear, then the optimal control problem becomes a linear quadratic regulator (LQR) problem, which can be solved by solving an algebraic Riccati equation. In this article, we extend the optimal control approach to robust tracking of linear systems. We assume that the control objective is not simply to drive the state to zero but rather to track a non-zero reference signal. We assume that the reference signal to be tracked is a polynomial function of time. We first investigated the tracking problem under the conditions that all state variables are available for feedback and show that the robust tracking problem can be solved by solving an algebraic Riccati equation. Because the state feedback is not always available in practice, we also investigated the output feedback. We show that if we place the poles of the observer sufficiently left of the imaginary axis, the robust tracking problem can be solved. As in the case of the state feedback, the observer and feedback can be obtained by solving two algebraic Riccati equations.     

An LMI approach to robust H-infinity control for uncertain singular time-delay systems

The problem of robust H-infinity control for a class of uncertain singular time-delay systems is studied in this paper. A new approach is proposed to describe the relationship between slow and fast subsystems of singular time- delay systems, based on which, a sufficient condition is presented for a singular time-delay system to be regular, impulse free and stable with an H-infinity performance. The robust H-infinity control problem is solved and an explicit expression of the desired state-feedback control law is also given. The obtained results are formulated in terms of strict linear matrix inequalities （LMIs） involving no decomposition of system matrices. A numerical example is given to show the effectiveness of the proposed method.     

An iterative solution method for systems of nonlinear equations on a parallelepiped

A cyclic coordinate descent method is considered for minimizing the nonconvex discrepancy function of a system of equations of a special kind on a parallelepiped, with analytical solution of one-dimensional problems.Translated from Kibernetika, No. 2, pp. 47–52, March–April, 1990.     

An iterative learning control theory for a class of nonlinear dynamic systems

An iterative learning control scheme is presented for a class of nonlinear dynamic systems which includes holonomic systems as its subset. The control scheme is composed of two types of control methodology: a linear feedback mechanism and a feedforward learning strategy. At each iteration, the linear feedback provides stability of the system and keeps its state errors within uniform bounds. The iterative learning rule, on the other hand, tracks the entire span of a reference input over a sequence of iterations. The proposed learning control scheme takes into account the dominant system dynamics in its update algorithm in the form of scaled feedback errors. In contrast to many other learning control techniques, the proposed learning algorithm neither uses derivative terms of feedback errors nor assumes external input perturbations as a prerequisite. The convergence proof of the proposed learning scheme is given under minor conditions on the system parameters.