Randomized optimal consensus of multi-agent systems
From MaRDI portal
Publication:1932692
DOI10.1016/j.automatica.2012.08.018zbMath1256.93012arXiv1108.3223OpenAlexW2145374086WikidataQ60432252 ScholiaQ60432252MaRDI QIDQ1932692
Karl Henrik Johansson, Guo-Dong Shi
Publication date: 21 January 2013
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.3223
Related Items
Distributed continuous-time approximate projection protocols for shortest distance optimization problems ⋮ High‐precision formation control of nonlinear multi‐agent systems with switching topologies: A learning approach ⋮ Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems ⋮ Opinion evolution analysis for short-range and long-range Deffuant-Weisbuch models ⋮ Strong consistency of random gradient‐free algorithms for distributed optimization ⋮ Multi-cluster distributed optimization via random sleep strategy ⋮ Time rescaling of a primal-dual dynamical system with asymptotically vanishing damping ⋮ Aggregation in intersection region for distributed heterogeneous mobile sensor networks ⋮ Convergence of random sleep algorithms for optimal consensus ⋮ The robust consensus of a noisy Deffuant-Weisbuch model ⋮ Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme ⋮ Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping ⋮ Opinion dynamics in networks with common-neighbors-based connections ⋮ Gossip consensus algorithm based on time-varying influence factors and weakly connected graph for opinion evolution in social networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spread of (mis)information in social networks
- Tracking control for multi-agent consensus with an active leader and variable topology
- Global target aggregation and state agreement of nonlinear multi-agent systems with switching topologies
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Incremental Stochastic Subgradient Algorithms for Convex Optimization
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- A Necessary and Sufficient Condition for Consensus Over Random Networks
- Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
- Distributed Subgradient Methods for Multi-Agent Optimization
- On Distributed Averaging Algorithms and Quantization Effects
- Constrained Consensus and Optimization in Multi-Agent Networks
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Information Flow and Cooperative Control of Vehicle Formations
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Stability of multiagent systems with time-dependent communication links
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Agreement over random networks
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Flocking in Fixed and Switching Networks
- Connectivity and Set Tracking of Multi-Agent Systems Guided by Multiple Moving Leaders
- State Agreement for Continuous‐Time Coupled Nonlinear Systems
- The method of projections for finding the common point of convex sets
- State Constraints in Convex Control Problems of Bolza
- Theory of Reproducing Kernels