Pages that link to "Item:Q694804"
From MaRDI portal
The following pages link to Average consensus on general strongly connected digraphs (Q694804):
Displaying 34 items.
- A distributed algorithm for average consensus on strongly connected weighted digraphs (Q462392) (← links)
- A generalization of the graph Laplacian with application to a distributed consensus algorithm (Q747494) (← links)
- Node and network resistance to bribery in multi-agent systems (Q826846) (← links)
- Average consensus on strongly connected weighted digraphs: a generalized error bound (Q895246) (← links)
- Average-consensus tracking of multi-agent systems with additional interconnecting agents (Q1622265) (← links)
- Perturbing consensus for complexity: a finite-time discrete biased min-consensus under time-delay and asynchronism (Q1679889) (← links)
- Multi-stage discrete time and randomized dynamic average consensus (Q1716634) (← links)
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs (Q1737711) (← links)
- Multi-agent control: a graph-theoretic perspective (Q2070030) (← links)
- Resilient average consensus on general directed graphs in presence of cyber-attacks (Q2095296) (← links)
- Surplus-based accelerated algorithms for distributed optimization over directed networks (Q2097723) (← links)
- Gradient-free distributed optimization with exact convergence (Q2165968) (← links)
- Distributed least squares solver for network linear equations (Q2173971) (← links)
- An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network (Q2278902) (← links)
- Gossip consensus algorithm based on time-varying influence factors and weakly connected graph for opinion evolution in social networks (Q2319290) (← links)
- Local average consensus in distributed measurement of spatial-temporal varying parameters: 1D case (Q2342763) (← links)
- Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach (Q2663958) (← links)
- Joining consensus of networked multi-agent systems with nonlinear couplings and weighting constraints (Q2798445) (← links)
- Transcale average consensus of directed multi-vehicle networks with fixed and switching topologies (Q3132963) (← links)
- Distributed Average Consensus in Digraphs (Q4560623) (← links)
- Stationary average-tracking problem of unmatched constant reference signals based on delayed-state feedback (Q5029123) (← links)
- Finite-time median-related group consensus over directed networks (Q5113311) (← links)
- Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate (Q5122265) (← links)
- Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs (Q5133421) (← links)
- General resilient consensus algorithms (Q5863726) (← links)
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions (Q6069332) (← links)
- Distributed optimization without boundedness of gradients for second-order multi-agent systems over unbalanced network (Q6086279) (← links)
- Distributed convex optimization as a tool for solving \(f\)-consensus problems (Q6109979) (← links)
- Event‐triggered control for discrete‐time multi‐agent average consensus (Q6177341) (← links)
- Distributed web hacking by adaptive consensus-based reinforcement learning (Q6193085) (← links)
- Regulation cooperative control for heterogeneous uncertain chaotic systems with time delay: a synchronization errors estimation framework (Q6200694) (← links)
- Consensus and multi-consensus for discrete-time LTI systems (Q6574461) (← links)
- Resilient distributed averaging: adversary detection and topological insights (Q6590418) (← links)
- Distributed algorithm for a finite time horizon resource allocation over a directed network (Q6598888) (← links)
