By Topic

On the controlled consensus protocols with directed graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xianren Kong ; Res. Center of Satellite Technol., Harbin Inst. of Technol., Harbin, China ; Anhui Zhang ; Shijie Zhang ; Feng Wang

The paper studies the controllability problem for consensus protocols with leader-following structure and directed information topologies. Some algebraic criteria for controllability are presented based on the eigenvalues of the underlying system information topology Laplacian. In addition, the reflections of the system information topology on system controllability are investigated from graph theory.

Published in:

Control and Decision Conference (CCDC), 2012 24th Chinese

Date of Conference:

23-25 May 2012