Movement consensus of delayed multi‐agent systems with directed weighted networks

Abstract

Purpose

The purpose of this paper is to study the moving consensus of multi‐agent dynamical systems with time delays and directed weighted networks.

Design/methodology/approach

The approach used in the study, the topologies of multi‐agent dynamical systems with directed weighted networks is graph theories. The frequency domain is applied to research the movement characteristics of multi‐agent systems with time delays. The generalized Nyquist criterion and curvature theorem are utilized to analyze the consensus algorithm with heterogeneous input delays and heterogeneous communication delays.

Findings

It was discovered that the consensus for the delayed multi‐agent systems with asymmetric coupling weights can be achieved with the hypothesis of directed weighted network composed of n agents with a globally reachable node. The convergence condition is a decentralized consensus condition which uses only local information of each agent.

Originality/value

The novelty associated with this work is to present a new approach to study the consensus of delayed multi‐agent dynamical systems with directed weighted networks. The consensus condition obtained in the paper is less conservative than the consensus condition given in references.

Citation

Yang, H., Zong, G. and Zhang, S. (2011), "Movement consensus of delayed multi‐agent systems with directed weighted networks", International Journal of Intelligent Computing and Cybernetics, Vol. 4 No. 2, pp. 265-277. https://doi.org/10.1108/17563781111136739