اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAnalysis and distributed control of periodic epidemic processes
68
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper studies epidemic processes over discrete-time periodic time-varying networks. We focus on the susceptible-infected-susceptible (SIS) model that accounts for a (possibly) mutating virus. We say that an agent is in the disease-free state if it is not infected by the virus. Our objective is to devise a control strategy which ensures that all agents in a network exponentially (resp. asymptotically) converge to the disease-free equilibrium (DFE). Towards this end, we first provide a) sufficient conditions for exponential (resp. asymptotic) convergence to the DFE; and b) a necessary and sufficient condition for asymptotic convergence to the DFE. The sufficient condition for global exponential stability (GES) (resp. global asymptotic stability (GAS)) of the DFE is in terms of the joint spectral radius of a set of suitably-defined matrices, whereas the necessary and sufficient condition for GAS of the DFE involves the spectral radius of an appropriately-defined product of matrices. Subsequently, we leverage the stability results in order to design a distributed control strategy for eradicating the epidemic.
قيم البحث
اقرأ أيضاً
In this paper we study a discrete-time SIS (susceptible-infected-susceptible) model, where the infection and healing parameters and the underlying network may change over time. We provide conditions for the model to be well-defined and study its stab
ility. For systems with homogeneous infection rates over symmetric graphs,we provide a sufficient condition for global exponential stability (GES) of the healthy state, that is, where the virus is eradicated. For systems with heterogeneous virus spread over directed graphs, provided that the variation is not too fast, a sufficient condition for GES of the healthy state is established.
In this paper, a distributed learning leader-follower consensus protocol based on Gaussian process regression for a class of nonlinear multi-agent systems with unknown dynamics is designed. We propose a distributed learning approach to predict the re
sidual dynamics for each agent. The stability of the consensus protocol using the data-driven model of the dynamics is shown via Lyapunov analysis. The followers ultimately synchronize to the leader with guaranteed error bounds by applying the proposed control law with a high probability. The effectiveness and the applicability of the developed protocol are demonstrated by simulation examples.
A graph theoretic framework recently has been proposed to stabilize interconnected multiagent systems in a distributed fashion, while systematically capturing the architectural aspect of cyber-physical systems with separate agent or physical layer an
d control or cyber layer. Based on that development, in addition to the modeling uncertainties over the agent layer, we consider a scenario where the control layer is subject to the denial of service attacks. We propose a step-by-step procedure to design a control layer that, in the presence of the aforementioned abnormalities, guarantees a level of robustness and resiliency for the final two-layer interconnected multiagent system. The incorporation of an event-triggered strategy further ensures an effective use of the limited energy and communication resources over the control layer. We theoretically prove the resilient, robust, and Zeno-free convergence of all state trajectories to the origin and, via a simulation study, discuss the feasibility of the proposed ideas.
Distributed linear control design is crucial for large-scale cyber-physical systems. It is generally desirable to both impose information exchange (communication) constraints on the distributed controller, and to limit the propagation of disturbances
to a local region without cascading to the global network (localization). Recently proposed System Level Synthesis (SLS) theory provides a framework where such communication and localization requirements can be tractably incorporated in controller design and implementation. In this work, we derive a solution to the localized and distributed H2 state feedback control problem without resorting to Finite Impulse Response (FIR) approximation. Our proposed synthesis algorithm allows a column-wise decomposition of the resulting convex program, and is therefore scalable to arbitrary large-scale networks. We demonstrate superior cost performance and computation time of the proposed procedure over previous methods via numerical simulation.
One of the most important branches of nonlinear control theory is the so-called sliding-mode. Its aim is the design of a (nonlinear) feedback law that brings and maintains the state trajectory of a dynamic system on a given sliding surface. Here, dyn
amics becomes completely independent of the model parameters and can be tuned accordingly to the desired target. In this paper we study this problem when the feedback law is subject to strong structural constraints. In particular, we assume that the control input may take values only over two bounded and disjoint sets. Such sets could be also non perfectly known a priori. An example is a control input allowed to switch only between two values. Under these peculiarities, we derive the necessary and sufficient conditions that guarantee sliding-mode control effectiveness for a class of time-varying continuous-time linear systems that includes all the stationary state-space linear models. Our analysis covers several scientific fields. It is only apparently confined to the linear setting and allows also to study an important set of nonlinear models. We describe fundamental examples related to epidemiology where the control input is the level of contact rate among people and the sliding surface permits to control the number of infected. For popular epidemiological models we prove the global convergence of control schemes based on the introduction of severe restrictions, like lockdowns, to contain epidemic. This greatly generalizes previous results obtained in the literature by casting them within a general sliding-mode theory.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
