Amit Diwadkar

Amit Diwadkar, Umesh Vaidya

In this paper, we study the problem of state observation of nonlinear systems over an erasure channel. The notion of mean square exponential stability is used to analyze the stability property of observer error dynamics. The main results of this paper prove, fundamental limitation arises for mean square exponential stabilization of the observer error dynamics, expressed in terms of probability of erasure, and positive Lyapunov exponents of the system. Positive Lyapunov exponents are a measure of average expansion of nearby trajectories on an attractor set for nonlinear systems. Hence, the dependence of limitation results on the Lyapunov exponents highlights the important role played by non-equilibrium dynamics in observation over an erasure channel. The limitation on observation is also related to measure-theoretic entropy of the system, which is another measure of dynamical complexity. The limitation result for the observation of linear systems is obtained as a special case, where Lyapunov exponents are shown to emerge as the natural generalization of eigenvalues from linear systems to nonlinear systems.

Amit Diwadkar, Sambarta Dasgupta, Umesh Vaidya

In this paper, we study the problem of control of discrete-time nonlinear systems in Lure form over erasure channels at the input and output. The input and output channel uncertainties are modeled as Bernoulli random variables. The main results of this paper provide sufficient condition for the mean square exponential stability of the closed loop system expressed in terms of statistics of channel uncertainty and plant characteristics. We also provide synthesis method for the design of observer-based controller that is robust to channel uncertainty. To prove the main results of this paper, we discover a stochastic variant of the well known Positive Real Lemma and principle of separation for stochastic nonlinear system. Application of the results for the stabilization of system in Lure form over packet-drop network is discussed. Finally a result for state feedback control of a Lure system with a general multiplicative uncertainty at actuation is discussed.

Sai Pushpak, Amit Diwadkar, Umesh Vaidya

In this technical note, we study the mean square stability-based analysis of stochastic continuous-time linear networked systems. The stochastic uncertainty is assumed to enter multiplicatively in system dynamics through input and output channels of the plant. Necessary and sufficient conditions for mean square exponential stability are expressed in terms of the input-output property of deterministic or nominal system dynamics captured by the {\it mean square} system norm and variance of channel uncertainty. The stability results can also be interpreted as a small gain theorem for continuous-time stochastic systems. Linear Matrix Inequalities (LMI)-based optimization formulation is provided for the computation of mean square system norm for stability analysis. For a special case of single input channel uncertainty, we also prove a fundamental limitation result that arises in the mean square exponential stabilization of the continuous-time linear system. Overall, the contributions in this work generalize the existing results on stability analysis from discrete-time linear systems to continuous-time linear systems with multiplicative uncertainty. Simulation results are presented for WSCC $9$ bus power system to demonstrate the application of the developed framework.

Amit Diwadkar, Umesh Vaidya

We study synchronization in scalar nonlinear systems connected over a linear network with stochastic uncertainty in their interactions. We provide a sufficient condition for the synchronization of such network systems expressed in terms of the parameters of the nonlinear scalar dynamics, the second and largest eigenvalues of the mean interconnection Laplacian, and the variance of the stochastic uncertainty. The sufficient condition is independent of network size thereby making it attractive for verification of synchronization in a large size network. The main contribution of this paper is to provide analytical characterization for the interplay of roles played by the internal dynamics of the nonlinear system, network topology, and uncertainty statistics in network synchronization. We show there exist important tradeoffs between these various network parameters necessary to achieve synchronization. We show for nearest neighbor networks with stochastic uncertainty in interactions there exists an optimal number of neighbors with maximum margin for synchronization. This proves in the presence of interaction uncertainty, too many connections among network components is just as harmful for synchronization as the lack of connection. We provide an analytical formula for the optimal gain required to achieve maximum synchronization margin thereby allowing us to compare various complex network topology for their synchronization property.