Distributed Average Tracking for Lipschitz-Type of Nonlinear Dynamical Systems

In this paper, a distributed average tracking (DAT) problem is studied for Lipschitz-type of nonlinear dynamical systems. The objective is to design DAT algorithms for locally interactive agents to track the average of multiple reference signals. Here, in both dynamics of agents and reference signal...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on cybernetics Vol. 49; no. 12; pp. 4140 - 4152
Main Authors: Zhao, Yu, Liu, Yongfang, Wen, Guanghui, Yu, Xinghuo, Chen, Guanrong
Format: Journal Article
Language:English
Published: United States IEEE 01.12.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Adaptive algorithm
Adaptive algorithms
Algorithms
Approximation algorithms
Boundary layers
Computer simulation
continuous algorithm
Design
distributed average tracking (DAT)
Dynamical systems
Eigenvalues
Eigenvalues and eigenfunctions
Heuristic algorithms
Nonlinear dynamical systems
nonlinear dynamics
Nonlinear systems
Reference signals
Robustness
Target tracking
Tracking
Trajectory
ISSN:2168-2267, 2168-2275, 2168-2275
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a distributed average tracking (DAT) problem is studied for Lipschitz-type of nonlinear dynamical systems. The objective is to design DAT algorithms for locally interactive agents to track the average of multiple reference signals. Here, in both dynamics of agents and reference signals, there is a nonlinear term satisfying a Lipschitz-type condition. Three types of DAT algorithms are designed. First, based on state-dependent-gain design principles, a robust DAT algorithm is developed for solving DAT problems without requiring the same initial condition. Second, by using a gain adaption scheme, an adaptive DAT algorithm is designed to remove the requirement that global information, such as the eigenvalue of the Laplacian and the Lipschitz constant, is known to all agents. Third, to reduce chattering and make the algorithms easier to implement, a couple of continuous DAT algorithms based on time-varying or time-invariant boundary layers are designed, respectively, as a continuous approximation of the aforementioned discontinuous DAT algorithms. Finally, some simulation examples are presented to verify the proposed DAT algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2168-2267
2168-2275
2168-2275
DOI:10.1109/TCYB.2018.2859352