Problem of optimal area monitoring by group of robots and its solution by evolutionary algorithm

The problem of monitoring of some area by means of mobile robots is considered. In the stated problem we assume that the area with obstacles is given and randomly located marks are also given. The control object has the field of viewing. It is necessary to find the optimal control, which will move the robots from the initial state to the terminal state for a given time and scan as many marks as possible. To solve the task the evolutionary algorithm of grey wolf optimizer is used. © 2018 IEEE.

Authors
Diveev A. 1 , Shmalko E. 1 , Sofronova E. 1
Conference proceedings
Proceedings of the 13th IEEE Conference on Industrial Electronics and Applications, ICIEA 2018
Publisher
Institute of Electrical and Electronics Engineers Inc.
Language
English
Pages
141-146
Status
Published
DOI
10.1109/ICIEA.2018.8397704
Year
2018
Organizations
  • 1 Federal Research Center 'Computer Science and Control', Russia Academy of Sciences, RUDN University, Moscow, Russian Federation
Keywords
evolutionary algorithm; group of mobile robots; problem of optimal monitoring
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/6572/
Share

Other records