The projection method for continuous-time consensus seeking
arXiv:1507.04177 · doi:10.1134/S0005117915080081
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.
10 pages, to appear in Automation and Remote Control, 2015, No.8