Loading...

A novel consensus protocol using facility location algorithms

Doostmohammadian, M. R ; Sharif University of Technology

604 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/CCA.2009.5281002
  3. Abstract:
  4. This paper introduces a new consensus protocol whose features are different from known consensus protocols available in the literature. The relation between discrete coverage algorithms over a convex polygon for solving a facility location problem (n-median problem) along with some notions in agreement over acyclic digraphs have been used to establish a novel constrained consensus protocol. Its convergence for the special case of acyclic digraphs with switching topology is presented. Extension of the results for other graph topologies and communication links are left for future works. © 2009 IEEE
  5. Keywords:
  6. Acyclic digraph ; Communication links ; Consensus protocols ; Convex polygon ; Facility location problem ; Facility locations ; Graph topology ; Median problem ; Switching topology ; Topology ; Facilities
  7. Source: Proceedings of the IEEE International Conference on Control Applications, 8 July 2009 through 10 July 2009, Saint Petersburg ; 2009 , Pages 914-919 ; 9781424446025 (ISBN)
  8. URL: http://ieeexplore.ieee.org/document/5281002/?reload=true