Abstract
ABSTRACT Leader–follower consensus control is a kind of consensus control, where some special agents, called the leaders, have relatively high flexibility in changing their states, and the other agents, called the followers, follow the leaders. One of the important issues for leader–follower consensus control is a leader selection problem, i.e. determining leaders to achieve a desired performance. On the other hand, the notion of a feedback vertex set is well-known in graph theory. Feedback vertex sets are known to play an important role in various problems, e.g. deadlock avoidance and sensing node selection of biological networks. Thus, they are expected to be closely related to leader–follower consensus control. However, their relationship has never been studied so far. This paper discloses the relationship between leader selection and feedback vertex sets. We deal with a problem of finding a minimum leader set to achieve the fastest convergence to consensus and show that a solution to the leader selection problem is given by a feedback vertex set.
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.
