Multiagent system controllability evaluation using the multilevel structure of the graph of agents


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

A new approach is proposed to the calculation of the upper and lower bounds of the multiagent system controllability index formalized as the existence probability of the path from any node to the control center with the message transmission time not larger than the constant t. Controllability is one of the properties of this system that determines the stability of its functioning. A regular graph in the form of a tree with virtual nodes, which makes it possible to apply the methods of calculating the number of vertices in a particular level, is proposed in order to compute controllability boundaries.

作者简介

D. Zegzhda

St. Petersburg Polytechnic University

编辑信件的主要联系方式.
Email: dmitry.zegzhda@ibks.ftk.spbstu.ru
俄罗斯联邦, St. Petersburg

T. Stepanova

St. Petersburg Polytechnic University

Email: dmitry.zegzhda@ibks.ftk.spbstu.ru
俄罗斯联邦, St. Petersburg

A. Suprun

St. Petersburg Polytechnic University

Email: dmitry.zegzhda@ibks.ftk.spbstu.ru
俄罗斯联邦, St. Petersburg

补充文件

附件文件
动作
1. JATS XML

版权所有 © Allerton Press, Inc., 2016