A METHOD FOR CHOOSING A STRATEGY FOR THE BEHAVIOR OF A CELLULAR AUTOMATON WHEN SOLVING THE PROBLEM OF FINDING TARGETS BY A GROUP OF MOVING OBJECTS
Article Sidebar
Main Article Content
Abstract
Currently, a large number of different mathematical models and methods aimed at solving problems of multidimensional optimization and modeling of complex behavioral systems have been developed. One of the areas of search for solutions is the search for solutions in conditions of incomplete information and the need to take into account changing external factors. Often such problems are solved by the method of complete search. In some conditions, the method of complete search can be significantly improved through the implementation and use of behavioral models of natural formations. Examples of such formations can be group behavior of insects, birds, fish, various flocks, etc. The idea of copying group activity of a shoal of fishes at the decision of problems of joint activity on extraction of food is used in work. The reasoning based on the simulation of the behavior of such a natural object allowed to justify the choice as a mathematical model - cellular automata. The paper examines the key features of such a model. Modeling of his work is carried out, strategies of behavior of group of mobile objects at search of the purposes are developed, key characteristics are investigated and the method of adaptive choice of strategy and change of rules of behavior taking into account features of the solved problem is developed. The search strategy is implemented in the work, which takes into account the need to solve the optimization problem on two parameters. The obtained results testify to the high descriptive possibility of such an approach, the possibility of finding the optimal strategy for the behavior of the cellular automaton and the formalization of the process of selecting the parameters of its operation. A further improvement of this approach can be the implementation of simulation to study the properties of the developed model, the formation of the optimal set of rules and parameters of the machine for the whole set of tasks.
Article Details
References
Pozhidaev, M.S. (2010), Algorithms for solving the problem of transport routing [Algoritmy resheniya zadachi transportnoy marshrutizatsii], dissertation, Tomsk: Tomsk State University, 2010, 136 p., available at :
https://marigostra.ru/materials/thesis.pdf.
Slastnikov, S.A. (2014). “Application of metaheuristic algorithms for the transport routing problem [Primeneniye metaevristicheskikh algoritmov dlya zadachi transportnoy marshrutizatsii]”, Economics and Mathematical Methods, Vol. 1, pp. 117–126.
Matsyuk, N.O. (2013), “Features of solving the problem of a salesman for wholesalers [Osoblyvosti rozvʺyazannya zadachi komivoyazhera dlya pidpryyemstv hurtovoyi torhivli]”, Bulletin of the KhNU, Vol. 5, pp. 95–100.
Bjarnadottir, A.S. (2004), Solving the Vehicle Routing Problem with Genetic / Aslaug Soley Bjarnadottir, Technical University of Denmark, 127 p.
Li, Yang, (2019), A review of cellular automata models for crowd evacuation. Physica A: Statistical Mechanics and its Applications, 526 p.
Aladiev, V.Z. (2009), Classic homogeneous structures. Cellular automata [Klassicheskiye odnorodnyye struktury. Kletochnyye avtomaty], Publishing house Fultus Books, 535 p.
Bandman, O.L. (2005), “Cellular-automatic models of spatial dynamics [Kletochno-avtomatnyye modeli prostranstvennoy dinamiki]”, System informatics, Vol. 10, pp. 57–113.
Toffoli, T. and Margolus, N. (1991), Cellular automata machines, 280 p..
Makarenko, O.S. (2010), „Modeling the movement of pedestrians on the basis of cellular automata [Modelyuvannya rukhu pishokhodiv na osnovi klitynnykh avtomativ]”, System research and information technologies, Vol. 1, pp. 100–109.
Babaei, Abdorreza, Homayun, Motameni, and Rasul, Enayatifa (2020), “A new permutation-diffusion-based image encryption technique using cellular automata and DNA sequence”, Optik, 203: 164000.
Pavlenko, M.A. (2014), “Method of solving the problem of laying routes when controlling the movement of an air object [Metod reshenyya zadachy prokladky marshrutov pry upravlenyy dvyzhenyem vozdushnoho obʺekta]”, Information processing systems, Vol. 5, pp. 87–90.
Matsyuk, N.O. (2016), “Solving the routing problem using a modified ant-cell-automatic algorithm [Rozvʺyazannya zadachi marshrutyzatsiyi z vykorystannyam modyfikovanoho murashyno-klitynno-avtomatnoho alhorytmu]”, Visnyk ekonomichnoi nauki Ukrainy, Vol. 1, pp. 49–54.
Zhykharevych, V.V. (2016), “Cellular-automatic approach to solving the problem of routing wholesale trade enterprises taking into account the transport infrastructure of the region [Klitynno-avtomatnyy pidkhid do rozvʺyazannya zadachi marshrutyzatsiyi optovykh torhovelʹnykh pidpry-yemstv iz urakhuvannyam transportnoyi infrastruktury rehionu]”, Visnyk ekonomichnoi nauki Ukrainy, Vol. 2, pp. 69–73.
Khmelevskiy, S., Pavlenko, and Petrov, O. (2020), “Information analysis method about current situations in ACS of special operations”, Advanced Information Systems, Vol. 4, No. 1, pp. 103-106, DOI: https://doi.org/10.20998/2522-9052.2020.1.15
Burova, E.M. (2020), “Heuristic algorithm for finding shoals of fish [Evristicheskiy algoritm poiska kosyakov ryb]”, Electronic Scientific Journal, Vol. 1, pp.18–21.
Pavlenko, M.A. (2021), “Method of studying the behavior of groups of mobile objects using cellular automatic machines [Metod vyvchennya povedinky hrup mobilʹnykh obʺyektiv za dopomohoyu klitynnykh avtomativ]”, Armament systems and military equipment, Vol. 3, pp. 92-98.