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.

Авторы
Редакторы
-
Издательство
Institute of Electrical and Electronics Engineers Inc.
Номер выпуска
-
Язык
Английский
Страницы
141-146
Статус
Опубликовано
Подразделение
-
Ссылка
-
Номер
-
Том
-
Год
2018
Организации
  • 1 Federal Research Center 'Computer Science and Control', Russia Academy of Sciences, RUDN University, Moscow, Russian Federation
Ключевые слова
evolutionary algorithm; group of mobile robots; problem of optimal monitoring
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/6572/