Leaderless and Leader-Following Consensus With Communication and Input Delays Under a Directed Network Topology

Abstract

In this paper, time-domain (Lyapunov theorems) and frequency-domain (the Nyquist stability criterion) approaches are used to study leaderless and leader-following consensus algorithms with communication and input delays under a directed network topology. We consider both the first-order and second-order cases and present stability or boundedness conditions. Several interesting phenomena are analyzed and explained. Simulation results are presented to support the theoretical results.