Published June 2014
| Version public
Book Section - Chapter
A Fast Linear Consensus Protocol on an Asymmetric Directed Graph
Abstract
In this paper, we generalize a fast linear consensus protocol design (Fastest Distributed Linear Averaging) from symmetric undirected graphs to asymmetric directed graphs. This design problem can be cast as a non-convex optimization. We propose a procedure to approximately solve this optimization problem using a sequence of semidefinite programs. Our procedure is guaranteed to generate a consensus protocol for a strongly connected graph that shows a faster convergence compared to the protocols from existing algorithms in our simulation.
Additional Information
© 2014 AACC. The author gratefully acknowledges the helpful feedback from Prof. Richard M. Murray, Ivan Papusha, and Nikolai Matni. This work was in part supported by the Kwanjeong Graduate Fellowship, NSF, AFOSR, ARPA-E, and the Institute for Collaborative Biotechnologies through grant W911NF-09-0001 from the U.S. Army Research Office. The content does not necessarily reflect the position or the policy of the Government, and no official endorsement should be inferred.Additional details
Identifiers
- Eprint ID
- 55943
- DOI
- 10.1109/ACC.2014.6858691
- Resolver ID
- CaltechAUTHORS:20150320-093333365
Related works
- Describes
- 10.1109/ACC.2014.6858691 (DOI)
Funding
- Kwanjeong Graduate Fellowship
- NSF
- Air Force Office of Scientific Research (AFOSR)
- ARPA-E
- Army Research Office (ARO)
- W911NF-09-0001
Dates
- Created
-
2015-03-20Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field