GCS of a class of chaotic dynamic systems

This article studies a guaranteed cost synchronization (GCS) problem for a class of chaotic systems. Attention is focused on the design of state feedback controllers such that the resulting closed-loop error system is asymptotically stable and an adequate level of performance is also guaranteed. Using the Lyapunov method and LMI (linear matrix inequality) technique, two criteria for the existence of the controller for GCS are derived in terms of LMIs. To show the effectiveness of the proposed method, GCS problem of Genesio system verified by a numerical example.     

On linear differential games with integral constraints

The paper is devoted to quasilinear conflict-controlled processes of general form with a cylindrical terminal set. A specific feature is that, instead of a dynamical system, we start with representation of a solution in a form that allows one to include an additive term with the initial data and a control unit. This makes it possible to consider a broad spectrum of dynamic processes in a unified scheme. Our study is based on the method of resolving functions. We obtain sufficient conditions for the solvability of the pursuit problem at a certain guaranteed time in the class of strategies that use information on the behavior of the opponent in the past, as well as in the class of stroboscopic strategies. We also find conditions under which information on the prehistory of the evader does not matter. The guaranteed times of various schemes of the resolving function method are compared with the guaranteed time of Pontryagin’s first direct method. The qualitative results are illustrated by an example of a game problem with simple motions and incomplete sweeping for special control domains in the Pontryagin condition.     

The existence of the exponentially stable limit cycle for a class of nonlinear systems

In this paper, the exponentially stable limit cycle phenomenon for a class of nonlinear systems is investigated. Based on the analytic method, the existence and uniqueness of the exponentially stable limit cycle for such systems can be guaranteed. Moreover, the amplitude of oscillation, the period of oscillation, and guaranteed convergence rate can be correctly estimated. Finally, two numerical examples are provided to illustrate the use of the main result.     

Guaranteed cost synchronization of a complex dynamical network via dynamic feedback control

In this paper, the problem of guaranteed cost synchronization for a complex network is investigated. In order to achieve the synchronization, two types of guaranteed cost dynamic feedback controller are designed. Based on Lyapunov stability theory, a linear matrix inequality (LMI) convex optimization problem is formulated to find the controller which guarantees the asymptotic stability and minimizes the upper bound of a given quadratic cost function. Finally, a numerical example is given to illustrate the proposed method.     

不确定线性系统的最优保性能可靠控制

针对一类不确定线性系统,采用连续增益故障模型提出了考虑执行器故障的保性能可靠控制问题.通过对具有执行器增益故障的系统分析,利用线性矩阵不等式(LMI)分别给出了保性能标准控制、最优保性能标准控制、保性能可靠控制、最优保性能可靠控制存在的充分条件.根据凸优化理论,最优保性能标准控制和最优保性能可靠控制的设计方法转化为一个线性凸优化算法.仿真数例验证了文中所提出方法的可行性.在相同形式的故障发生时,比较最优保性能标准控制与最优保性能可靠控制,进一步说明了最优保性能可靠控制的必要性.     

Robust guaranteed cost control for uncertain linear differential systems of neutral type

In this paper, the robust guaranteed cost control problem for a class of uncertain linear differential systems of neutral type with a given quadratic cost functions is investigated. The uncertainty is assumed to be norm-bounded and time-varying nonlinear. The problem is to design a state feedback control laws such that the closed-loop system is robustly stable and the closed-loop cost function value is not more than a specified upper bound for all admissible uncertainty and time delay. A criterion for the existence of such controllers is derived based on the matrix inequality approach combined with the Lyapunov method. A parameterized characterization of the robust guaranteed cost controllers is given in terms of the feasible solutions to the certain matrix inequalities. A numerical example is given to illustrate the proposed method.     

Idealized program packages and problems of positional control with incomplete information

The paper is devoted to developing the method of program packages as a tool for investigating problems of positional control with incomplete information. The method is embedded in the field of guaranteed control theory and was stipulated by a number of constructions from this theory. Under the assumption that an a priori given set of initial positions of a controlled system is finite, it is established that the solvability of a guaranteed guidance problem in the class of program packages (or, which is the same, in the class of positional strategies) is equivalent to the solvability of this problem in the class of considerably simpler program operators, namely, in the class of idealized program packages.     

An Open-loop criterion for the solvability of a closed-loop guidance problem with incomplete information: Linear control systems

The method of open-loop control packages is a tool for stating the solvability of guaranteed closed-loop control problems under incomplete information on the observed states. In this paper, a solution method is specified for the problem of guaranteed closed-loop guidance of a linear control system to a convex target set at a prescribed point in time. It is assumed that the observed signal on the system’s states is linear and the set of its admissible initial states is finite. It is proved that the problem under consideration is equivalent to the problem of open-loop guidance of an extended linear control system to an extended convex target set. Using a separation theorem for convex sets, we derive a solvability criterion, which reduces to solving a finite-dimensional optimization problem. An illustrative example is considered.     

Numerical validation of solutions of linear complementarity problems

Summary. This paper proposes a validation method for solutions of linear complementarity problems. The validation procedure consists of two sufficient conditions that can be tested on a digital computer. If the first condition is satisfied then a given multidimensional interval centered at an approximate solution of the problem is guaranteed to contain an exact solution. If the second condition is satisfied then the multidimensional interval is guaranteed to contain no exact solution. This study is based on the mean value theorem for absolutely continuous functions and the reformulation of linear complementarity problems as nonsmooth nonlinear systems of equations. Received August 21, 1997 / Revised version July 2, 1998     

随机线性系统保成本控制的线性矩阵不等式方法

考虑具有二次成本函数的随机线性系统,研究了状态反馈控制的保证成本控制问题.依据线性矩阵不等式得到了保证成本控制器存在的充分条件,最后得到了随机线性闭环系统保证成本最小的最优保证成本控制律的表达式.     

Guaranteed and locally computable a posteriori error estimate

^** Email: vejchod{at}math.cas.cz A new approach, based on the combination of the equilibratedresidual method and the method of hypercircle, is proposed fora posteriori error estimation. Computer implementation of theequilibrated residual method is fast, but it does not produceguaranteed estimates. On the other hand, the method of hypercircledelivers guaranteed estimates, but it is not fast because itinvolves solving a global linear algebraic system. The combinationof these two methods leads to guaranteed and locally computablea posteriori error estimator. This combined method is appliedto linear elliptic problem in two dimensions with mixed boundaryconditions and non-negative absolute terms.     

Estimation of the Absolute Error and Polynomial Solvability for a Classical <Emphasis Type="Italic">NP</Emphasis>-Hard Scheduling Problem

A method for finding an approximate solution for NP-hard scheduling problems is proposed. The example of the classical NP-hard in the strong sense problem of minimizing the maximum lateness of job processing with a single machine shows how a metric introduced on the instance space of the problem and polynomially solvable areas can be used to find an approximate solution with a guaranteed absolute error. The method is evaluated theoretically and experimentally and is compared with the ED-heuristic. Additionally, for the problem under consideration, we propose a numerical characteristic of polynomial unsolvability, namely, an upper bound for the guaranteed absolute error for each equivalence class of the instance space.     

Output feedback guaranteed cost control of uncertain linear discrete systems with interval time-varying delays

This paper deals with output feedback guaranteed cost control problem for a general class of uncertain linear discrete delay systems, where the state and the observation output are subjected to interval time-varying delay. The proposed output feedback controller uses the observation measurement to exponentially stabilize the closed-loop system and guarantee an adequate level of system performance. By constructing a set of augmented Lyapunov–Krasovskii functionals, a delay-dependent condition for the robust output feedback guaranteed cost control is established in terms of linear matrix inequalities (LMIs). Three numerical examples are provided to demonstrate the efficiency of the proposed method.     

Alternating-directional PMHSS iteration method for a class of two-by-two block linear systems

In Bai et al. (2013), a preconditioned modified HSS (PMHSS) method was proposed for a class of two-by-two block systems of linear equations. In this paper, the PMHSS method is modified by adding one more parameter in the iteration. Convergence of the modified PMHSS method is guaranteed. Theoretic analysis and numerical experiment show that the modification improves the PMHSS method.     

Non-fragile guaranteed cost control for uncertain neutral dynamic systems with time-varying delays in state and control input

This article considers non-fragile guaranteed cost control problem for a class of uncertain neutral system with time-varying delays in both state and control input. Delay-dependent criteria are proposed to guarantee the robust stabilization of systems. Linear matrix inequality (LMI) optimization approach is used to solve the non-fragile guaranteed cost control problem. Non-fragile guaranteed cost control for unperturbed neutral system is considered in the first step. Robust non-fragile guaranteed cost control for uncertain neutral system is designed directly from the unperturbed condition. An efficient approach is proposed to design the non-fragile guaranteed cost control for uncertain neutral systems. LMI toolbox of Matlab is used to implement the proposed results. Finally, a numerical example is illustrated to show the usefulness of the proposed results.     

A method for finding the roots of a polynomial

Summary Two variants of a method for finding the roots of a polynomial are described. A proof of the method for a general polynomial with complex coefficients is not based on neighbourhoods of saddle points which are sufficiently small. The speed of convergence is guaranteed since the method is a modification of the downhill method and since it can be used in combination with an arbitrary method which quickly converges in practice, but whose convergence cannot be proved.     

Determination of Inner and Outer Bounds of Reachable Sets Through Subpavings

The computation of the reachable set of states of a given dynamic system is an important step to verify its safety during operation. There are different methods of computing reachable sets, namely interval integration, capture basin, methods involving the minimum time to reach function, and level set methods. This work deals with interval integration to compute subpavings to over or under approximate reachable sets of low dimensional systems. The main advantage of this method is that, compared to guaranteed integration, it allows to control the amount of over-estimation at the cost of increased computational effort. An algorithm to over and under estimate sets through subpavings, which potentially reduces the computational load when the test function or the contractor is computationally heavy, is implemented and tested. This algorithm is used to compute inner and outer approximations of reachable sets. The test function and the contractors used in this work to obtain the subpavings involve guaranteed integration, provided either by the Euler method or by another guaranteed integration method. The methods developed were applied to compute inner and outer approximations of reachable sets for the double integrator example. From the results it was observed that using contractors instead of test functions yields much tighter results. It was also confirmed that for a given minimum box size there is an optimum time step such that with a greater or smaller time step worse results are obtained.     

A hierarchical method for obtaining eigenvalue enclosures

We introduce a new method of obtaining guaranteed enclosures of the eigenvalues of a variety of self-adjoint differential and difference operators with discrete spectrum. The method is based upon subdividing the region into a number of simpler regions for which eigenvalue enclosures are already available.