On Consensus under Polynomial Protocols
Joel George Manathara, Ambedkar Dukkipati, Debasish Ghose
TL;DR
This paper investigates the use of computational algebraic methods to analyze polynomial consensus protocols, establishing necessary conditions for their convergence.
Contribution
It introduces algebraic techniques to analyze polynomial consensus protocols and identifies key conditions for their convergence.
Findings
Necessary conditions for convergence of polynomial protocols
Application of algebraic methods to consensus analysis
Foundational framework for future protocol design
Abstract
In this paper we explore the possibility of using computational algebraic methods to analyze a class of consensus protocols. We state some necessary conditions for convergence under consensus protocols that are polynomials.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Modular Robots and Swarm Intelligence · Energy Efficient Wireless Sensor Networks