Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEvent-Triggered Distributed Stabilization of Interconnected Multiagent Systems with Abnormal Agent and Control Layers: Theoretical Analysis
136
0
0.0
(
0
)
Authors
Vahid Rezaei
Ask ChatGPT about the research
No Arabic abstract
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 and 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.
rate research
Read More
This study considers the problem of periodic event-triggered (PET) cooperative output regulation for a class of linear multi-agent systems. The advantage of the PET output regulation is that the data transmission and triggered condition are only needed to be monitored at discrete sampling instants. It is assumed that only a small number of agents can have access to the system matrix and states of the leader. Meanwhile, the PET mechanism is considered not only in the communication between various agents, but also in the sensor-to-controller and controller-to-actuator transmission channels for each agent. The above problem set-up will bring some challenges to the controller design and stability analysis. Based on a novel PET distributed observer, a PET dynamic output feedback control method is developed for each follower. Compared with the existing works, our method can naturally exclude the Zeno behavior, and the inter-event time becomes multiples of the sampling period. Furthermore, for every follower, the minimum inter-event time can be determined textit{a prior}, and computed directly without the knowledge of the leader information. An example is given to verify and illustrate the effectiveness of the new design scheme.
Consensusability is an important property for many multi-agent systems (MASs) as it implies the existence of networked controllers driving the states of MAS subsystems to the same value. Consensusability is of interest even when the MAS subsystems are physically coupled, which is the case for real-world systems such as power networks. In this paper, we study necessary and sufficient conditions for the consensusability of linear interconnected MASs. These conditions are given in terms of the parameters of the subsystem matrices, as well as the eigenvalues of the physical and communication graph Laplacians. Our results show that weak coupling between subsystems and fast information diffusion rates in the physical and communication graphs favor consensusability. Technical results are verified through computer simulations.
In this paper we investigate multi-agent discrete-event systems with partial observation. The agents can be divided into several groups in each of which the agents have similar (isomorphic) state transition structures, and thus can be relabeled into the same template. Based on the template a scalable supervisor whose state size and computational cost are independent of the number of agents is designed for the case of partial observation. The scalable supervisor under partial observation does not need to be recomputed regardless of how many agents are added to or removed from the system. We generalize our earlier results to partial observation by proposing sufficient conditions for safety and maximal permissiveness of the scalable least restrictive supervisor on the template level. An example is provided to illustrate the proposed scalable supervisory synthesis.
We study distributed estimation of a high-dimensional static parameter vector through a group of sensors whose communication network is modeled by a fixed directed graph. Different from existing time-triggered communication schemes, an event-triggered asynchronous scheme is investigated in order to reduce communication while preserving estimation convergence. A distributed estimation algorithm with a single step size is first proposed based on an event-triggered communication scheme with a time-dependent decaying threshold. With the event-triggered scheme, each sensor sends its estimate to neighbor sensors only when the difference between the current estimate and the last sent-out estimate is larger than the triggering threshold. We prove that the proposed algorithm has mean-square and almost-sure convergence respectively, under an integrated condition of sensor network topology and sensor measurement matrices. The condition is satisfied if the topology is a balanced digraph containing a spanning tree and the system is collectively observable. Moreover, we provide estimates for the convergence rates, which are related to the step size as well as the triggering threshold. Furthermore, as an essential metric of sensor communication intensity in the event-triggered distributed algorithms, the communication rate is proved to decay to zero with a certain speed almost surely as time goes to infinity. We show that given the step size, adjusting the decay speed of the triggering threshold can lead to a tradeoff between the convergence rate of the estimation error and the decay speed of the communication rate. Specifically, increasing the decay speed of the threshold would make the communication rate decay faster, but reduce the convergence rate of the estimation error. Numerical simulations are provided to illustrate the developed results.
This paper proposes decentralized resource-aware coordination schemes for solving network optimization problems defined by objective functions which combine locally evaluable costs with network-wide coupling components. These methods are well suited for a group of supervised agents trying to solve an optimization problem under mild coordination requirements. Each agent has information on its local cost and coordinates with the network supervisor for information about the coupling term of the cost. The proposed approach is feedback-based and asynchronous by design, guarantees anytime feasibility, and ensures the asymptotic convergence of the network state to the desired optimizer. Numerical simulations on a power system example illustrate our results.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
