Cart (Loading....) | Create Account
Close category search window
 

On the cost of deciding consensus

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

2 Author(s)
Blondel, V. ; Div. of Appl. Math., Univ. Catholique de Louvain, Louvain, Belgium ; Olshevsky, A.

We study the computational complexity of a general consensus problem for switched systems. A set of n × n stochastic matrices {P1, ..., Pk} is a consensus set if for every switching map τ : N → {1, ..., k} and for every initial state x(0), the sequence of states defined by x(t + 1) = Pτ(t)x(t) converges to a state whose entries are all identical. We show in this paper that, unless P = NP, the problem of determining if a set of matrices is a consensus set cannot be decided in polynomial-time. As a consequence, unless P = NP, it is not possible to give efficiently checkable necessary and sufficient conditions for consensus. This provides a possible explanation for the absence of such conditions in the current literature on consensus. On the positive side, we provide a simple algorithm which checks whether {P1, ..., Pk} is a consensus set in a number of operations which scales as a doubly exponential in n.

Published in:

Decision and Control (CDC), 2012 IEEE 51st Annual Conference on

Date of Conference:

10-13 Dec. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.