80 research outputs found
Analysis of switched and hybrid systems - beyond piecewise quadratic methods
This paper presents a method for stability analysis of switched and hybrid systems using polynomial and piecewise polynomial Lyapunov functions. Computation of such functions can be performed using convex optimization, based on the sum of squares decomposition of multivariate polynomials. The analysis yields several improvements over previous methods and opens up new possibilities, including the possibility of treating nonlinear vector fields and/or switching surfaces and parametric robustness analysis in a unified way
Robust Stability Analysis of Nonlinear Hybrid Systems
We present a methodology for robust stability analysis of nonlinear hybrid systems, through the algorithmic construction of polynomial and piecewise polynomial Lyapunov-like functions using convex optimization and in particular the sum of squares decomposition of multivariate polynomials. Several improvements compared to previous approaches are discussed, such as treating in a unified way polynomial switching surfaces and robust stability analysis for nonlinear hybrid systems
A new solution approach to polynomial LPV system analysis and synthesis
Based on sum-of-squares (SOS) decomposition, we propose a new solution approach for polynomial LPV system analysis and control synthesis problems. Instead of solving matrix variables over a positive definite cone, the SOS approach tries to find a suitable decomposition to verify the positiveness of given polynomials. The complexity of the SOS-based numerical method is polynomial of the problem size. This approach also leads to more accurate solutions to LPV systems than most existing relaxation methods. Several examples have been used to demonstrate benefits of the SOS-based solution approach
Convex Programs for Temporal Verification of Nonlinear Dynamical Systems
A methodology for safety verification of continuous and hybrid systems using barrier certificates has been proposed recently. Conditions that must be satisfied by a barrier certificate can be formulated as a convex program, and the feasibility of the program implies system safety in the sense that there is no trajectory starting from a given set of initial states that reaches a given unsafe region. The dual of this problem, i.e., the reachability problem, concerns proving the existence of a trajectory starting from the initial set that reaches another given set. Using insights from the linear programming duality appearing in the discrete shortest path problem, we show in this paper that reachability of continuous systems can also be verified through convex programming. Several convex programs for verifying safety and reachability, as well as other temporal properties such as eventuality, avoidance, and their combinations, are formulated. Some examples are provided to illustrate the application of the proposed methods. Finally, we exploit the convexity of our methods to derive a converse theorem for safety verification using barrier certificates
A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates
This paper presents a methodology for safety verification of continuous and hybrid systems in the worst-case and stochastic settings. In the worst-case setting, a function of state termed barrier certificate is used to certify that all trajectories of the system starting from a given initial set do not enter an unsafe region. No explicit computation of reachable sets is required in the construction of barrier certificates, which makes it possible to handle nonlinearity, uncertainty, and constraints directly within this framework. In the stochastic setting, our method computes an upper bound on the probability that a trajectory of the system reaches the unsafe set, a bound whose validity is proven by the existence of a barrier certificate. For polynomial systems, barrier certificates can be constructed using convex optimization, and hence the method is computationally tractable. Some examples are provided to illustrate the use of the method
Nonlinear control synthesis by convex optimization
A stability criterion for nonlinear systems, recently derived by the third author, can be viewed as a dual to Lyapunov's second theorem. The criterion is stated in terms of a function which can be interpreted as the stationary density of a substance that is generated all over the state-space and flows along the system trajectories toward the equilibrium. The new criterion has a remarkable convexity property, which in this note is used for controller synthesis via convex optimization. Recent numerical methods for verification of positivity of multivariate polynomials based on sum of squares decompositions are used
On Analysis and Synthesis of Safe Control Laws
Controller synthesis for nonlinear systems is considered with the following objective: No trajectory starting from a given set of initial states is allowed to enter into a given set of forbidden (unsafe) states. A methodology for safety verification using barrier certificates has recently been proposed. Here it is shown how a safe control law together with a corresponding barrier certificate can be computated by means of convex optimization. A basic tool is thetheory for density functions in analysis of nonlinear systems.Computational examples are considered
Analysis of the lactose metabolism in E. coli using sum-of-squares decomposition
We provide a system-theoretic analysis of the mathematical model of lactose induction in E.coli which predicts the level of lactose induction into the cell for specified values of external lactose. Depending on the levels of external lactose and other parameters, the Lac operon is known to have a low steady state in which it is said to be turned off and high steady state where it is said to be turned on. Furthermore, the model has been shown experimentally to exhibit a bi-stable behavior. Using ideas from Lyapunov stability theory and sum-of-squares decomposition, we characterize the reachable state
space for different sets of initial conditions, calculating estimates of the regions of attraction of the biologically relevant equilibria of this system. The changes in the basins of attraction with changes in model parameters can be used to provide biological insight. Specifically, we explain the crucial role played by a small basal transcription rate in the Lac operon. We show that if the basal rate is below a threshold, the region of attraction of the low steady state grows significantly, indicating that system is trapped in the (off) mode, showing the importance of the basal rate of transcription
- …