**Nikiforov**

Vladimir O.

D.Sc., Prof.

Vladimir O.

D.Sc., Prof.

# STABILITY OF LINEAR MULTIAGENT SCALAR SYSTEMS AND ITS DEPENDENCE ON CONNECTIVITY GRAPH

**Read the full article**';

**Abstract**

Multiagent systems are now finding increasingly wide applications in various engineering fields such as energy, transportation, robotics, aviation and others. There are two main aspects to be focused on when organizing multiagent systems: the dynamics of the agents themselves and the ways of their interaction. This interaction is determined by the structure of information connections between agents. Thus, there are several key points of multiagent systems study: the dynamics of individual agents and shape of the information graph. Formation dynamics, in general, is determined by a set of properties of agents and connectivity graph. The paper deals with the relationship between dynamics of agents and Laplace matrix, which is used to set the graph connections. The present research is based on the results given in the known paper by A. Fax and R. Murray (IEEE Trans. AC, 2004). An illustrative example is given, and the application problem of studying the formation dynamics consisting of the group of quadrocopters is presented. Information exchange between agents is determined in the paper by means of the conventional set of graphs. The paper presents an interpretation of the stability conditions and the method of system performance improvement based on these conditions. Motion of quadrocopters group along the flight height is used as an example for methodology application. The simulation results demonstrate the basic dependencies between the information graph shape (and, consequently, the eigenvalues of the Laplacian, which describes this graph) and formation stability. Simulation and consideration of Nyquist diagram connection with the key points give an indication of the system stability and take steps to change the control laws. Necessary conditions for the formation stability are obtained on the basis of this research method. Research result makes it possible to create local control laws for agents to ensure the stability of motion in the selected structure of information connections. It is shown that the local control law can be adjusted by classical calculation methods ensuring prescribed stability margins in view of the Nyquist curve type and location of the closest points which should not be covered by it.

**Keywords:**multiagent systems, Laplacian, quadrocopter

**References**

*Scientific and Technical Journal of Information Technologies, Mechanics and Optics*,2013, no. 3 (85), pp. 55–61.

*Proceedings of the 18*. Budapest, Hungary, 2013, vol. 20, pp. 58–63.

^{th}WSEAS International Conference on Applied Mathematics (AMATH`13)*System and Control Letters*, 1982, vol. 1, no. 4, pp. 261–263.

*Linear Algebra and Its Applications*, 1985, vol. 121, pp. 9–37.

*IEEE transactions on Circuit and System*, 1987, vol. CAS-34, no. 12, pp. 1602–1604.

*IEE Proceesings: Control Theory and Applications*, 1995, vol. 142, no. 5, pp. 451–458. doi: 10.1049/ip-cta:19951959

*Mechanical Systems and Signal Processing*, 2002, vol. 16, no. 1, pp. 39–59. doi: 10.1006/mssp.2001.1439

*Mathematical Problems in Engineering*, 2005, vol. 2005, no 1, pp. 123–140. doi: 10.1155/MPE.2005.123

*International Journal of Emerging Technology and Advanced Engineering*, 2012, vol. 2, no. 8, pp. 212–217.

*Mechanical Systems and Signal Processing*, 2014, vol. 42, no. 1–2, pp. 129–136. doi: 10.1016/j.ymssp.2013.06.026

*Matematicheskie osnovy sovremennoi teorii upravleniya: apparat metoda prostranstva sostoyanii*[Mathematical foundations of modern control theory: the apparatus of the state space method] Ed. A.V. Ushakov. St. Petersburg, SPbSU ITMO Publ., 2008, 323 p.

*Upravlenie konechnomernymi lineinymi ob”ektami*[Control of finitelinear objects]. Moscow, Nauka Publ., 1976, 424 p.

*Teoriya matrits*[Matrix theory]. Moscow, Nauka Publ., 1973, 575 p.

*Scientific and Technical Journal of Information Technologies, Mechanics and Optics*,2013, no. 4 (86), pp. 25–33.

*Matrix computations*.Baltimore, Johns Hopkins University Press, 1996. 728 p.