Using the E-Netsim application for visual simulation of the movement of the autonomous robots

Main Article Content

Andrii Protsenko
Valeriy Ivanov

Abstract

The main task of path search methods is to generate a possible path through a section of the environment while bypassing obstacles and minimizing the path length. Existing methods focus on the shortest geometric path to the target and do not take into account various parameters, such as energy consumption or the complexity of sections of the path. This article proposes a method for finding a path and determining its optimality using Petri nets. In addition to generating solutions based on several parameters, this method allows you to expand the visual feedback. When calculating the optimality of the model using the geometric distance from the entry point of the robot to the goal along a certain route and the cost of the abstract amount of energy to move each route. The object of research is Petri nets and their use to model the process of creating routes and finding a way for autonomous robots. The subject of research is the mathematical apparatus of Petri nets and the feasibility of their use in modeling the process of creating routes and finding a way for autonomous robots. The research aims to demonstrate the benefits of Petri nets for visual modeling of the process of finding the path and motion of autonomous robots. Conclusions. The presented technique is suitable for use in modeling the process of finding a way and provides comprehensive statistics for further processing and analysis.

Article Details

How to Cite
Protsenko, A., & Ivanov, V. (2022). Using the E-Netsim application for visual simulation of the movement of the autonomous robots. Advanced Information Systems, 6(1), 27–31. https://doi.org/10.20998/2522-9052.2022.1.04
Section
Information systems modeling
Author Biographies

Andrii Protsenko, Kharkiv National University of Radio Electronics, Kharkiv, Ukraine

PhD student

Valeriy Ivanov, Kharkiv National University of Radio Electronics, Kharkiv, Ukraine

Candidate of Technical Sciences, Associate Professor, Professor of the Department of Systems Engineering

References

Проценко A., Іванов В. Класичні методи планування шляху для мобільних роботів. Системи управління, навігації та зв’язку. Полтава: ПНТУ, 2019. Т. 3 (55). С. 143-151. doi: https://doi.org/10.26906/SUNZ.2019.3.143.

Kloetzer, M., Mahulea, C. A Petri net based approach for multi-robot path planning. Discrete Event Dyn. Syst. 2014. Vol. 24. pp. 417–445. doi: https://doi.org/10.1007/s10626-013-0162-6.

C. Mahulea, Ed. Montijano, M. Kloetzer, Distributed Multirobot Path Planning in Unknown Maps Using Petri Net Models. IFAC-PapersOnLine. 2020. Vol. 53, Is. 2. Pp. 2063-2068. doi: https://doi.org/10.1016/j.ifacol.2020.12.2521.

J.C. Mohanta, D.R. Parhi, S.K. Patel. Path planning strategy for autonomous mobile robot navigation using Petri-GA optimisation, Comp. & Electr. Eng. 2011. Vol. 37, Is. 6. Pp. 1058-1070. doi: https://doi.org/10.1016/j.compeleceng.2011.07.007.

Gunardi, Yudhi, Dirman Hanafi, Fina Supegina, and Andi Adriansyah. Mathematics base for navigation mobile robot using reachability Petri net. Journal of Telecommunication, Electronic and Computer Engineering. 2018. 10, No. 1-9. Pp. 65-69.

Гавриленко C. Ю., Иванов В. Г. Разработка системы графического описания и моделирования распределенных программных объектов при проектировании информационных систем. Системи обробки інформації. 1 (2014): 10-13.

Питерсон Дж. Теория сетей Петри и моделирование систем. М. : Мир, 1984. 264 с.