On the Optimal Stabilisation for a set of Programmed Motions of the Bilinear Control System

During recent years there has been considerable interest in using bilinear systems [1, 2] as mathematical models to represent the dynamic behavior of a wide class of engineering, biological and economic systems. Moreover, there are some methods [3] which may approximate nonlinear control systems by bilinear systems. For the first time Zubov has proposed a method of stabilization control synthesis for a set of programmed motions in linear systems [4]. In papers [5, 6] this method has been developed and used to solve the same problem for bilinear systems. In the present paper the following problems are considered. First, synthesis of nonlinear control as feedback under which the bilinear control system has a given set of programmed and asymptotic stable motions. Because this control is not unique, the second problem concerns optimal stabilization. In this paper a method for the design of nonlinear optimal control is suggested. This control is constructed in the form of a convergent series. The theorem on the sufficient conditions to solve this problem is represented.     

Approximation procedures for the optimal control of bilinear and nonlinear systems

Optimal control problems for bilinear systems are studied and solved with a view to approximating analogous problems for general nonlinear systems. For a given bilinear optimal control problem, a sequence of linear problems is constructed, and their solutions are shown to converge to the desired solution. Also, the direct solution to the Hamilton-Jacobi equation is analyzed. A power-series approach is presented which requires offline calculations as in the linear case (Riccati equation). The methods are compared and illustrated. Relations to classical linear systems theory are discussed.     

Controller design for stabilizing bilinear systems with state-based switching

Some nonlinear systems can be approximated by switching bilinear systems. In this paper, we proposed a method to design state-based stabilizing controller for switching bilinear systems. Based on the similarity between switching bilinear systems and switching linear systems, corresponding switching linear systems are obtained for switching bilinear systems by applying state-based feedback control laws. Instead, we consider asymptotically stabilizing the corresponding switching linear system through solving a number of relaxed LMI conditions. Stabilizing controllers for switching bilinear systems can be derived based on the results of the corresponding switching linear systems. The stability of the controller is proved step by step through the decreasing of the multiple Lyapunov functions along the state trajectory. The effectiveness of the method is demonstrated by both a theoretical example and an example of urban traffic network with traffic signals.     

A connection between multi-linear and Volterra systems

The Volterra system is a non-linear system with the structure of the Volterra series. The Volterra series is attractive from the system-theoretic point of view, since it enables to obtain the output of a class of non-linear systems in terms of the input explicitly rather than involving input-output coupling terms and allows substantial simplifications for the numerical simulation. The Volterra system allows to derive the stability condition as well, i.e. obtain a bound on the output for a given bound on the input function, especially for the bilinear system. The bilinear system possesses the Volterra series. This paper derives the Volterra series formalism from the multi-linear system involving the coupling term attributed to (k-1)th order non-linearity and output function, where 1<k. The bilinear system becomes a special case of the non-linear problem of concern here. The Volterra series formalism of this paper is derived using the discrete counterpart of the phase space analysis for the non-linear non-autonomous system. The main result of the paper, i.e the Volterra series formalism of the multi-linear system of concern here, is somewhat more general, since the Volterra series representations for bilinear and tri-linear systems, etc. can be obtained as its special cases.     

Vibration control of micro-scale structures using their reduced second order bilinear models based on multi-moment matching criteria

This paper deals with vibration control of micro-scale structures; i.e. MEMS devices. For modeling of the structures, finite element method which is a distinguished and accurate technique will be used. This method, however, leads to a model with high number of degrees of freedom which may cause computational costs especially for control problems. Hence, we will apply the second order Krylov subspace method based on multi-moment matching to obtain a reduced order model which is in the form of a second order bilinear system. For vibration suppression of the corresponding micro-structure, a quadratic feedback controller and also a linear state feedback controller using linear matrix inequality (LMI) will be designed. Finally, a micro-cantilever beam will be considered as a practical case study and simulation results of applying the proposed method will be presented.     

Stochastic stability of positive Markov jump linear systems with fixed dwell time

This paper studies the stochastic stability of positive Markov jump linear systems with a fixed dwell time. By constructing an auxiliary system that originated from the initial system with state jumps, sufficient and necessary conditions of stochastic stability for positive Markov jump linear systems are obtained with both exactly known and partially known transition rates. The main idea in the latter case is applying a convex combination to convert bilinear programming into linear programming problems. On this basis, multiple piecewise linear co-positive Lyapunov functions are provided to achieve less conservative results. Then state feedback controller is designed to stabilize the positive Markov jump linear systems by solving linear programming problems. Numerical examples are presented to illustrate the viability of our conclusions.     

On ℋ︁2-model reduction of linear parameter-varying systems

In this paper, we will discuss an advantageous relation between a special class of linear parameter-varying systems and bilinear control systems. This will automatically lead to parameter-preserving model reduction techniques. Furthermore, we review a recently introduced interpolation-based ℋ₂-framework for bilinear control systems. By means of a numerical example, the efficiency of the new method will be underlined. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Consistent systems and pole assignment: I

We study the consistency property of a linear time-invariant control system with incomplete feedback and of a bilinear time-invariant control system in connection with the pole assignment problem. We show that consistency is a sufficient and, in some cases, necessary condition for the arbitrary pole assignability of systems with coefficients of a special form.     

An iterative method for the finite-time bilinear-quadratic control problem

For bilinear control systems with quadratic cost, the so-called bilinear-quadratic problems, a feedback controller for the finite-time case is designed. An iteration procedure in close proximity to the Riccati approach is presented, and the proof of convergence is outlined. The potential of the new method is discussed, and the design procedure is illustrated for two examples.     

Stabilization of weakly linear systems

The problem of stabilizing bilinear systems, characterized by the presence of a small parameter in the bilinear part of the system, is considered. The result is an approximate method for synthesizing a stabilizing control /1–3/ in bilinear systems, in the case of a performance index. Estimates are derived for the error with respect to the performance index.     

Robust fault tolerant control of continuous-time switched systems: An LMI approach

The present paper proposes a new robust fault tolerant control (RFTC) design for continuous-time switched systems. The main objective is to design in an integrated way the couple (controller, observer) that allows to stabilize switched systems even in the presence of actuator faults. A state/fault estimation observer is designed to simultaneously estimate system state and actuator faults. Based on this observer, a fault tolerant controller is developed to stabilize the system and accommodate the actuator faults automatically. The RFTC problem is formalized in the form of linear matrix inequalities (LMI) rather than bilinear matrix inequalities (BMI), to avoid the difficulty of solving BMIs. Finally, a numerical example composed of unstable subsystems is studied to show the applicability and efficiency of the obtained results.     

Global optimization for the Biaffine Matrix Inequality problem

It has recently been shown that an extremely wide array of robust controller design problems may be reduced to the problem of finding a feasible point under a Biaffine Matrix Inequality (BMI) constraint. The BMI feasibility problem is the bilinear version of the Linear (Affine) Matrix Inequality (LMI) feasibility problem, and may also be viewed as a bilinear extension to the Semidefinite Programming (SDP) problem. The BMI problem may be approached as a biconvex global optimization problem of minimizing the maximum eigenvalue of a biaffine combination of symmetric matrices. This paper presents a branch and bound global optimization algorithm for the BMI. A simple numerical example is included. The robust control problem, i.e., the synthesis of a controller for a dynamic physical system which guarantees stability and performance in the face of significant modelling error and worst-case disturbance inputs, is frequently encountered in a variety of complex engineering applications including the design of aircraft, satellites, chemical plants, and other precision positioning and tracking systems.     

BILINEAR FORMS AND LINEAR CODES

Abraham Lempel et al^[1] made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.     

Nonlinearity tests for bilinear systems

The purpose of this paper is to develop nonlinearity tests for open-loop bilinear systems. Lagrange multiplier tests of linear systems against a bilinear alternative are proposed. A simulation study is performed to check the validity of the asymptotic null distributions of the test statistics and to investigate the power characteristics of the tests. Two recent nonlinearity tests in the time-series context are adapted to linear systems and compared with Lagrange multiplier tests. Simulation results show that the proposed Lagrange multiplier tests are more powerful than the other tests.     

基于模糊双线性模型的非线性系统的跟踪控制

研究一种基于T-S模糊双线性系统的跟踪控制器设计及稳定性分析.使用分布并行补偿法(PDC)设计了模糊控制器,得到模糊双线性系统跟踪控制渐近稳定的充分条件,仿真结果验证了该方法改进了闭环系统的性能.     

An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms

Many nonconvex nonlinear programming (NLP) problems of practical interest involve bilinear terms and linear constraints, as well as, potentially, other convex and nonconvex terms and constraints. In such cases, it may be possible to augment the formulation with additional linear constraints (a subset of Reformulation-Linearization Technique constraints) which do not affect the feasible region of the original NLP but tighten that of its convex relaxation to the extent that some bilinear terms may be dropped from the problem formulation. We present an efficient graph-theoretical algorithm for effecting such exact reformulations of large, sparse NLPs. The global solution of the reformulated problem using spatial Branch-and Bound algorithms is usually significantly faster than that of the original NLP. We illustrate this point by applying our algorithm to a set of pooling and blending global optimization problems.     

Digital modeling and control of multiple time-delayed distributed power grid

Distributed power grid (DPG) control systems are so highly interconnected that the effects of local disturbances as well as transmission time delays can be amplified as they propagate through a complex network of transmission lines. These effects deteriorate control performance and could possibly destabilize the overall system. In this paper, a new approximated discretization method and digital design for DPG control systems with multiple state, input and output delays as well as a generalized bilinear transformation method are presented. Based on a procedure for the generation of impulse response data, the multiple fractional/integer time-delayed continuous-time system is transformed to a discrete-time model with multiple integer time delays. To implement the digital modeling, the singular value decomposition (SVD) of a Hankel matrix together with an energy loss level is employed to obtain an extended discrete-time state space model. Then, the extended discrete-time state space model of the DPG control system is reformulated as an integer time-delayed discrete-time system by computing its observable canonical form. The proposed method can closely approximate the step response of the original continuous time-delayed DPG control system by choosing various energy loss levels. For completeness, an optimal digital controller design for the DPG control system and a generalized bilinear transformation method with a tunable parameter are also provided, which can re-transform the integer time-delayed discrete-time model to its continuous-time model. Illustrative examples are given to demonstrate the effectiveness of the developed method.     

一类单时滞线性系统的模糊变结构控制

研究了一类单时滞线性系统变结构控制律的设计方法,基于模糊T-S模型把一类单时滞线性系统化为若干个时滞子系统,然后对时滞子系统设计变结构控制律,取全局控制作为系统的控制律,从而达到对单时滞线性系统系统进行控制的目的,给出了单时滞系统的滑模稳定的条件.仿真表明控制策略的有效性.     

Pfaffian solutions to a (3+1)-dimensional generalized B-type Kadomtsev-Petviashvili equation and its modified counterpart

A class of exact Pfaffian solutions to a (3+1)-dimensional generalized B-type Kadomtsev-Petviashvili equation is obtained. A set of sufficient conditions consisting of systems of linear partial differential equations involving free parameters is generated to guarantee that the Pfaffian solves the equation. A Bäcklund transformation of the equation is presented. The equation is transformed into a set of bilinear equations, and a few classes of traveling wave solutions, rational solutions and Pfaffian solutions to the extended bilinear equations are furnished. Examples of the Pfaffian solutions are explicitly computed, and a few solutions are plotted.