Patterns of self-organizing strategies in the game of mobile agents

: pp. 24 - 34
Lviv Polytechnic National University, Information Systems and Networks Department
Lviv Polytechnic National University, Information Systems and Network
Lviv Polytechnic National University, Information Systems and Networks Department

In this research the actual problem of self-organizing of strategies of stochastic game of multiagent systems is considered. Self-organizing display are formations of the co-ordinated behavioural patterns of group of the mobile agents endowed with the ability to move within a limited discrete space.

The agent is an independent object which can interact with environment, other agents and the person for a choice of variants of decisions. The multiagent system consists of group of agents which perform the general work, co-operating among themselves within local subsets of agents. The behavioural pattern of multiagent systems is the visualised form of purposeful moving of agents which arises from their initial chaotic movement during training of stochastic game.

A repetitive stochastic game is to implement a controlled random process of selecting decision options. To do this, game agents randomly, simultaneously and independently choose one of their own pure strategies at discrete times. Pure player strategies determine the direction of movement in twodimensional space: forward, back, to the right, to the left. When all strategies have been selected, the current player losses are calculated. To form an orderly move, each agent must repeat the actions of neighboring agents. The current losers are then determined by the indicator function of the similarity of the strategies of the neighboring players. The calculated current losses are used to adaptively recalculate mixed player strategies. The probability of a pure strategy selection increases, if its realisation has led to reduction of current loss. In the course of a recurring game, agents will form vectors of mixed strategies that will minimize the functions of the players' average losses.

To solve the game problem of constructing patterns of self-organization of a multiagent system it is used the markovian adaptive recurrent method constructed on the basis of stochastic approximation of the modified complementary slackness condition which is correct in balance to Nash points. For a normalization of elements of vectors of the mixed strategies operation of their projecting on a unit expanded epsilon-simplex is applied. Convergence of a game method is provided with observance of fundamental conditions and restrictions of stochastic optimisation.

Computer simulation confirmed the possibility of using a stochastic game model to build patterns of self-organization of a multi-agent system. The form of the received patterns depends on a way of local orientation of mobile agents. During computer experiment vortical and linear patterns moving of agents are received. The reliability of the experimental studies is confirmed by the similarity of the results obtained for different sequences of random variables.

The results of this work are expedient for applying to studying of patterns of collective behaviour of agents for deeper understanding of the processes of self-organizing of natural systems and for the construction of distributed decision-making systems.

Guillot, A., Meyer, J.-A. (2013). Bionics. When the Science Imitates the Nature. Moscow: Technosphere.

Ball, Ph. (1999). The Self-Made Tapestry: Pattern Formation in Nature. Oxford: Oxford University Press.

Shatalkin, A. I. (2012). Taxonomy. The bases, principles and rules. Moscow: KMK Scientific Press Ltd.

Warwick, K. (1999). March of the machines. Why the new race of robots will rule the world. Moscow: Science / Interperiodicals.

Barrat, J. (2015). Our Final Invention: Artificial Intelligence and the End of the Human Era. Alpina Non- Fiction.

Kaku, M. (2017). Physics of the Future. Lviv: Litopys.

Weiss, G. (2013). Multiagent Systems. Second Edition. The MIT Press.

Chen, B.-S. (2019). Stochastic Game Strategies and their Applications. CRC Press.

Kravets, P. A. (2013). Game coordination and self-organizing of strategies in multiagent "predator-prey" models. Bulletin of "Lviv polytechnic". Series: "Computer sciences and information technologies", 751, 136 - 146.

Kravets, P. A. (2015). Game model of self-organizing of multiagent systems. Bulletin of "Lviv polytechnic". Series: "Information systems and networks", 829, 161 - 176.

Kravets, P., Burov, Y., Lytvyn, V., Vysotska, V. (2019). Gaming Method of Ontology Clusterization. Webology, 16 (1), 55 - 76.

Ivanov, D. Y. (2016). System formation in the big group of mobile robots with use of a method of patterns. Robotics and technical cybernetics, 11 (2), 39 - 44.

Kucherov, D. P, Kozub, A. М., Kostyna, O. М. (2017). Movement of the multi agent system in potential field. Weapons and Military Equipment, 14 (2), 55 - 61.

Kuznetsov, A. V. (2018). Model of movement and interaction of system of intellectual agents. Bulletin VSU: Series: System analysis and information technology, 2, 130 - 138.

Konovalenko, O. E., Brusentsev, V. О. (2019). Multiagent control systems and decision-making supports. Bulletin of National technical university "KhPI". Series: Machine science and CAD, 1, 18 - 27.

Tkachov, V. M., Tokarev, V.V., Churyumov, G. I. (2019). Algorithm design of multiagent managements of group mobile "s-bot". Kyiv: Data Recording, Storage & Processing, 21 (1), 46 - 56.

Ungureanu, V. (2018). Pareto-Nash-Stackelberg Game and Control Theory: Intelligent Paradigms and Applications. Springer.

Neogy, S. K., Bapat, R. B., Dubey Dipti. (2018). Mathematical Programming and Game Theory. Springer.

Nazin, A. V., Poznyak, A. S. (1986). Adaptive Choice of Variants: Recurrence Algorithms. Moscow: Science.

Kushner, H., Yin, G. G. (2013). Stochastic Approximation and Recursive Algorithms and Applications. Springer Science & Business Media.