Robust state estimation for wireless sensor networks with data‐driven communication

Liu, Huabo; Wang, Dongqing

doi:10.1002/rnc.3819

Cited by 20 publications

(13 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theorem 7. For a continuous-time edge dynamic multiagent system (5), let the corresponding digraph G be strongly connected, digon sign-symmetric, and structurally balanced. When the assumption holds, system (5) can asymptotically reach the bipartite consensus of edge dynamics under protocol (6) for ̸ = 0, if the following inequalities are satisfied…”

Section: Resultsmentioning

confidence: 99%

“…Nodes in (a) can be divided into V 1 = {1, 2, 3}, V 2 = {4, 5, 6} and all the negative edges are between different sets. The nodes in (b) (i.e., the edges in (a)) can be divided into E 1 = {(1, 2), (2, 3), (4, 2), (5, 2), (6, 1)} and E 2 = {(2, 6), (3,4), (4,5), (5,6)}. Thus (a) is structurally balanced.…”

Section: Lemma 1 (See [41]) a Strongly Connected Digon Sign-symmetrmentioning

confidence: 99%

“…In recent years, researchers from different fields have done many works for the networked system thanks to the wide applications both to formation control, such as mobile robots, unmanned air vehicles (UAVs), and autonomous underwater vehicles (AUVs), and to distributed control, such as distributed forecasting, monitoring, and diagnostics [1][2][3][4][5][6]. For multiagent network systems, controllability and consensus problems are the focus of researchers [7][8][9][10][11][12][13][14][15].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Bipartite Consensus of High‐Order Edge Dynamics on Coopetition Multiagent Systems

Yang

Tian

et al. 2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The bipartite consensus of high-order edge dynamics is investigated for coopetition multiagent systems, in which the cooperative and competitive relationships among agents are characterized by positive weight and negative weight, respectively. By mapping the initial graph to a line graph, the distributed control protocol is proposed for the strongly connected, digon sign-symmetric structurally balanced line graph; and then we give sufficient conditions for the third-order multi-gent system to achieve both the bipartite consensus of edge dynamics and the final value of bipartite consensus. By transforming the coefficients of characteristic polynomial from complex domain to real number domain, the sufficient conditions for the bipartite consensus of high-order edge dynamics are also proposed, and the final values of the high-order edge dynamics on multiagent systems are obtained.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Lemma 1 (See [41]) a Strongly Connected Digon Sign-symmetrmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Bipartite Consensus of High‐Order Edge Dynamics on Coopetition Multiagent Systems

Yang

Tian

et al. 2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Simulation results illustrate that the investigated method is effective and has advantages of simplicity and efficiency. The proposed IV-OMP optimization method can be extended to the colored noise systems, the networked dynamic systems [42][43][44][45][46], and so on.…”

Section: Discussionmentioning

confidence: 99%

Instrumental Variable‐Based OMP Identification Algorithm for Hammerstein Systems

2018

Self Cite

View full text Add to dashboard Cite

Hammerstein systems are formed by a static nonlinear block followed by a dynamic linear block. To solve the parameterizing difficulty caused by parameter coupling between the nonlinear part and the linear part in a Hammerstein system, an instrumental variable method is studied to parameterize the Hammerstein system. To achieve in simultaneously identifying parameters and orders of the Hammerstein system and to promote the computational efficiency of the identification algorithm, a sparsity-seeking orthogonal matching pursuit (OMP) optimization method of compressive sensing is extended to identify parameters and orders of the Hammerstein system. The idea is, by the filtering technique and the instrumental variable method, to transform the Hammerstein system into a simple form with a separated nonlinear expression and to parameterize the system into an autoregressive model, then to perform an instrumental variable-based orthogonal matching pursuit (IV-OMP) identification method for the Hammerstein system. Simulation results illustrate that the investigated method is effective and has advantages of simplicity and efficiency.

show abstract

“…The algebraic connectivity can be improved by taking advantage of algorithms and graph theory, which was explored in [21][22][23][24]. The convergence rate is susceptible to the perturbation, which will further affect the stability of the system [25][26][27][28]. Based on former researchers' works [29][30][31][32][33][34][35][36][37], we propose a concept of invalid algebraic connectivity weights (IACW), which is shown not only to be resistant to the perturbation but also can avoid unnecessary waste of costs.…”

Section: Introductionmentioning

confidence: 99%

Fast Consensus Seeking on Networks with Antagonistic Interactions

Lin

et al. 2018

Complexity

View full text Add to dashboard Cite

It is well known that all agents in a multiagent system can asymptotically converge to a common value based on consensus protocols. Besides, the associated convergence rate depends on the magnitude of the smallest nonzero eigenvalue of Laplacian matrix L. In this paper, we introduce a superposition system to superpose to the original system and study how to change the convergence rate without destroying the connectivity of undirected communication graphs. And we find the result if the eigenvector x of eigenvalue λ has two identical entries xi=xj, then the weight and existence of the edge eij do not affect the magnitude of λ, which is the argument of this paper. By taking advantage of the inequality of eigenvalues, conditions are derived to achieve the largest convergence rate with the largest delay margin, and, at the same time, the corresponding topology structure is characterized in detail. In addition, a method of constructing invalid algebraic connectivity weights is proposed to keep the convergence rate unchanged. Finally, simulations are given to demonstrate the effectiveness of the results.

show abstract

Robust state estimation for wireless sensor networks with data‐driven communication

Cited by 20 publications

References 24 publications

Bipartite Consensus of High‐Order Edge Dynamics on Coopetition Multiagent Systems

Bipartite Consensus of High‐Order Edge Dynamics on Coopetition Multiagent Systems

Instrumental Variable‐Based OMP Identification Algorithm for Hammerstein Systems

Fast Consensus Seeking on Networks with Antagonistic Interactions

Contact Info

Product

Resources

About