Skip to content
Microsystems, Electronics and Acoustics
ISSN 2523-4447 · e‑ISSN 2523-4455 Open Access · CC BY-SA 4.0
Vol. 22 · Issue 6 · 2017 Dec 29, 2017 Telecommunications and information security

Application of the genetic algorithm for agent-based modeling of the object behavior while leaving the flaming room

YD
Yaroslaw Yuriiovychych Dorogyy Corresponding National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute” Ukraine
VT
Vasyl V Tsurkan National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute” Ukraine
AD
Anton S Dembitskyi National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute” Ukraine
Pages71-78 PublishedDec 29, 2017
VOL 22 · ISS 6 · 2017 View issue

Abstract

The article deals with the implementation of the genetic algorithm for training and optimization of the neural network and its application to the tasks related to agent-based modelling of human behaviour. After the analysis of existing agent-based modelling programs, several drawbacks were noticed. The main problem of other systems for crowd modelling was the missing of information about the psychoemotional state of people, who are in crowd. According to the other sources, moods in crowd influence its behaviour the most; therefore, we decided to propose another method of creating more realistic crowd behaviour. The system that implements training of agents by selecting the most effective strategies of behaviour from the existing set of strategies using the genetic algorithm was proposed. In addition, this article highlights the detailed development of one agent behaviour module based on the neural network, which help the agent to navigate in the environment on condition of being trained enough. Due to created training method, it was mentioned, that training environment affects whole training process, and so several surveys were made at different environment configurations. As a base for the system, single-layer perceptron was chosen because of its simplicity and small number of connections. Final variant of agent casts seven rays into different vectors from his centre. If any other object interferes those rays, the distance to him comes as input to the neural network. Another two inputs take amount of distance to the exit and angle between agent and exit. Right rotate and left rotate forces of agent are used as outputs for neural network. Genetic algorithm was used for selecting the proper weights between the neurons. The most important indicator that some genome should be chosen for future generations is the fitness of that genome. The main purpose for the agent is finding the exit and in case of hitting the flame, it will fail. That is why agent will be rewarded for reaching the exit and get penalty for hitting the flame or staying in the room for too long. During the first launch, 30 initial genomes get involved with the values of weights generated at random. Each of them passes five iterations of training, after which the total gene is written to the database. By the results of current generation training, the five most adapted genomes that will create next generation will be selected. The following genomes remain in the population and form their modified copies by mitosis. Both genomes are divided on a specific point and exchange parts of the genetic code. That process forms two other genomes, which inherit parts of the parents. As for the training environment, there are four different exits from the room but only one of them opens randomly during the iteration. The implemented software system is used to research and train the agent model bypass the obstacles and get to the endpoint. The work of the neural system with a different structure was considered: one runs with the characteristics given above, in the other system configuration, the exit was only one and stayed in constant place, the agent had only four rays, and for staying in the room for more than five seconds he was rewarded. The development of the environment for such training is described and the results of training are presented for various environmental configurations. The main goal and mission of such approach implementation is using trained agents to develop a system for crowd behaviour modelling in the building, which was set on fire. Ref. 11, fig. 6, tabl. 4.

Keywords

References

  1. J. Tu and R. Honsales, Printsipyi raspoznavaniya obrazov [Principles of recognition of patterns]. Moskow: Mir, 1978.
  2. I. S. Svetunkov and S. H. Svetunkov, Metodyi sotsialno-ekonomicheskogo prognozirovaniya: Uchebnik dlya vuzov., t. I [Methods of socio-economic prognostication : Textbook for institutions of higher learning., vol. I]. St. Peterburg: StPbGUEF, 2009.
  3. S. A. Aivazian, V. M. Bukhshtaber, I. S. Eniukov, and L. D. Meshalkin, Prikladnaya statistika: Klassifikatsii i snizhenie razmernosti [Applied statistics: Classifications and decline of dimension]. Moskow: Finansy i statistika, 1989.
  4. P. Dynamics, “Airports,” INCONTROL Simulation Solutions. [Online]. Available: http://www.pedestrian-dynamics.com/crowd-management/airport-crowd-simulation.html .
  5. M. Gardner, “The fantastic combinations of John Conway’s new solitaire game ‘life,’” Sci. Am., vol. 223, no. 4, pp. 120–123, 1970.
  6. Y. Lahodiuk, “Evolyutsiya agentov upravlyaemyih neyronnoy setyu [Evolution of agents guided by a neural network],” Habrahabr, 2013. [Online]. Available: https://habrahabr.ru/post/168067/ .
  7. foo52ru, Iskusstvennaya zhizn. Geneticheskiy algoritm v2.0. Pervyie probyi [Artificial life. Genetic algorithm of v2.0. First tests]. 2016. Available: https://www.youtube.com/watch?v=nlDsMYIbqMM
  8. “EXODUS Demo software,” FIRE SAFETY ENGINEERING GROUP. [Online]. Available: http://fseg.gre.ac.uk/exodus/exodus_registered_visitors.html .
  9. Ya. Yu. Dorohyi, O. O. Doroha-Ivaniuk, and D. A. Ferens, “Realizatsiia alhorytmu strukturnoii optimizatsii neironnoi merezhi [Implementation of neural network structural optimization algorithm],” Visnyk NTUU KPI Informatics, Oper. Comput. Sci., no. 63, pp. 101–106, 2015.
  10. R. L. Haupt and S. E. Haupt, Practical Genetic Algorithms, 2nd ed. Wiley-Interscience, 2004. ISBN: 978-0471455653
  11. M. Obitko, “XI. Crossover and Mutation,” Introduction to Genetic Algorithms, 1998. [Online]. Available: http://www.obitko.com/tutorials/genetic-algorithms/crossover-mutation.php .
§ 06 — Related

Similar articles in this journal

Related peer-reviewed studies published in this journal.
View all issues

Similar Articles

1-10 of 71

You may also start an advanced similarity search for this article.