Event-Triggered Distributed Average Consensus Over Directed Digital Networks With Limited Communication Bandwidth

Abstract

In this paper, we consider the event-triggered distributed average-consensus of discrete-time first-order multiagent systems with limited communication data rate and general directed network topology. In the framework of digital communication network, each agent has a real-valued state but can only exchange finite-bit binary symbolic data sequence with its neighborhood agents at each time step due to the digital communication channels with energy constraints. Novel event-triggered dynamic encoder and decoder for each agent are designed, based on which a distributed control algorithm is proposed. A scheme that selects the number of channel quantization level (number of bits) at each time step is developed, under which all the quantizers in the network are never saturated. The convergence rate of consensus is explicitly characterized, which is related to the scale of network, the maximum degree of nodes, the network structure, the scaling function, the quantization interval, the initial states of agents, the control gain and the event gain. It is also found that under the designed event-triggered protocol, by selecting suitable parameters, for any directed digital network containing a spanning tree, the distributed average consensus can be always achieved with an exponential convergence rate based on merely one bit information exchange between each pair of adjacent agents at each time step. Two simulation examples are provided to illustrate the feasibility of presented protocol and the correctness of the theoretical results.

An Improved Clustering Method for Detection System of Public Security Events Based on Genetic Algorithm and Semisupervised Learning

“…Select survivor according to the wheel selection rule [23]; (6) End for (7) For all ∈ (0, 1) to max do (8) For all = 1 to do (9) Select randomly two individuals and calculate the crossover probability according to Eq. (12); (10) Generate a random floating-point number , ∈ (0, 1); (11) If ≤ then (12) Perform arithmetic crossover operation [24]; (13) End if (14) End for (15) For all = 1 to do (16) Calcula t eth em u ta tio np r o ba b ili ty according to Eq. (14); (17) Generate a random floating-point number , ∈ (0, 1);…”

“…In order to overcome these shortcomings, a lot of scholars conduct deep research on it to improve parameters of some aspects and propose many new algorithms. For instance, the early research [11] proposed a brFCM algorithm that simplifies data set through quantification and aggregation to improve execution efficiency of FCM algorithm. Kolen and Hutcheson proposed a fuzzy -means method that reduces time complexity [12].…”

Distributed Optimal Day-Ahead Scheduling in a Smart Grid: A Trade-Off among Consumers, Power Suppliers, and Transmission Owners

“…Second, the proposed optimal day-ahead scheduling problem will be solved via the ADMM in a distributed manner as illustrated in (19) and (20) as follows.…”

“…Besides, although many distributed theories [19,20] and decomposition based approaches have been proposed to solve the day-ahead scheduling in distributed manners, the convergence rates of some approaches, such as subgradient projection method, are not fast enough, and they are highly dependent on the choice of step size [16]. Moreover, for most decomposition based approaches, in certain cases, their convergence criteria may not hold and modified decomposition method is required [21].…”

Event-Triggered Discrete-Time Distributed Consensus Optimization over Time-Varying Graphs

“…Meanwhile, the distributed convex optimization problems over general networks were settled in Lobel et al [38] and Matei and Baras [39]. Recent works [40][41][42][43][44][45] have coordinately put their efforts on the consensus of multiagent systems by designing the control protocols based on event-triggered sampling schemes. Lu and Tang [41] proposed a continuous-time consensus-based zerogradient-sum (ZGS) algorithm which is built on the condition of the gradient sum being zero.…”