AN INTEGRAL CONNECTIVITY CONDITION FOR MULTI-EQUILIBRIA CONSENSUS IN NETWORKS EVOLVING OVER UNDIRECTED GRAPHS | Zendy

Özlem Feyza Erkan | Zendy; Mehmet Akar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

AN INTEGRAL CONNECTIVITY CONDITION FOR MULTI-EQUILIBRIA CONSENSUS IN NETWORKS EVOLVING OVER UNDIRECTED GRAPHS

Author(s) -

Özlem Feyza Erkan,

Mehmet Akar

Publication year - 2017

Publication title -

anadolu university journal of science and technology-a applied sciences and engineering

Language(s) - English

Resource type - Journals

ISSN - 1302-3160

DOI - 10.18038/aubtda.341599

Subject(s) - undirected graph , computer science , constant (computer programming) , directed graph , mathematics , consensus , matrix (chemical analysis) , mathematical optimization , theoretical computer science , multi agent system , graph , algorithm , artificial intelligence , materials science , composite material , programming language

In this paper, we study the multi-equilibrium consensus problem for a time-varying network of n agents where the agents are modeled as integrators. Instead of the joint connectivity condition which is widely used in the literature, we propose an integral K connectivity condition that allows us to examine the network through a constant matrix. Based on this new concept, we present necessary and sufficient conditions on networks modeled with undirected graphs so that multi-equilibrium consensus states are achieved. Theoretical results are verified by numerical simulations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research