On Constructing Lyapunov Functions For Multi-Agent Systems

Keywords

Graph dependent Lyapunov equation; Lyapunov function; Multi-agent system; Nonnegative graph

Abstract

Lyapunov equations that depend on communication graph topologies provide building blocks of Lyapunov functions, which play an important role in controller design and stability analysis of multi-agent systems. However, construction of such a Lyapunov equation in some published works has a flaw or requires unnecessarily strong graph conditions. This paper presents several choices of Lyapunov equations over various graph topologies.

Publication Date

8-1-2015

Publication Title

Automatica

Volume

58

Number of Pages

39-42

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.automatica.2015.05.006

Socpus ID

84931321772 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84931321772

This document is currently not available here.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 241
  • Usage
    • Abstract Views: 1
  • Captures
    • Readers: 98
see details

Share

COinS