3,789 research outputs found

    Investigating stochastic stability of uncertain genetic networks via LMIs

    Get PDF
    Part of 2010 IEEE Multi-Conference on Systems and ControlThis paper addresses the problem of investigating stochastic stability of uncertain genetic networks with SUM regulatory functions. Specifically, the genetic network is assumed to be affected by Wiener processes, and its coefficients are parametrized by an unknown vector constrained in a hypercube. By using the square matricial representation (SMR) of matrix polynomials, it is shown that a condition for stochastic stability of the uncertain genetic network with disturbance attenuation guaranteed for all admissible values of the parameter can be derived in terms of linear matrix inequalities (LMIs). Some examples illustrate the proposed condition. © 2010 IEEE.published_or_final_versionThe 2010 IEEE International Symposium on Computer-Aided Control System Design (CACSD), Yokohama, Japan, 8-10 September 2010. In Proceedings of CACSD, 2010, p. 731-73

    Robust H∞ feedback control for uncertain stochastic delayed genetic regulatory networks with additive and multiplicative noise

    Get PDF
    The official published version can found at the link below.Noises are ubiquitous in genetic regulatory networks (GRNs). Gene regulation is inherently a stochastic process because of intrinsic and extrinsic noises that cause kinetic parameter variations and basal rate disturbance. Time delays are usually inevitable due to different biochemical reactions in such GRNs. In this paper, a delayed stochastic model with additive and multiplicative noises is utilized to describe stochastic GRNs. A feedback gene controller design scheme is proposed to guarantee that the GRN is mean-square asymptotically stable with noise attenuation, where the structure of the controllers can be specified according to engineering requirements. By applying control theory and mathematical tools, the analytical solution to the control design problem is given, which helps to provide some insight into synthetic biology and systems biology. The control scheme is employed in a three-gene network to illustrate the applicability and usefulness of the design.This work was funded by Royal Society of the U.K.; Foundation for the Author of National Excellent Doctoral Dissertation of China. Grant Number: 2007E4; Heilongjiang Outstanding Youth Science Fund of China. Grant Number: JC200809; Fok Ying Tung Education Foundation. Grant Number: 111064; International Science and Technology Cooperation Project of China. Grant Number: 2009DFA32050; University of Science and Technology of China Graduate Innovative Foundation

    Stochastic Synchronization of Genetic Oscillator Networks

    Get PDF
    The study of synchronization among genetic oscillators is essential for the understanding of the rhythmic phenomena of living organisms at both molecular and cellular levels. Genetic networks are intrinsically noisy due to natural random intra- and inter-cellular fluctuations. Therefore, it is important to study the effects of noise perturbation on the synchronous dynamics of genetic oscillators. From the synthetic biology viewpoint, it is also important to implement biological systems that minimizing the negative influence of the perturbations. In this paper, based on systems biology approach, we provide a general theoretical result on the synchronization of genetic oscillators with stochastic perturbations. By exploiting the specific properties of many genetic oscillator models, we provide an easy-verified sufficient condition for the stochastic synchronization of coupled genetic oscillators, based on the Lur'e system approach in control theory. A design principle for minimizing the influence of noise is also presented. To demonstrate the effectiveness of our theoretical results, a population of coupled repressillators is adopted as a numerical example. In summary, we present an efficient theoretical method for analyzing the synchronization of genetic oscillator networks, which is helpful for understanding and testing the synchronization phenomena in biological organisms. Besides, the results are actually applicable to general oscillator networks.Comment: 14 pages, 4 figure

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

    Get PDF
    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

    Reliable H∞ filtering for discrete time-delay systems with randomly occurred nonlinearities via delay-partitioning method

    Get PDF
    The official published version can be found at the link below.In this paper, the reliable H∞ filtering problem is investigated for a class of uncertain discrete time-delay systems with randomly occurred nonlinearities (RONs) and sensor failures. RONs are introduced to model a class of sector-like nonlinearities that occur in a probabilistic way according to a Bernoulli distributed white sequence with a known conditional probability. The failures of sensors are quantified by a variable varying in a given interval. The time-varying delay is unknown with given lower and upper bounds. The aim of the addressed reliable H∞ filtering problem is to design a filter such that, for all possible sensor failures, RONs, time-delays as well as admissible parameter uncertainties, the filtering error dynamics is asymptotically mean-square stable and also achieves a prescribed H∞ performance level. Sufficient conditions for the existence of such a filter are obtained by using a new Lyapunov–Krasovskii functional and delay-partitioning technique. The filter gains are characterized in terms of the solution to a set of linear matrix inequalities (LMIs). A numerical example is given to demonstrate the effectiveness of the proposed design approach

    H-infinity state estimation for discrete-time complex networks with randomly occurring sensor saturations and randomly varying sensor delays

    Get PDF
    This is the post-print of the Article. The official published version can be accessed from the link below - Copyright @ 2012 IEEEIn this paper, the state estimation problem is investigated for a class of discrete time-delay nonlinear complex networks with randomly occurring phenomena from sensor measurements. The randomly occurring phenomena include randomly occurring sensor saturations (ROSSs) and randomly varying sensor delays (RVSDs) that result typically from networked environments. A novel sensor model is proposed to describe the ROSSs and the RVSDs within a unified framework via two sets of Bernoulli-distributed white sequences with known conditional probabilities. Rather than employing the commonly used Lipschitz-type function, a more general sector-like nonlinear function is used to describe the nonlinearities existing in the network. The purpose of the addressed problem is to design a state estimator to estimate the network states through available output measurements such that, for all probabilistic sensor saturations and sensor delays, the dynamics of the estimation error is guaranteed to be exponentially mean-square stable and the effect from the exogenous disturbances to the estimation accuracy is attenuated at a given level by means of an HinftyH_{infty}-norm. In terms of a novel Lyapunov–Krasovskii functional and the Kronecker product, sufficient conditions are established under which the addressed state estimation problem is recast as solving a convex optimization problem via the semidefinite programming method. A simulation example is provided to show the usefulness of the proposed state estimation conditions.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 Natural Science Foundation of China under Grants 61028008, 61134009, 61104125 and 60974030, the Natural Science Foundation of Universities in Anhui Province of China under Grant KJ2011B030, and the Alexander von Humboldt Foundation of Germany

    Performance-based control system design automation via evolutionary computing

    Get PDF
    This paper develops an evolutionary algorithm (EA) based methodology for computer-aided control system design (CACSD) automation in both the time and frequency domains under performance satisfactions. The approach is automated by efficient evolution from plant step response data, bypassing the system identification or linearization stage as required by conventional designs. Intelligently guided by the evolutionary optimization, control engineers are able to obtain a near-optimal ‘‘off-thecomputer’’ controller by feeding the developed CACSD system with plant I/O data and customer specifications without the need of a differentiable performance index. A speedup of near-linear pipelineability is also observed for the EA parallelism implemented on a network of transputers of Parsytec SuperCluster. Validation results against linear and nonlinear physical plants are convincing, with good closed-loop performance and robustness in the presence of practical constraints and perturbations

    Disturbance analysis of nonlinear differential equation models of genetic SUM regulatory networks

    Get PDF
    Noise disturbances and time delays are frequently met in cellular genetic regulatory systems. This paper is concerned with the disturbance analysis of a class of genetic regulatory networks described by nonlinear differential equation models. The mechanisms of genetic regulatory networks to amplify (attenuate) external disturbance are explored, and a simple measure of the amplification (attenuation) level is developed from a nonlinear robust control point of view. It should be noted that the conditions used to measure the disturbance level are delay-independent or delay-dependent, and are expressed within the framework of linear matrix inequalities, which can be characterized as convex optimization, and computed by the interior-point algorithm easily. Finally, by the proposed method, a numerical example is provided to illustrate how to measure the attenuation of proteins in the presence of external disturbances. © 2011 IEEE.published_or_final_versio
    corecore