Near-optimal knowledge-free resilient leader election

DOI10.1016/J.AUTOMATICA.2022.110583OpenAlexW4295267936MaRDI QIDQ2097737

Giorgio Audrito, Yuanqiu Mo, Jacob Beal, Soura Dasgupta

Publication date: 14 November 2022

Published in: Automatica (Search for Journal in Brave)

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

zbMATH Keywords

nonlinear feedback controlleader electionresiliencemultiagent systemaggregate computing

Mathematics Subject Classification ID

Feedback control (93B52) Nonlinear systems in control theory (93C10) Multi-agent systems (93A16)

Uses Software

• Protelis

Cites Work

• Self-stabilizing leader election in polynomial steps
• An \(O(n)\)-time self-stabilizing leader election algorithm
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\)
• Adaptive range-measurement-based target pursuit
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• Rigid Motions of 3-D Undirected Formations With Mismatch Between Desired Distances
• Consensus and Cooperation in Networked Multi-Agent Systems
• A Higher-Order Calculus of Computational Fields
• Agreeing Asynchronously
• Introducing speculation in self-stabilization
• Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds
• Time optimal self-stabilizing synchronization
• Control of Minimally Persistent Leader-Remote-Follower and Coleader Formations in the Plane
• On the Complexity of Universal Leader Election

This page was built for publication: Near-optimal knowledge-free resilient leader election