Filters








19,321 Hits in 4.8 sec

A Global Identifiability Condition for Consensus Networks with Tree Graphs [article]

Seyedbehzad Nabavi, Aranya Chakrabortty, Pramod P. Khargonekar
<span title="2014-11-27">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we present a sufficient condition that guarantees identifiability of linear network dynamic systems exhibiting continuous-time weighted consensus protocols with acyclic structure.  ...  Each edge of the underlying network graph G of the system is defined by a constant parameter, referred to as the weight of the edge, while each node is defined by a scalar state whose dynamics evolve as  ...  CONCLUSIONS In this paper, we developed a sensor placement algorithm to ensure global identifiability of weighted consensus networks with first-order dynamics and tree structures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1412.0684v1">arXiv:1412.0684v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jxbnxtx2vrbmniwjh2mqn45hga">fatcat:jxbnxtx2vrbmniwjh2mqn45hga</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826043257/https://arxiv.org/pdf/1412.0684v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/43/b0/43b0955da6b19b110a68fcf5fcff95222c2051a8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1412.0684v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A global identifiability condition for consensus networks on tree graphs

Seyedbehzad Nabavi, Aranya Chakrabortty, Pramod P. Khargonekar
<span title="">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lotzoejqpjhmjn2kywwcxlndie" style="color: black;">2015 American Control Conference (ACC)</a> </i> &nbsp;
In this paper we present a sufficient condition that guarantees identifiability of linear network dynamic systems exhibiting continuous-time weighted consensus protocols with acyclic structure.  ...  Each edge of the underlying network graph G of the system is defined by a constant parameter, referred to as the weight of the edge, while each node is defined by a scalar state whose dynamics evolve as  ...  CONCLUSIONS In this paper, we developed a sensor placement algorithm to ensure global identifiability of weighted consensus networks with first-order dynamics and tree structures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/acc.2015.7170999">doi:10.1109/acc.2015.7170999</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/amcc/NabaviCK15.html">dblp:conf/amcc/NabaviCK15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wojxzif64fdd7c36d2ac2m572e">fatcat:wojxzif64fdd7c36d2ac2m572e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200313094120/https://escholarship.org/content/qt82m9c5zh/qt82m9c5zh.pdf?t=p19ego" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/8a/f48ae705d51cfb5df5cf5e6fe850e42868045dfb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/acc.2015.7170999"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Semi-Global Leader-Following Consensus of Linear Multi-Agent Systems With Input Saturation via Low Gain Feedback

Housheng Su, Michael Z. Q. Chen, James Lam, Zongli Lin
<span title="">2013</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/l6r6h4xpzvh6jkuzrx565pgwgu" style="color: black;">IEEE Transactions on Circuits and Systems Part 1: Regular Papers</a> </i> &nbsp;
This paper investigates the problem of leader-following consensus of a linear multi-agent system on a switching network. The input of each agent is subject to saturation.  ...  It is established that, under the assumptions that each agent is asymptotically null controllable with bounded controls and that the network is connected or jointly connected, semi-global leader-following  ...  Consensus on a Connected Switching Network We consider the problem of semi-global leader-following consensus when the network is switching.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcsi.2012.2226490">doi:10.1109/tcsi.2012.2226490</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dfxq5qgcnzcdzhccpwsmq2bqj4">fatcat:dfxq5qgcnzcdzhccpwsmq2bqj4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171128015340/https://core.ac.uk/download/pdf/38031384.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d7/21/d721baea419b1976edefcc276ff58082a333c38c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcsi.2012.2226490"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Optimal Network Design for Consensus Formation: Wisdom of Networked Agents

Eugene S., Akira Namatame
<span title="">2014</span> <i title="The Science and Information Organization"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2yzw5hsmlfa6bkafwsibbudu64" style="color: black;">International Journal of Advanced Computer Science and Applications</a> </i> &nbsp;
In both the fastest and slowest networks presented, consensus is formed among local structures first, then on a global scale.  ...  However, designing networks with desirable properties is complex and it may pose a multi-constraint and multi-criterion optimization problem.  ...  On the ring-trees network, where agents are divided into each tree network, local consensus is promoted in each tree network at first. After that, the global consensus is formed via the ring network.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14569/ijacsa.2014.050805">doi:10.14569/ijacsa.2014.050805</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gnawvaywuzbgxnhtpwjdrrdc3a">fatcat:gnawvaywuzbgxnhtpwjdrrdc3a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829185226/http://www.thesai.org/Downloads/Volume5No8/Paper_5-Optimal_Network_Design_for_Consensus_Formation.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/de/36/de368fad20aeeccdda80bd59a730bb248b814546.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14569/ijacsa.2014.050805"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Consensus in Directed Networks of Agents With Nonlinear Dynamics

Wenwu Yu, Guanrong Chen, Ming Cao
<span title="">2011</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tiaci7xy45hczhz755zlpu5h7q" style="color: black;">IEEE Transactions on Automatic Control</a> </i> &nbsp;
This technical note studies the consensus problem for cooperative agents with nonlinear dynamics in a directed network. Both local and global consensus are defined and investigated.  ...  A generalized algebraic connectivity is then proposed to study the global consensus problem in strongly connected networks and also in a broad class of networks containing spanning trees, for which ideas  ...  Next, analysis on the global consensus is presented assuming that graph G has a spanning tree.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tac.2011.2112477">doi:10.1109/tac.2011.2112477</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vzon2eubr5fyrcmvdla6hgvfu4">fatcat:vzon2eubr5fyrcmvdla6hgvfu4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190414195023/https://core.ac.uk/download/pdf/148235997.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d6/78/d6786e0d13967cd3ccbfb88b23ddae64d7564627.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tac.2011.2112477"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Discrete-time average-consensus under switching network topologies

D.B. Kingston, R.W. Beard
<span title="">2006</span> <i title="IEEE"> 2006 American Control Conference </i> &nbsp;
This paper develops a distributed algorithm for average-consensus in a discrete-time framework based on a formal matrix limit definition of average-consensus.  ...  In other words, if at each instant the network is balanced and the union of graphs over every interval T is connected, then average-consensus can be achieved.  ...  of the interaction graphs over every interval T must contain a spanning tree to reach consensus.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/acc.2006.1657268">doi:10.1109/acc.2006.1657268</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fn6vw27y7jgerajwqkld6jr7t4">fatcat:fn6vw27y7jgerajwqkld6jr7t4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060913174256/http://www.et.byu.edu/~dbk4/papers/KingstonBeard06.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6a/d1/6ad12773566a358f1c10c3171492c8f56f6a0b99.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/acc.2006.1657268"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Average Consensus in Matrix-Weight-Balanced Digraphs

Yogesh Chinnappa, Daniela Constantinescu
<span title="">2019</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hrz75ifnhbfxfmov3zw4lgfyvu" style="color: black;">2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)</a> </i> &nbsp;
Simulations with robots in SIMULINK verify that positive definite matrix weights on balanced graphs are indeed necessary and sufficient for average consensus.  ...  Further, the necessary and sufficient condition for the system to achieve average consensus is shown to be positive definiteness of the matrix weights of its balanced digraph.  ...  spanning tree as the necessary and sufficient condition for consensus [50] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/coase.2019.8843272">doi:10.1109/coase.2019.8843272</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/case/ChinnappaC19.html">dblp:conf/case/ChinnappaC19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ww3j4hxt4rdjppcsx6pl3chwti">fatcat:ww3j4hxt4rdjppcsx6pl3chwti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200307150331/https://dspace.library.uvic.ca/bitstream/handle/1828/10711/Allapanda_ChinnappaYogeshB_MASc_2019.pdf;jsessionid=7A244089B32AA5B810D74BB67765EBB3?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/83/ea/83eac51eb6378a792adb676e0d32bcd0729d7ea1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/coase.2019.8843272"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Consensus Problem in Multi-Agent Systems with Communication Channel Constraint on Signal Amplitude

MingHui WANG, Kenko UCHIDA
<span title="">2013</span> <i title="The Society of Instrument and Control Engineers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ts2kn3kfmfcxhldnkhesf6bfcy" style="color: black;">SICE Journal of Control Measurement and System Integration</a> </i> &nbsp;
if the directed graph is balanced; it is shown in a non-identical constraint case that the other protocol can provide the system with an asymptotic consensus.  ...  It is shown in an identical constraint case that the system given by one of the two protocols can reach globally asymptotically consensus and that the system can also achieve a generalized average-consensus  ...  n ) T implies x 1 = x 2 = • • • = x n ; (iii) Global consensus is reached asymptotically for the system (3); (iv) The directed graph with L as the Laplacian has a directed spanning tree; (v) rank(L) =  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9746/jcmsi.6.7">doi:10.9746/jcmsi.6.7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/szhfjtaiuzafxllwgs3brqae34">fatcat:szhfjtaiuzafxllwgs3brqae34</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180730055921/https://www.jstage.jst.go.jp/article/jcmsi/6/1/6_7/_pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/08/71/08711719a009bfea3c082b971ac269dc8cd699a9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9746/jcmsi.6.7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Resilient distributed consensus for tree topology

Mark Yampolskiy, Yevgeniy Vorobeychik, Xenofon D. Koutsoukos, Peter Horvath, Heath J. LeBlanc, Janos Sztipanovits
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mvntltzyqrgsnfpssbtnrtm534" style="color: black;">Proceedings of the 3rd international conference on High confidence networked systems - HiCoNS &#39;14</a> </i> &nbsp;
Especially closer to the end customer, in home and building area networks, the connectivity graph resembles a tree structure.  ...  R.ARC-P is capable of reaching global consensus among all genuine nodes in the tree if assumptions about maximal number of malicious nodes in the neighborhood hold.  ...  We distinguish between following cases of consensus: Global Consensus: We define Global Consensus as a consensus among all genuine leaf nodes.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2566468.2566485">doi:10.1145/2566468.2566485</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/hicons/YampolskiyVKHLS14.html">dblp:conf/hicons/YampolskiyVKHLS14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2gdrfpaqh5duppdbpr3c5mk4m4">fatcat:2gdrfpaqh5duppdbpr3c5mk4m4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705131953/http://www.vuse.vanderbilt.edu/%7Ekoutsoxd/www/Publications/p41-yampolskiy.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/67/9d/679d4b6f7ad5aba68f16caf6bfcaa43d7b907324.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2566468.2566485"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Distributed Compressed Sensing for Static and Time-Varying Networks

Stacy Patterson, Yonina C. Eldar, Idit Keidar
<span title="">2014</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gkn2pu46ozb4tmkxczacnmtvkq" style="color: black;">IEEE Transactions on Signal Processing</a> </i> &nbsp;
Every agent has a set of measurements of a signal x, and the objective is for the agents to recover x from their collective measurements using only communication with neighbors in the network.  ...  We first present a distributed IHT algorithm for static networks that leverages standard tools from distributed computing to execute in-network computations with minimized bandwidth consumption.  ...  Computation for DIHT: As a pre-processing step for DIHT, the agents construct a spanning tree of the graph with agent 1 as its root.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tsp.2014.2340812">doi:10.1109/tsp.2014.2340812</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3msbx6oekragheal6cjchc6ade">fatcat:3msbx6oekragheal6cjchc6ade</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810052032/http://webee.technion.ac.il/people/YoninaEldar/journals/158_Distributed%20Compressed%20Sensing.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/67/8767c061aa673e44271eefadc06b6362d8e94f37.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tsp.2014.2340812"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms [chapter]

Bernadette Charron-Bost, Matthias Függer, Thomas Nowak
<span title="">2015</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We prove that in both synchronous and partially synchronous networks, approximate consensus is solvable if and only if the communication graph in each round has a rooted spanning tree.  ...  Finally we apply our results to networked systems with a fixed topology and benign fault models to show that with n processes, up to 2n−3 of link faults per round can be tolerated for approximate consensus  ...  We wish to thank Alex Olshevsky for helpful discussions on consensus sets, Martin Perner for many detailed comments, and Martin Biely for pointing out the full implications of the round translation in  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-47666-6_42">doi:10.1007/978-3-662-47666-6_42</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yk57mtai45agbilc4t4edapeki">fatcat:yk57mtai45agbilc4t4edapeki</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190416075441/https://core.ac.uk/download/pdf/52896891.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ce/e4/cee4f9d9af51955f6fffdb1c67051fad9b981ade.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-47666-6_42"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Experimental Validation of Consensus Algorithms for Multivehicle Cooperative Control

Wei Ren, Haiyang Chao, W. Bourgeous, N. Sorensen, YangQuan Chen
<span title="">2008</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w55uhp5h3rdubpws6c5kic4vxm" style="color: black;">IEEE Transactions on Control Systems Technology</a> </i> &nbsp;
In this brief, consensus algorithms are experimentally implemented and validated on a mobile actuator and sensor network platform under directed, possibly switching interaction topologies to explore issues  ...  Index Terms-Axial alignment, cooperative control, consensus algorithm, mobile actuator and sensor network, multivehicle systems, rendezvous.  ...  Under the condition that , consensus is reached asymptotically with (5) if and only if the directed interaction topology contains a directed spanning tree.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcst.2007.912239">doi:10.1109/tcst.2007.912239</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xlz55jwvkbalvlawlzlj2oxxbe">fatcat:xlz55jwvkbalvlawlzlj2oxxbe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161201012253/http://www.ee.ucr.edu/~ren/papers/reprints/RenCBSC08_TCST.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/de/00/de00f065727a4520d6200be1797cfc7832097806.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcst.2007.912239"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Communication Complexity of Consensus in Anonymous Message Passing Systems [chapter]

Emanuele G. Fusco, Andrzej Pelc
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
For unknown n-node networks we show a consensus algorithm using O(n 2 ) messages; this complexity is optimal for this class.  ...  Indeed, even with labeled nodes, Ω(n 2 ) messages are sometimes necessary if the network is unknown but for known labeled networks consensus can be always achieved with O(n) messages.  ...  Condition (1) implies |B| ≤ √ 2n. Moreover, by condition (2) we have that i∈A |Ŝ i | ≤ i∈A 2|S i | 2 , which, under condition (1), is maximized if |A| = √ 2n and |S i | = n/2, for all i ∈ A.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-25873-2_14">doi:10.1007/978-3-642-25873-2_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iycm4mrwpba7hcbq4pgsuwvoyy">fatcat:iycm4mrwpba7hcbq4pgsuwvoyy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813005319/http://www.diag.uniroma1.it/~fusco/res/CCC_C.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/be/b5/beb5344ae993ca32c62d243795220d3a7b087f80.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-25873-2_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Semi-Autonomous Consensus: Network Measures and Adaptive Trees

Airlie Chapman, Mehran Mesbahi
<span title="">2013</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tiaci7xy45hczhz755zlpu5h7q" style="color: black;">IEEE Transactions on Automatic Control</a> </i> &nbsp;
We instead adopt topological methods for this task, designing five protocols for tree graphs that rewire the network topology, leaving the network agents' dynamics untouched.  ...  Index Terms-Adaptive networks, consensus protocol, coordinated control over networks, graph theory, network security, semiautonomous networks.  ...  ACKNOWLEDGMENT The authors would like to thank the Associate Editor and anonymous reviewers for their constructive comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tac.2012.2205429">doi:10.1109/tac.2012.2205429</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ofnkrcdjqrg4hboqjp52nusyja">fatcat:ofnkrcdjqrg4hboqjp52nusyja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808144524/http://rain.aa.washington.edu/@api/deki/files/18/=Semi_Autonomous_Consensus_Network_Measures_and_Adaptive_Trees.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3d/6e/3d6e8d11498c07caec442cd4dcd1c6a069b8c255.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tac.2012.2205429"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Survey of Graph Mining Techniques for Biological Datasets [chapter]

S. Parthasarathy, S. Tatikonda, D. Ucar
<span title="">2010</span> <i title="Springer US"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/z6l23qz6lbahndyc65abg7sqju" style="color: black;">Managing and Mining Graph Data</a> </i> &nbsp;
We conclude this article with a discussion of the key results and identify some interesting directions for future research.  ...  Examples abound ranging from the analysis of protein interaction networks to the analysis of phylogenetic data.  ...  Among these are the biclustering algorithms which identify a group of genes that behave similarly only for a subset of all conditions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4419-6045-0_18">doi:10.1007/978-1-4419-6045-0_18</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/series/ads/ParthasarathyTU10.html">dblp:series/ads/ParthasarathyTU10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aeu53r3dbzd67d5whkjypv64uq">fatcat:aeu53r3dbzd67d5whkjypv64uq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100716103534/http://www.cse.ohio-state.edu/~tatikond/papers/chapter.biological.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/22/26/2226625f8382b9bef55286275d1d7387d46cf299.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4419-6045-0_18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 19,321 results