Decentralised minimum-time consensus

DOI10.1016/j.automatica.2013.02.015zbMath1334.68231OpenAlexW2076828119MaRDI QIDQ490557

Guy-Bart Stan, Mauricio Barahona, Jorge M. Gonçalves, Ling Shi, Ye Yuan

Publication date: 27 August 2015

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2013.02.015

zbMATH Keywords

graph theoryLaplacian matrixdecentralised network consensusminimum finite-time consensussingle node observation

Mathematics Subject Classification ID

Decentralized systems (93A14) Network protocols (68M12) Agent technology and artificial intelligence (68T42)

Related Items (19)

Distributed adaptive Newton methods with global superlinear convergence ⋮ A dynamical approach to efficient eigenvalue estimation in general multiagent networks ⋮ Decentralized minimal‐time planar formation control of multi‐agent system ⋮ Graph diameter, eigenvalues, and minimum-time consensus ⋮ Structural balance of multiplex signed networks: a distributed data-driven approach ⋮ Continuous distributed algorithms for solving linear equations in finite time ⋮ Distributed least squares solver for network linear equations ⋮ Distributed Model Predictive Control of linear discrete-time systems with local and global constraints ⋮ Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems ⋮ Linear Time Average Consensus and Distributed Optimization on Fixed Graphs ⋮ Finite-time general function consensus for multi-agent systems over signed digraphs ⋮ Multi‐consensus recovery of multi‐agent system with cyber‐attack based on topology reconstruction controller ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Step-size sequence design for finite-time average consensus in secure wireless sensor networks ⋮ Distributed event-triggered control for global consensus of multi-agent systems with input saturation ⋮ Guaranteed Cost Consensus for Multi-Agent Systems with Fixed Topologies ⋮ Distributed function calculation over noisy networks ⋮ Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach ⋮ Performance and robustness of discrete and finite time average consensus algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed consensus in noncooperative inventory games
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Fast linear iterations for distributed averaging
• Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications
• Let us teach this generalization of the final-value theorem
• Finite-Time Semistability and Consensus for Nonlinear Dynamical Networks
• Finite-Time Consensus Problems for Networks of Dynamic Agents
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Analysis of Interconnected Oscillators by Dissipativity Theory
• Collective dynamics of ‘small-world’ networks
• Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?

This page was built for publication: Decentralised minimum-time consensus