Filters








4,028 Hits in 4.6 sec

Resilient Asymptotic Consensus in Robust Networks

Heath J. LeBlanc, Haotian Zhang, Xenofon Koutsoukos, Shreyas Sundaram
2013 IEEE Journal on Selected Areas in Communications  
Network robustness formalizes the notion of redundancy of direct information exchange between subsets of nodes in the network, and is a fundamental property for analyzing the behavior of certain distributed  ...  This paper addresses the problem of resilient innetwork consensus in the presence of misbehaving nodes.  ...  Resilient Asymptotic Consensus Given the threat model and scope of threats, we formally define resilient asymptotic consensus.  ... 
doi:10.1109/jsac.2013.130413 fatcat:coer2z3tanf3xazj3ed3kfks2u

On Adversary Robust Consensus protocols through joint-agent interactions [article]

David Angeli, Sabato Manfredi
2019 arXiv   pre-print
A generalized family of Adversary Robust Consensus protocols is proposed and analyzed.  ...  These are distributed algorithms for multi-agents systems seeking to agree on a common value of a shared variable, even in the presence of faulty or malicious agents which are updating their local state  ...  of view, networks that guarantee asymptotic convergence towards consensus.  ... 
arXiv:1901.02725v1 fatcat:gal2feukgvcljlyk7f7shv25my

Robust Dynamic Average Consensus for a Network of Agents with Time-varying Reference Signals [article]

Solomon Gudeta, Ali Karimoddini, Mohammadreza Davoodi
2022 arXiv   pre-print
We propose consensus algorithms that are robust to agents joining and leaving the network, at the same time, avoid the chattering phenomena and guarantee zero steady-state consensus error.  ...  to asymptotically converge to the average of the time-varying reference signals of the agents.  ...  Figure 1 to verify the robustness of the proposed algorithm to agents leaving the network.  ... 
arXiv:2204.04415v1 fatcat:vsyp6zl73zg6dns4x5ejngpcxq

Filtering and Control for Unreliable Communication: The Discrete-Time Case

Guoliang Wei, Lifeng Ma, Zidong Wang
2014 Discrete Dynamics in Nature and Society  
The formal definition of fairness in multiparty nonrepudiation protocols is given and the guideline to verify it based on improved strand space is presented.  ...  In the paper entitled "Event-based control for average consensus of wireless sensor networks with stochastic communication noises" by C.  ...  Acknowledgments This special issue is a timely reflection of the recent research progress in the area of filtering and control for unreliable communication in the discrete-time domain.  ... 
doi:10.1155/2014/890275 fatcat:6dettkhmxrhhhdreo6flwkr4pa

Swarm stability of linear time-invariant descriptor compartmental networks

Ning Cai, M. Junaid Khan
2015 IET Control Theory & Applications  
Three numerical instances are illustrated to verify the theoretical results.  ...  Laplacian spectrum of the overall network topology.  ...  Since consensus is essentially a kind of asymptotic stability, it is robust with certain stability margin.  ... 
doi:10.1049/iet-cta.2014.0130 fatcat:rgsqnop6n5fxrpwlhp3bm72n5m

Average consensus problems in networks of agents with delayed communications

Pierre-Alexandre Bliman, Giancarlo Ferrari-Trecate
2008 Automatica  
The present paper is devoted to the study of average consensus problems for undirected networks of dynamic agents having communication delays.  ...  The main results provide sufficient conditions (also necessary in most cases) for existence of average consensus under bounded, but otherwise unknown, communication delays.  ...  As an example, in a network of moving vehicles a form of consensus is represented by alignment, that happens when all vehicles asymptotically move with the same velocity.  ... 
doi:10.1016/j.automatica.2007.12.010 fatcat:cx5afsv65bfyphxlirwvla3zey

On the Robustness of Uncertain Consensus Networks [article]

Daniel Zelazo, Mathias Bürger
2015 arXiv   pre-print
This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights.  ...  These results are then applied to analyze the robustness properties of the consensus network with additive but bounded perturbations of the edge weights.  ...  We show that in certain cases, the small gain theorem provides an exact robustness margin for the uncertain consensus network.  ... 
arXiv:1408.4471v2 fatcat:fuwkidjounfwvgwaansi3yem5i

Multi-agent flocking with random communication radius

S. Martin, A. Fazeli, A. Jadbabaie, A. Girard
2012 2012 American Control Conference (ACC)  
Consensus can be modeled in a deterministic fashion, however, in many applications it seems that the topology of the network is quite random.  ...  To carry out formal studies on consensus problems, one usually assumes that the multi-agent system follows some abstract communication protocol and then investigates conditions under which a consensus  ...  A drawback in such conditions is that they often cannot be verified a priori. In a random setting, however, sufficient conditions could only ensure asymptotic consensus in probability.  ... 
doi:10.1109/acc.2012.6315594 fatcat:lui43laezzht5bycdq23sdpcua

Multi-agent flocking under topological interactions [article]

Samuel Martin
2013 arXiv   pre-print
networks.  ...  Though conservative, our approach gives conditions that can be verified a priori. Our result is illustrated through simulations.  ...  Conditions usually require invariant connectivity properties in the communication network over time. A drawback in such conditions is that they often cannot be verified a priori.  ... 
arXiv:1311.6046v1 fatcat:3pnf67mdmzeynk5fjl2vhoorv4

Robust Synchronization via Homogeneous Parameter-Dependent Polynomial Contraction Matrix

Dongkun Han, Graziano Chesi
2014 IEEE Transactions on Circuits and Systems Part 1: Regular Papers  
Robust synchronization problem is a key issue in chaotic circuits and nonlinear systems.  ...  Via partial contraction analysis, novel conditions, both for robust exponential synchronization and for robust asymptotical synchronization, are proposed by using parameter-dependent contraction matrices  ...  This work is supported in part by the Research Grants Council of Hong Kong under Grant HKU711213E.  ... 
doi:10.1109/tcsi.2014.2321197 fatcat:gjt2v4fuh5bnjnezhw5glsoqhe

Sufficient conditions for flocking via graph robustness analysis

Samuel Martin, Antoine Girard
2010 49th IEEE Conference on Decision and Control (CDC)  
For this purpose, we define a new notion of graph robustness which allows us to establish such conditions, building upon previous work on multi-agent systems with switching communication networks.  ...  In this paper, we consider a multi-agent system consisting of mobile agents with second-order dynamics.  ...  Consensus over Dynamic Networks In this section, we recall a result from [11] which will be useful for our study.  ... 
doi:10.1109/cdc.2010.5717084 dblp:conf/cdc/MartinG10 fatcat:kjcot5pxn5fa5bzou5api643ja

Robust Self-Triggered Coordination With Ternary Controllers

Claudio De Persis, Paolo Frasca
2013 IEEE Transactions on Automatic Control  
This paper regards the coordination of networked systems, studied in the framework of hybrid dynamical systems.  ...  First, assuming a global clock to be available, we design a time-varying controller which asymptotically drives the system to consensus.  ...  Ugaglia for finding an error in an early draft, and J. M. Hendrickx for pointing out the relation between a few results in this paper and those in [33] .  ... 
doi:10.1109/tac.2013.2273302 fatcat:fikewbtjvngvnnasfcwy2it7cm

Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211)

Javier Esparza, Pierre Fraignaud, Anca Muscholl, Sergio Rajsbaum, Michael Wagner
2018 Dagstuhl Reports  
The Dagstuhl Seminar "Formal Methods and Fault-Tolerant Distributed Computing: Forging an Alliance" took place May 22-25, 2018.  ...  Its goal was to strengthen the interaction between researchers from formal methods and from distributed computing, and help the two communities to better identify common research challenges.  ...  Pretend Synchrony is the title of a recent talk at VDS in Essaouira, Morocco 2018 by Ranjit Jhala where a restricted computational model is shown to be sufficient to verify correctness assertions for several  ... 
doi:10.4230/dagrep.8.5.60 dblp:journals/dagstuhl-reports/EsparzaFMR18 fatcat:72a6n5b32bd7rh7bgl4fb64fmy

How to Stop Consensus Algorithms, locally? [article]

Pei Xie, Keyou You, Cheng Wu
2017 arXiv   pre-print
Finally, we show both in theory and simulation that its effectiveness depends both on the network size and the structure.  ...  This paper studies problems on locally stopping distributed consensus algorithms over networks where each node updates its state by interacting with its neighbors and decides by itself whether certain  ...  Under Assumption 1, it is obvious that the network state dictated in (9) will asymptotically reach consensus.  ... 
arXiv:1703.05106v1 fatcat:phudnhf6djazhmef44f7dzjvpe

The Popov Criterion For Consensus Between Delayed Agents

Anton V. Proskurnikov
2013 IFAC Proceedings Volumes  
We consider consensus algorithms for multi-agent networks with high-order and delayed dynamics of agents.  ...  We obtain conditions of stability for such algorithms that are similar in spirit to the celebrated Popov criterion for the stability of Lurie systems.  ...  In general, L 2 -consensus does not imply asymptotic consensus, and vice versa.  ... 
doi:10.3182/20130904-3-fr-2041.00207 fatcat:r7lkqlonxzbxjodkqva425hnhe
« Previous Showing results 1 — 15 out of 4,028 results