Chaitanya Murti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chaitanya Murti has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Matthew M. Peet
School for the Engineering of Matter, Transport and Energy, Arizona State University, Tempe, AZ, USA
3 shared publications - Reza Kamyar
School of Matter Transport and Energy Goldwater Center for Science and Engineering 531 Tempe Arizona State University 85281 USA
1 shared publication
Latest Publications
- Open Access
Constructing Piecewise Polynomial Lyapunov Functions for Local Stability of Nonlinear Systems Using Handelman's Theorem
In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the polytope into several convex sub-polytopes with a common vertex at the equilibrium. Then, by using Handelman's theorem, we derive a new set of affine feasibility conditions -solvable by linear programming- on each sub-polytope. Any solution to this feasibility problem yields a piecewise polynomial Lyapunov function on the entire polytope. This is the first result which utilizes Handelman's theorem and decomposition to construct piecewise polynomial Lyapunov functions on arbitrary polytopes. In a computational complexity analysis, we show that for large number of states and large degrees of the Lyapunov function, the complexity of the proposed feasibility problem is less than the complexity of certain semi-definite programs associated with alternative methods based on Sum-of-Squares or Polya's theorem. Using different types of convex polytopes, we assess the accuracy of the algorithm in estimating the region of attraction of the equilibrium point of the reverse-time Van Der Pol oscillator.
Open AccessConstructing Piecewise Polynomial Lyapunov Functions for Local Stability of Nonlinear Systems Using Handelman's Theorem
In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the polytope into several convex sub-polytopes with a common vertex at the equilibrium. Then, by using Handelman's theorem, we derive a new set of affine feasibility conditions -solvable by linear programming- on each sub-polytope. Any solution to this feasibility problem yields a piecewise polynomial Lyapunov function on the entire polytope. This is the first result which utilizes Handelman's theorem and decomposition to construct piecewise polynomial Lyapunov functions on arbitrary polytopes. In a computational complexity analysis, we show that for large number of states and large degrees of the Lyapunov function, the complexity of the proposed feasibility problem is less than the complexity of certain semi-definite programs associated with alternative methods based on Sum-of-Squares or Polya's theorem. Using different types of convex polytopes, we assess the accuracy of the algorithm in estimating the region of attraction of the equilibrium point of the reverse-time Van Der Pol oscillator.
- Open Access
Using SOS for Analysis of Zeno Stability in Hybrid systems with Nonlinearity and Uncertainy
Hybrid systems exhibit phenomena which do not occur in systems with continuous vector fields. One such phenomenon - Zeno executions - is characterized by an infinite number of discrete events or transitions occurring over a finite interval of time. This phenomenon is not necessarily undesirable and may indeed be used to capture physical phenomena. In this paper, we examine the problem of proving the existence and stability of zero executions. Our approach is to develop a polynomial-time algorithm - based on the sum-of-squares methodology - for verifying the stability of a Zeno execution. We begin by stating Lyapunov-like theorems for local Zeno stability based on existing results. Then, for hybrid systems with polynomial vector fields, we use polynomial Lyapunov functions and semialgebraic geometry (Positivstellensatz results) to reduce the local Lyapunov-like conditions to a convex feasibility problem in polynomial variables. The feasibility problem is then tested using an algorithm for sum-of-squares programming - SOSTOOLS. We also extend these results to hybrid system with parametric uncertainty, where the uncertain parameters lie in a semialgebriac set. We also provide several examples illustrating the use of our technique.
Open AccessUsing SOS for Analysis of Zeno Stability in Hybrid systems with Nonlinearity and Uncertainy
Hybrid systems exhibit phenomena which do not occur in systems with continuous vector fields. One such phenomenon - Zeno executions - is characterized by an infinite number of discrete events or transitions occurring over a finite interval of time. This phenomenon is not necessarily undesirable and may indeed be used to capture physical phenomena. In this paper, we examine the problem of proving the existence and stability of zero executions. Our approach is to develop a polynomial-time algorithm - based on the sum-of-squares methodology - for verifying the stability of a Zeno execution. We begin by stating Lyapunov-like theorems for local Zeno stability based on existing results. Then, for hybrid systems with polynomial vector fields, we use polynomial Lyapunov functions and semialgebraic geometry (Positivstellensatz results) to reduce the local Lyapunov-like conditions to a convex feasibility problem in polynomial variables. The feasibility problem is then tested using an algorithm for sum-of-squares programming - SOSTOOLS. We also extend these results to hybrid system with parametric uncertainty, where the uncertain parameters lie in a semialgebriac set. We also provide several examples illustrating the use of our technique.
- Open Access
A Sum-of-Squares Approach to the Analysis of Zeno Stability in Polynomial Hybrid Systems
Hybrid dynamical systems can exhibit many unique phenomena, such as Zeno behavior. Zeno behavior is the occurrence of infinite discrete transitions in finite time. Zeno behavior has been likened to a form of finite-time asymptotic stability, and corresponding Lyapunov theorems have been developed. In this paper, we propose a method to construct Lyapunov functions to prove Zeno stability of compact sets in cyclic hybrid systems with parametric uncertainties in the vector fields, domains and guard sets, and reset maps utilizing sum-of-squares programming. This technique can easily be applied to cyclic hybrid systems without parametric uncertainties as well. Examples illustrating the use of the proposed technique are also provided.
Open AccessA Sum-of-Squares Approach to the Analysis of Zeno Stability in Polynomial Hybrid Systems
Hybrid dynamical systems can exhibit many unique phenomena, such as Zeno behavior. Zeno behavior is the occurrence of infinite discrete transitions in finite time. Zeno behavior has been likened to a form of finite-time asymptotic stability, and corresponding Lyapunov theorems have been developed. In this paper, we propose a method to construct Lyapunov functions to prove Zeno stability of compact sets in cyclic hybrid systems with parametric uncertainties in the vector fields, domains and guard sets, and reset maps utilizing sum-of-squares programming. This technique can easily be applied to cyclic hybrid systems without parametric uncertainties as well. Examples illustrating the use of the proposed technique are also provided.