Sampled-data synchronization control of dynamical networks with stochastic sampling

Copyright @ 2012 IEEEThis technical note is concerned with the sampled-data synchronization control problem for a class of dynamical networks. The sampling period considered here is assumed to be time-varying that switches between two different values in a random way with given probability. The addressed synchronization control problem is first formulated as an exponentially mean-square stabilization problem for a new class of dynamical networks that involve both the multiple probabilistic interval delays (MPIDs) and the sector-bounded nonlinearities (SBNs). Then, a novel Lyapunov functional is constructed to obtain sufficient conditions under which the dynamical network is exponentially mean-square stable. Both Gronwall's inequality and Jenson integral inequality are utilized to substantially simplify the derivation of the main results. Subsequently, a set of sampled-data synchronization controllers is designed in terms of the solution to certain matrix inequalities that can be solved effectively by using available software. Finally, a numerical simulation example is employed to show the effectiveness of the proposed sampled-data synchronization control scheme.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Royal Society of the UK, the National Natural Science Foundation of China under Grants 61028008, 60974030, 61134009 and 61104125, the National 973 Program of China under Grant 2009CB320600, and the Alexander von Humboldt Foundation of Germany

Stochastic reliable control of a class of uncertain time-delay systems with unknown nonlinearities

Copyright [2001] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper investigates the robust reliable control problem for a class of nonlinear time-delay stochastic systems. The system under study involves stochastics, state time-delay, parameter uncertainties, possible actuator failures and unknown nonlinear disturbances, which are often encountered in practice and the sources of instability. Our attention is focused on the design of linear state feedback memoryless controllers such that, for all admissible uncertainties as well as actuator failures occurring among a prespecified subset of actuators, the plant remains stochastically exponentially stable in mean square, independent of the time delay. Sufficient conditions are proposed to guarantee the desired robust reliable exponential stability despite possible actuator failures, which are in terms of the solutions to algebraic Riccati inequalities. An illustrative example is exploited to demonstrate the applicability of the proposed design approac

Bounded H∞ synchronization and state estimation for discrete time-varying stochastic complex for discrete time-varying stochastic complex networks over a finite horizon

Copyright [2011] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, new synchronization and state estimation problems are considered for an array of coupled discrete time-varying stochastic complex networks over a finite horizon. A novel concept of bounded H∞ synchronization is proposed to handle the time-varying nature of the complex networks. Such a concept captures the transient behavior of the time-varying complex network over a finite horizon, where the degree of bounded synchronization is quantified in terms of the H∞-norm. A general sector-like nonlinear function is employed to describe the nonlinearities existing in the network. By utilizing a timevarying real-valued function and the Kronecker product, criteria are established that ensure the bounded H∞ synchronization in terms of a set of recursive linear matrix inequalities (RLMIs), where the RLMIs can be computed recursively by employing available MATLAB toolboxes. The bounded H∞ state estimation problem is then studied for the same complex network, where the purpose is to design a state estimator to estimate the network states through available output measurements such that, over a finite horizon, the dynamics of the estimation error is guaranteed to be bounded with a given disturbance attenuation level. Again, an RLMI approach is developed for the state estimation problem. Finally, two simulation examples are exploited to show the effectiveness of the results derived in this paper.This work was supported in part by the Engineering and Physical Sciences Research Council of U.K. under Grant GR/S27658/01, the National Natural Science Foundation of China under Grant 61028008 and Grant 60974030, the National 973 Program of China under Grant 2009CB320600, the International Science and Technology Cooperation Project of China under Grant 2009DFA32050, and the Alexander von Humboldt Foundation of Germany

Probability-dependent gain-scheduled filtering for stochastic systems with missing measurements

Copyright @ 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.This brief addresses the gain-scheduled filtering problem for a class of discrete-time systems with missing measurements, nonlinear disturbances, and external stochastic noise. The missing-measurement phenomenon is assumed to occur in a random way, and the missing probability is time-varying with securable upper and lower bounds that can be measured in real time. The multiplicative noise is a state-dependent scalar Gaussian white-noise sequence with known variance. The addressed gain-scheduled filtering problem is concerned with the design of a filter such that, for the admissible random missing measurements, nonlinear parameters, and external noise disturbances, the error dynamics is exponentially mean-square stable. The desired filter is equipped with time-varying gains based primarily on the time-varying missing probability and is therefore less conservative than the traditional filter with fixed gains. It is shown that the filter parameters can be derived in terms of the measurable probability via the semidefinite program method.This work was supported in part by the Leverhulme Trust of the U.K., the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the National Natural Science Foundation of China under Grants 61028008, 61074016 and 60974030, the Shanghai Natural Science Foundation of China under Grant 10ZR1421200, and the Alexander von Humboldt Foundation of Germany

Gain-constrained recursive filtering with stochastic nonlinearities and probabilistic sensor delays

This is the post-print of the Article. The official published version can be accessed from the link below - Copyright @ 2013 IEEE.This paper is concerned with the gain-constrained recursive filtering problem for a class of time-varying nonlinear stochastic systems with probabilistic sensor delays and correlated noises. The stochastic nonlinearities are described by statistical means that cover the multiplicative stochastic disturbances as a special case. The phenomenon of probabilistic sensor delays is modeled by introducing a diagonal matrix composed of Bernoulli distributed random variables taking values of 1 or 0, which means that the sensors may experience randomly occurring delays with individual delay characteristics. The process noise is finite-step autocorrelated. The purpose of the addressed gain-constrained filtering problem is to design a filter such that, for all probabilistic sensor delays, stochastic nonlinearities, gain constraint as well as correlated noises, the cost function concerning the filtering error is minimized at each sampling instant, where the filter gain satisfies a certain equality constraint. A new recursive filtering algorithm is developed that ensures both the local optimality and the unbiasedness of the designed filter at each sampling instant which achieving the pre-specified filter gain constraint. A simulation example is provided to illustrate the effectiveness of the proposed filter design approach.This work was supported in part by the National Natural Science Foundation of China by Grants 61273156, 61028008, 60825303, 61104125, and 11271103, National 973 Project by Grant 2009CB320600, the Fok Ying Tung Education Fund by Grant 111064, the Special Fund for the Author of National Excellent Doctoral Dissertation of China by Grant 2007B4, the State Key Laboratory of Integrated Automation for the Process Industry (Northeastern University) of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. by Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

Distributed H-infinity filtering for polynomial nonlinear stochastic systems in sensor networks

Copyright [2010] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, the distributed H1 filtering problem is addressed for a class of polynomial nonlinear stochastic systems in sensor networks. For a Lyapunov function candidate whose entries are polynomials, we calculate its first- and second-order derivatives in order to facilitate the use of Itos differential role. Then, a sufficient condition for the existence of a feasible solution to the addressed distributed H1 filtering problem is derived in terms of parameter-dependent linear matrix inequalities (PDLMIs). For computational convenience, these PDLMIs are further converted into a set of sums of squares (SOSs) that can be solved effectively by using the semidefinite programming technique. Finally, a numerical simulation example is provided to demonstrate the effectiveness and applicability of the proposed design approach.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., the National 973 Program of China under Grant 2009CB320600, the National Natural Science Foundation of China under Grant 60974030 and the Alexander von Humboldt Foundation of Germany

Finite-horizon H∞ control for discrete time-varying systems with randomly occurring nonlinearities and fading measurements

This technical note deals with the H∞ control problem for a class of discrete time-varying nonlinear systems with both randomly occurring nonlinearities and fading measurements over a finite-horizon. The system measurements are transmitted through fading channels described by a modified stochastic Rice fading model. The purpose of the addressed problem is to design a set of time-varying controllers such that, in the presence of channel fading and randomly occurring nonlinearities, the H∞ performance is guaranteed over a given finite-horizon. The model transformation technique is first employed to simplify the addressed problem, and then the stochastic analysis in combination with the completing squares method are carried out to obtain necessary and sufficient conditions of an auxiliary index which is closely related to the finite-horizon H∞ performance. Moreover, the time-varying controller parameters are characterized via solving coupled backward recursive Riccati difference equations (RDEs). A simulation example is utilized to illustrate the usefulness of the proposed controller design scheme

Mass retention efficiencies of He accretion onto carbon-oxygen white dwarfs and type Ia supernovae

Type Ia supernovae (SNe Ia) play a crucial role in studying cosmology and galactic chemical evolution. They are thought to be thermonuclear explosions of carbon-oxygen white dwarfs (CO WDs) when their masses reach the Chandrasekar mass limit in binaries. Previous studies have suggested that He novae may be progenitor candidates of SNe Ia. However, the mass retention efficiencies during He nova outbursts are still uncertain. In this article, we aim to study the mass retention efficiencies of He nova outbursts and to investigate whether SNe Ia can be produced through He nova outbursts. Using the stellar evolution code Modules for Experiments in Stellar Astrophysics, we simulated a series of multicycle He-layer flashes, in which the initial WD masses range from 0.7 to 1.35 Msun with various accretion rates. We obtained the mass retention efficiencies of He nova outbursts for various initial WD masses, which can be used in the binary population synthesis studies. In our simulations, He nova outbursts can increase the mass of the WD to the Chandrasekar mass limit and the explosive carbon burning can be triggered in the center of the WD; this suggests that He nova outbursts can produce SNe Ia. Meanwhile, the mass retention efficiencies in the present work are lower than those of previous studies, which leads to a lower birthrates of SNe Ia through the WD + He star channel. Furthermore, we obtained the elemental abundances distribution at the moment of explosive carbon burning, which can be used as the initial input parameters in studying explosion models of SNe Ia.Comment: 8 pages, 12 figures, 2 tables, published in Astronomy & Astrophysics (A&A 604, A31, 2017

Nonlinear analysis of dynamical complex networks

Copyright © 2013 Zidong Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Complex networks are composed of a large number of highly interconnected dynamical units and therefore exhibit very complicated dynamics. Examples of such complex networks include the Internet, that is, a network of routers or domains, the World Wide Web (WWW), that is, a network of websites, the brain, that is, a network of neurons, and an organization, that is, a network of people. Since the introduction of the small-world network principle, a great deal of research has been focused on the dependence of the asymptotic behavior of interconnected oscillatory agents on the structural properties of complex networks. It has been found out that the general structure of the interaction network may play a crucial role in the emergence of synchronization phenomena in various fields such as physics, technology, and the life sciences