Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > A consensus algorithm for networks with process noise and quantization error
Publication

Publications

A consensus algorithm for networks with process noise and quantization error

Title
A consensus algorithm for networks with process noise and quantization error
Type
Article in International Conference Proceedings Book
Year
2015
Authors
Rego, FFC
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Pu, Y
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Alessandretti, A
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Jones, CN
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 488-495
53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Monticello, IL, SEP 29-OCT 02, 2015
Other information
Authenticus ID: P-00K-GS2
Abstract (EN): In this paper we address the problem of quantized consensus where process noise or external inputs corrupt the state of each agent at each iteration. We propose a quantized consensus algorithm with progressive quantization, where the quantization interval changes in length at each iteration by a pre-specified value. We derive conditions on the design parameters of the algorithm to guarantee ultimate boundedness of the deviation from the average of each agent. Moreover, we determine explicitly the bounds of the consensus error under the assumption that the process disturbances are ultimately bounded within known bounds. A numerical example of cooperative path-following of a network of single integrators illustrates the performance of the proposed algorithm.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 8
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Design of a Distributed Quantized Luenberger Filter for Bounded Noise (2016)
Article in International Conference Proceedings Book
Rego, FFC; Pu, Y; Alessandretti, A; Aguiar, AP; Pascoal, AM; Jones, CN
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-12 at 00:16:04 | Privacy Policy | Personal Data Protection Policy | Whistleblowing