Convergence analysis of max-consensus algorithm in probabilistic communication networks with Bernoulli dropouts
From MaRDI portal
(Redirected from Publication:5025893)
Recommendations
- Analysis of Max-Consensus Algorithms in Wireless Channels
- Convergence Rates of Distributed Average Consensus With Stochastic Link Failures
- Convergence of max-min consensus algorithms
- Maximum Allowable Loss Probability for Consensus of Multi-Agent Systems Over Random Weighted Lossy Networks
- Consensus Over Random Graph Processes: Network Borel–Cantelli Lemmas for Almost Sure Convergence
- Almost Sure Resilient Consensus Under Stochastic Interaction:Links Failure and Noisy Channels
- Convergence results for the linear consensus problem under Markovian random graphs
- Convergence speed in distributed consensus over dynamically switching random networks
- Stochastic approximation based consensus dynamics over Markovian networks
- Network consensus in the Wasserstein metric space of probability measures
Cites work
- A dynamically weight adjustment in the consensus reaching process for group decision-making with hesitant fuzzy preference relations
- Accurate clock synchronization in wireless sensor networks with bounded noise
- Adaptive consensus control of nonlinear systems with unknown control directions
- Analysis of Max-Consensus Algorithms in Wireless Channels
- Asynchronous Max-Consensus Protocol With Time Delays: Convergence Results and Applications
- Consensus of linear multi-agent systems with exogenous disturbance generated from heterogeneous exosystems
- Constrained consensus of discrete-time multi-agent systems with time delay
- Convergence properties of two networked iterative learning control schemes for discrete-time systems with random packet dropout
- Distributed \(H_\infty\)-consensus filtering for piecewise discrete-time linear systems
- Distributed consensus estimation for diffusion systems with missing measurements over sensor networks
- Distributed finite-time calculation of node eccentricities, graph radius and graph diameter
- Distributed Kalman filtering via node selection in heterogeneous sensor networks
- Dynamic consensus estimation of weighted average on directed graphs
- Fast distributed algebraic connectivity estimation in large scale networks
- Finite-time consensus control for second-order multi-agent systems without velocity measurements
- Group consensus control for heterogeneous multi-agent systems with fixed and switching topologies
- Optimal controlled nodes selection for fast consensus
- Probability. Theory and examples.
- Stability of consensus extended Kalman filter for distributed state estimation
- Stationary average consensus protocol for a class of heterogeneous high-order multi-agent systems with application for aircraft
- Theory of probability. A critical introductory treatment. Translated from the Italian by Antonio Machí and Adrian Smith. With a new preface by Adrian Smith. In 2 volumes
- Time Synchronization in WSNs: A Maximum-Value-Based Consensus Approach
Cited in
(4)- A distributed methodology for approximate uniform global minimum sharing
- Maximum Allowable Loss Probability for Consensus of Multi-Agent Systems Over Random Weighted Lossy Networks
- Max-consensus of multi-agent systems in random networks
- Min-max group consensus of discrete-time multi-agent systems under directed random networks
This page was built for publication: Convergence analysis of max-consensus algorithm in probabilistic communication networks with Bernoulli dropouts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5025893)
