Algebraic Characterizations of Consensus Problems for Networked Dynamic Systems
classification
🧮 math.ST
math.OCstat.TH
keywords
consensusdynamicproblemsystemsfunctionsnetworkedsomeunder
read the original abstract
In this paper, we study the consensus problem for networked dynamic systems with arbitrary initial states, and present some structural characterization and direct construction of consensus functions. For the consensus problem under similar transformation, we establish some necessary and sufficient conditions by exploiting the structure of consensus functions. Finally, we discuss the consensus problem for dynamic systems under switching by using the common Lyapunov function method.
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.