Feedforward estimators for the distributed average tracking of bandlimited signals in discrete time with switching graph topology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

We consider the distributed average tracking problem where a group of agents estimates the global average of bandlimited signals using only local communication. An estimator is designed to solve this problem with minimal error. Previous discrete-time designs are limited to tracking signals which either are constant, are slowly varying, have a known model (or frequency), or consist of a single unknown frequency which can be estimated. In contrast, we propose a feedforward design which is capable of tracking the average of arbitrary bandlimited signals. The communication graph is assumed to be connected and symmetric with non-zero weighted Laplacian eigenvalues in a known interval, although simulations show that the performance degrades gracefully as these assumptions are violated. Our design also provides the estimate of the average without delay and is robust to changes in graph topology.

Original languageEnglish (US)
Title of host publication2016 IEEE 55th Conference on Decision and Control, CDC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4284-4289
Number of pages6
ISBN (Electronic)9781509018376
DOIs
StatePublished - Dec 27 2016
Event55th IEEE Conference on Decision and Control, CDC 2016 - Las Vegas, United States
Duration: Dec 12 2016Dec 14 2016

Publication series

Name2016 IEEE 55th Conference on Decision and Control, CDC 2016

Other

Other55th IEEE Conference on Decision and Control, CDC 2016
Country/TerritoryUnited States
CityLas Vegas
Period12/12/1612/14/16

ASJC Scopus subject areas

  • Artificial Intelligence
  • Decision Sciences (miscellaneous)
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Feedforward estimators for the distributed average tracking of bandlimited signals in discrete time with switching graph topology'. Together they form a unique fingerprint.

Cite this