A design method of distributed algorithms via discrete-time blended dynamics theorem
From MaRDI portal
Publication:6537325
DOI10.1016/j.automatica.2023.111371zbMATH Open1539.9311MaRDI QIDQ6537325
Jeongwoo Kim, Jin Gyu Lee, Donggil Lee, Hyungbo Shim
Publication date: 14 May 2024
Published in: Automatica (Search for Journal in Brave)
Discrete-time control/observation systems (93C55) Stochastic matrices (15B51) Distributed algorithms (68W15) Multi-agent systems (93A16)
Cites Work
- Unnamed Item
- Unnamed Item
- On contraction analysis for non-linear systems
- Initialization-free privacy-guaranteed distributed algorithm for economic dispatch problem
- Blended dynamics approach to distributed optimization: sum convexity and convergence rate
- A tool for analysis and synthesis of heterogeneous multi-agent systems under rank-deficient coupling
- Robustness of Synchronization of Heterogeneous Agents by Strong Coupling and a Large Number of Agents
- Distributed Randomized PageRank Algorithm Based on Stochastic Approximation
- Distributed Cardinality Estimation in Anonymous Networks
- Synchronization and Dynamic Consensus of Heterogeneous Networked Systems
- Consensus and Cooperation in Networked Multi-Agent Systems
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Randomized Algorithms for the PageRank Computation
- Design of Heterogeneous Multi-agent System for Distributed Computation
- Fully Distributed Resilient State Estimation Based on Distributed Median Solver
- Convergence Properties for Discrete-Time Nonlinear Systems
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Completely Decentralized Design of Distributed Observer for Linear Systems
This page was built for publication: A design method of distributed algorithms via discrete-time blended dynamics theorem
