Abstract
In the coordination problems for multi-agent systems, a well-known condition of achieving consensus is the presence of a spanning arborescence in the communication digraph. The paper deals with the discrete consensus problem in the case where this condition is not satisfied. Let P be a row stochastic influence matrix, whereas TP is the subspace of initial opinions that ensure consensus in DeGroot's iterative pooling model. We propose a method of coordination that consists of: (1) transformation of the vector of initial opinions into the closest vector in TP and (2) subsequent DeGroot process with the matrix P.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
