Sciweavers

7 search results - page 1 / 2
» Almost sure convergence to consensus in Markovian random gra...
Sort
View
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
13 years 11 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 4 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 5 months ago
Network-based consensus averaging with general noisy channels
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
Ram Rajagopal, Martin J. Wainwright
ICASSP
2008
IEEE
13 years 11 months ago
Distributed average consensus in sensor networks with quantized inter-sensor communication
— The paper studies distributed average consensus in sensor networks, when the sensors exchange quantized data at each time step. We show that randomizing the exchanged sensor da...
Soummya Kar, José M. F. Moura
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 5 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli