Consensus Seeking Over Random Weighted Directed Graphs

By Maurizio Porfiri, Daniel J. Stilwell. 2007

306 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Molecular Biology

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Molecular Biology

Citations in the corpus

Distributed Control of Robotic Networks (2009, background): “, 2005, 2007), consensus over random networks (Hatano and Mesbahi, 2005; Wu, 2006; Patterson et al., 2007; Picci and Taylor, 2007; Porfiri and Stilwell, 2007; Tahbaz-Salehi and Jadbabaie, 2008; Fagnani and Zampieri, 2009), consensus in finite time (Cortés, 2006; Sundaram and Hadjicostis, 2008), cons”
Distributed Synchronization in Networks of Agent Systems With Nonlinearities and Random Switchings (2013, background): “For instance, in [33], sufficient conditions for asymptotic almost sure consensus are presented for the case of positive weights and for the case of arbitrary weights, where the existence of any edge is probabilistic and independent of the existence of any other edge.”
Consensus of multi-agent systems with intrinsic nonlinear dynamics and sampled-data information (2011, background): “In fact, active research on consensus problems is still ongoing today, such as consensus seeking under stochastic disturbances [9], [10], consensus over random networks [11], [12], consensus with diverse time-delays [13], and high-order consensus [14]–[16].”
Consensus in multi‐agent systems with communication constraints (2012, background): “Recently, considerable effort has been made to study the emergence of consensus behaviors in multi-agent systems, with many profound results established [9–32].”
Convergence speed in distributed consensus over dynamically switching random networks (2009, background): “Similar to Porfiri and Stilwell (2007), we define the error vector ξ(k) as follows, ξ(k) = Q Tx(k).”
Stochastic Consensus Seeking With Noisy and Directed Inter-Agent Communication: Fixed and Randomly Varying Topologies (2010, background): “Third, convergence results are proved with both measurement noise and random independent link failures; for related random graph based modeling, see [14], [20], [24], [25], [31], [34].”
Forced consensus in networks of double integrator systems with delayed input (2010, unknown): “…in the network of dynamic agents significantly facilitates the distributed coordination (Bauso, Giarre, & Pesenti, 2006; Hong, Hu, & Gao, 2006; Olfati-Saber, Fax, & Murray, 2007; Porfiri & Stilwell, 2007; Ren, Beard et al., 2007; Savkin, 2006;Wu&Guan, 2008; Xiao &Wang, 2006; Yang &Wang, 2006).”
Consensus in networked multi-agent systems via sampled control: Fixed topology case (2009, background): “topologies and time-varying delays [8], [9], [10], higherorder consensus [11], [12], [13], asynchronous consensus [14], [15], agreement with random networks [16], [17], finitetime consensus [18], [19] and so on.”
Consensus Over Ergodic Stationary Graph Processes (2010, background): “[ 11 ] J. Ferrer, M. I. Garcia, and F. Puerta, “Differentiable families of sub-”