Tropical Algebraic approach to Consensus over Networks
classification
🧮 math.OC
cs.DMcs.SY
keywords
convergencemax-consensusnetworksprotocoltropicalalgebraalgebraicapproach
read the original abstract
In this paper we study the convergence of the max-consensus protocol. Tropical algebra is used to formulate the problem. Necessary and sufficient conditions for convergence of the max-consensus protocol over fixed as well as switching topology networks are given.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.