The projection method for continuous-time consensus seeking
classification
💻 cs.SY
cs.MAcs.SYmath.OC
keywords
consensuscontinuous-timemethodprojectionachievedalgorithmbasicbeen
read the original abstract
For the case where the dependency digraph has no spanning in-tree, we characterize the region of convergence of the basic continuous-time distributed consensus algorithm and show that consensus can be achieved by employing the method of orthogonal projection, which has been proposed for the discrete-time coordination problem.
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.