Constrained consensuses in disconnected topologies

This paper is concerned with the constrained consensuses problem for a group of agents in disconnected topologies. By dividing the communication topology into a combination of directed trees, some necessary and sufficient conditions are derived for all the agents to asymptotically reach a single consensus and multiple consensuses, respectively. The obtained results indicate that arbitrary anticipant consensuses can be achieved, if additional constrained controllers are added to those agents with specific indexes. Some illustrative examples are provided to demonstrate the effectiveness of the proposed theoretical results.

Distributed Privacy-Preserving Fusion Estimation Using Homomorphic Encryption

The privacy-preserving problem for distributed fusion estimation scheme is concerned in this paper.When legitimate user wants to obtain consistent information from multiple sensors,it always employs a fusion center(FC)to gather local data and compute distributed fusion estimates(DFEs).Due to the existence of potential eavesdropper,the data exchanged among sensors,FC and user imperatively require privacy preservation.Hence,we propose a distributed confidentiality fusion structure against eavesdropper by using Paillier homomorphic encryption approach.In this case,FC cannot acquire real values of local state estimates,while it only helps calculate encrypted DFEs.Then,the legitimate user can successfully obtain the true values of DFEs according to the encrypted information and secret keys,which is based on the homomorphism of encryption.Finally,an illustrative example is provided to verify the effectiveness of the proposed methods.

GROUP CONSENSUS FOR MULTIPLE NETWORKED EULER-LAGRANGE SYSTEMS WITH PARAMETRIC UNCERTAINTIES

In this paper,a group consensus problem is investigated for multiple networked agents with parametric uncertainties where all the agents are governed by the Euler-Lagrange system with uncertain parameters.In the group consensus problem,the agents asymptotically reach several different states rather than one consistent state.A novel group consensus protocol and a time-varying estimator of the uncertain parameters are proposed for each agent in order to solve the couple-group consensus problem.It is shown that the group consensus is reachable even when the system contains the uncertain parameters.Furthermore,the multi-group consensus is discussed as an extension of the couple-group consensus,and then the group consensus with switching topology is considered.Simulation results are finally provided to validate the effectiveness of the theoretical analysis.

A Disturbance Rejection Control Approach for Clock Synchronization in IEEE 1588 Networks

This paper is concerned with the clock synchronization problem for IEEE 1588 networks.First,the synchronization error is described as a bounded disturbance,and a linear extended state observer (LESO)is designed to estimate the lumped disturbance induced by the oscillator frequency drift and timestamps quantization errors.Then,the lumped disturbance is compensated by the proposed controller.The proposed approach has the advantage that it's able to deal with non-Gaussian disturbance induced by accumulated quantization errors.Simulations are Drovided to validate the effectiveness and superiority of the proposed approach.

Exponential stability analysis for neutral BAM neural networks with time-varying delays and stochastic disturbances

This paper is concerned with the global exponential stability analysis problem for a class of neutral bidi- rectional associative memory （BAM） neural networks with time-varying delays and stochastic disturbances. The stochastic disturbances are described by state-dependent stochastic processes. By utilizing an appropriately constructed Lyapunov- Krasovskii functional （LKF） and some stochastic analysis approaches, novel delay-dependent conditions are established in terms of linear matrix inequalities （LMIs）, which can be easily solved by existing convex optimization techniques. Further- more, the exponential convergence rate can be estimated based on the obtained results. An illustrate example is given to demonstrate the effectiveness of the proposed methods.