scholarly journals Control of Networked Multiagent Systems With Uncertain Graph Topologies

Author(s):  
Tansel Yucelen ◽  
J. Daniel Peterson ◽  
Kevin L. Moore

Multiagent systems consist of agents that locally exchange information through a physical network subject to a graph topology. Current control methods for networked multiagent systems assume the knowledge of graph topologies in order to design distributed control laws for achieving desired global system behaviors. However, this assumption may not be valid for situations where graph topologies are subject to uncertainties either due to changes in the physical network or the presence of modeling errors especially for multiagent systems involving a large number of interacting agents. Motivating from this standpoint, this paper studies distributed control of networked multiagent systems with uncertain graph topologies. The proposed framework involves a controller architecture that has an ability to adapt its feedback gains in response to system variations. Specifically, we analytically show that the proposed controller drives the trajectories of a networked multiagent system subject to a graph topology with time-varying uncertainties to a close neighborhood of the trajectories of a given reference model having a desired graph topology. As a special case, we also show that a networked multiagent system subject to a graph topology with constant uncertainties asymptotically converges to the trajectories of a given reference model. Although the main result of this paper is presented in the context of average consensus problem, the proposed framework can be used for many other problems related to networked multiagent systems with uncertain graph topologies.

Author(s):  
Gerardo De La Torre ◽  
Tansel Yucelen

In this paper, we present adaptive architectures for networked multiagent systems operating over directed networks to achieve resilient coordination in the presence of disturbances. Specifically, we consider a class of unforeseen adverse conditions consisting of persistent exogenous disturbances and present a state emulator-based distributed adaptive control architecture to retrieve the nominal networked multiagent system behavior. The stability properties of the proposed architecture are analyzed using results from Lyapunov stability and matrix mathematics. Illustrative numerical examples are provided to demonstrate the theoretical findings.


2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Jinfeng Gao ◽  
Bin Bu ◽  
Lihui Feng ◽  
Minming Gu

This paper studies the consensus convergence speed of multiagent systems (MASs) from two aspects including communication topology and the state of agents. Two-hop network is considered in the communication topology. A novel consensus protocol that includes the information of the states motions and their integrals is introduced. And the protocol has much faster convergence speed by choosing some appropriate weight values. The protocol can be applied to distributed control and large-scale systems. A numerical example is presented to illustrate the effectiveness and superiority of the proposed method.


Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Ning Cai ◽  
Chen Diao ◽  
M. Junaid Khan

This paper presents a novel approach for clustering, which is based on quasi-consensus of dynamical linear high-order multiagent systems. The graph topology is associated with a selected multiagent system, with each agent corresponding to one vertex. In order to reveal the cluster structure, the agents belonging to a similar cluster are expected to aggregate together. To establish the theoretical foundation, a necessary and sufficient condition is given to check the achievement of group consensus. Two numerical instances are furnished to illustrate the results of our approach.


2019 ◽  
Vol 49 (4) ◽  
pp. 1138-1147 ◽  
Author(s):  
Yujuan Wang ◽  
Yongduan Song ◽  
David J. Hill ◽  
Miroslav Krstic

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Wei Qian ◽  
Lei Wang

This paper addresses the global consensus of nonlinear multiagent systems with asymmetrically coupled identical agents. By employing a Lyapunov function and graph theory, a sufficient condition is presented for the global exponential consensus of the multiagent system. The analytical result shows that, for a weakly connected communication graph, the algebraic connectivity of a redefined symmetric matrix associated with the directed graph is used to evaluate the global consensus of the multiagent system with nonlinear dynamics under the common linear consensus protocol. The presented condition is quite simple and easily verified, which can be effectively used to design consensus protocols of various weighted and directed communications. A numerical simulation is also given to show the effectiveness of the analytical result.


Author(s):  
Alexander A. Musaev ◽  
◽  
Andrey V. Gaikov ◽  

The problem of the of a non-stationary system state predicting is considered. The decision based on the joint processing of the results obtained by a group of independent statistical extrapolators. In the terminology of multiagent systems, each extrapolator is an intelligent agent. The quality of the agent solutions is evaluated on retrospective data and is used as weight characteristic in the problem of a terminal solution estimation. The specificity of non-stationary processes with a chaotic system component leads to the empiricca version of the forecast generation algorithm


Sign in / Sign up

Export Citation Format

Share Document