5,248 research outputs found
Distributed Average Consensus under Quantized Communication via Event-Triggered Mass Summation
We study distributed average consensus problems in multi-agent systems with
directed communication links that are subject to quantized information flow.
The goal of distributed average consensus is for the nodes, each associated
with some initial value, to obtain the average (or some value close to the
average) of these initial values. In this paper, we present and analyze a
distributed averaging algorithm which operates exclusively with quantized
values (specifically, the information stored, processed and exchanged between
neighboring agents is subject to deterministic uniform quantization) and relies
on event-driven updates (e.g., to reduce energy consumption, communication
bandwidth, network congestion, and/or processor usage). We characterize the
properties of the proposed distributed averaging protocol on quantized values
and show that its execution, on any time-invariant and strongly connected
digraph, will allow all agents to reach, in finite time, a common consensus
value represented as the ratio of two integer that is equal to the exact
average. We conclude with examples that illustrate the operation, performance,
and potential advantages of the proposed algorithm
Event-based recursive distributed filtering over wireless sensor networks
In this technical note, the distributed filtering problem is investigated for a class of discrete time-varying systems with an event-based communication mechanism. Each intelligent sensor node transmits the data to its neighbors only when the local innovation violates a predetermined Send-on-Delta (SoD) data transmission condition. The aim of the proposed problem is to construct a distributed filter for each sensor node subject to sporadic communications over wireless networks. In terms of an event indicator variable, the triggering information is utilized so as to reduce the conservatism in the filter analysis. An upper bound for the filtering error covariance is obtained in form of Riccati-like difference equations by utilizing the inductive method. Subsequently, such an upper bound is minimized by appropriately designing the filter parameters iteratively, where a novel matrix simplification technique is developed to handle the challenges resulting from the sparseness of the sensor network topology and filter structure preserving issues. The effectiveness of the proposed strategy is illustrated by a numerical simulation.This work is supported by National Basic Research Program of China (973 Program) under Grant 2010CB731800, National Natural Science Foundation of China under Grants 61210012, 61290324, 61473163 and 61273156, and Jiangsu Provincial Key Laboratory of E-business at Nanjing University of Jiangsu and Economics of China under Grant JSEB201301
Distributed Optimization via Gradient Descent with Event-Triggered Zooming over Quantized Communication
In this paper, we study unconstrained distributed optimization strongly
convex problems, in which the exchange of information in the network is
captured by a directed graph topology over digital channels that have limited
capacity (and hence information should be quantized). Distributed methods in
which nodes use quantized communication yield a solution at the proximity of
the optimal solution, hence reaching an error floor that depends on the
quantization level used; the finer the quantization the lower the error floor.
However, it is not possible to determine in advance the optimal quantization
level that ensures specific performance guarantees (such as achieving an error
floor below a predefined threshold). Choosing a very small quantization level
that would guarantee the desired performance, requires {information} packets of
very large size, which is not desirable (could increase the probability of
packet losses, increase delays, etc) and often not feasible due to the limited
capacity of the channels available. In order to obtain a
communication-efficient distributed solution and a sufficiently close proximity
to the optimal solution, we propose a quantized distributed optimization
algorithm that converges in a finite number of steps and is able to adjust the
quantization level accordingly. The proposed solution uses a finite-time
distributed optimization protocol to find a solution to the problem for a given
quantization level in a finite number of steps and keeps refining the
quantization level until the difference in the solution between two successive
solutions with different quantization levels is below a certain pre-specified
threshold
Performance analysis with network-enhanced complexities: On fading measurements, event-triggered mechanisms, and cyber attacks
Copyright © 2014 Derui Ding et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Nowadays, the real-world systems are usually subject to various complexities such as parameter uncertainties, time-delays, and nonlinear disturbances. For networked systems, especially large-scale systems such as multiagent systems and systems over sensor networks, the complexities are inevitably enhanced in terms of their degrees or intensities because of the usage of the communication networks. Therefore, it would be interesting to (1) examine how this kind of network-enhanced complexities affects the control or filtering performance; and (2) develop some suitable approaches for controller/filter design problems. In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered mechanisms, and attack behaviors of adversaries. First, these three kinds of complexities are introduced in detail according to their engineering backgrounds, dynamical characteristic, and modelling techniques. Then, the developments of the performance analysis and synthesis issues for various networked systems are systematically reviewed. Furthermore, some challenges are illustrated by using a thorough literature review and some possible future research directions are highlighted.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
Event-triggered output consensus for linear multi-agent systems via adaptive distributed observer
summary:This paper investigates the distributed event-triggered cooperative output regulation problem for heterogeneous linear continuous-time multi-agent systems (MASs). To eliminate the requirement of continuous communication among interacting following agents, an event-triggered adaptive distributed observer is skillfully devised. Furthermore, a class of closed-loop estimators is constructed and implemented on each agent such that the triggering times on each agent can be significantly reduced while at the same time the desired control performance can be preserved. Compared with the existing open-loop estimators, the proposed estimators can provide more accurate state estimates during each triggering period. It is further shown that the concerned cooperative output regulation problem can be effectively resolved under the proposed control scheme and the undesirable Zeno behavior can be excluded. Finally, the effectiveness of the proposed results is verified by numerical simulations
Analysis of time delays in scheduled and unscheduled communication used in process automation
This paper introduces a network model for analysing the time delays of scheduled and unscheduled communication services among field devices used in process automation. The proposed model is implemented by configuring multiple control loops of real-time field devices into a network. The consensus of the network is designed using segment checkerTM simulation software. The simulated network of the field devices is re-configured for the proposed network model by mapping virtually. Every device is treated as a node in the network model and the real-time data is accessed. The time delays recorded for both scheduled and unscheduled communication of field-bus topology in simulation environment and the performance is compared with scheduled communication delay. The better bandwidth utilization and assignment of field device is achieved by introducing the unscheduled communication time delays in the network. It helps in the improvement of network capacity by accommodating more devices and reduces the commissioning cost
- …