Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Distributed Average Tracking Problem Under Directed Networks

Loading...
Thumbnail Image

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

This article considers the distributed average tracking (DAT) problem that a group of agents aims to track the average of local reference signals. The communication network is strongly connected but not required to be weight balanced. A framework of distributed estimator-based algorithm design without any initialization requirement is presented. For agents with nominal first-order (FO) dynamics, a class of distributed estimators is proposed to estimate the average of local reference signals within fixed time, with which each agent finally achieves the DAT within fixed time. For agents with second-order dynamics subject to modeling uncertainty, unmodeled dynamics, as well as external disturbances, a class of distributed estimator is proposed to estimate the average of local reference signals within fixed time, and then a local disturbance-observer-based control protocol is proposed for each agent to achieve DAT asymptotically. Different from most of the existing DAT results under general directed networks that DAT error can only be made globally ultimately bounded, the exact DAT can be achieved within fixed time or asymptotically here. Further, the idea of distributed estimator is applied to solve a class of distributed optimization problems within finite time. Finally, two simulation examples are given to show the effectiveness of the theoretical results.

Description

Citation

Source

IEEE Transactions on Control of Network Systems

Book Title

Entity type

Access Statement

License Rights

Restricted until