Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
https://dspace.ncfu.ru/handle/20.500.12258/24287| Название: | Method and algorithm for task allocation in a heterogeneous group of UAVs in a clustered field of targets |
| Авторы: | Petrenko, V. I. Петренко, В. И. Tebueva, F. B. Тебуева, Ф. Б. Antonov, V. O. Антонов, В. О. Ryabtsev, S. S. Рябцев, С. С. Pavlov, A. S. Павлов, А. С. |
| Ключевые слова: | Decentralized task allocation;Task allocation;Swarm robotics;Multi-robotic systems;Labor division;Group control |
| Дата публикации: | 2023 |
| Библиографическое описание: | Petrenko, V., Tebueva, F., Antonov, V., Ryabtsev, S., Pavlov, A., Sakolchik, A. Method and algorithm for task allocation in a heterogeneous group of UAVs in a clustered field of targets // Journal of King Saud University - Computer and Information Sciences. - 2023. - 35 (6), статья № 101580. - DOI: 10.1016/j.jksuci.2023.101580 |
| Источник: | Journal of King Saud University - Computer and Information Sciences |
| Краткий осмотр (реферат): | The article presents a method for distributing tasks to agents of a heterogeneous UAV group in a cluster field of tasks, when the number of tasks exceeds the number of agents by 5–20 times. The proposed task distribution method based on a three-stage procedure for distributing agents of different specializations among task clusters, taking into account the agent value function. To evaluate the effectiveness, the method compared with the greedy task distribution algorithm, the collective plan improvement algorithm, and the consensus-based linking algorithm with local rescheduling. 2400 experiments were carried out with different group sizes and randomly generated task maps, the results of which revealed the high efficiency of the proposed method. According to the results of the study, a relationship found between the efficiency of the method depending on the concentration of the number of tasks per agent. With an increase in the specific number of tasks per agent, the task execution time improves and the indicator of the path traveled by agents worsens. With a ratio of 5–10 agents per 100 tasks, the method shows the best results in terms of the parameters of the path traveled by agents and task execution time. |
| URI (Унифицированный идентификатор ресурса): | http://hdl.handle.net/20.500.12258/24287 |
| Располагается в коллекциях: | Статьи, проиндексированные в SCOPUS, WOS |
Файлы этого ресурса:
| Файл | Описание | Размер | Формат | |
|---|---|---|---|---|
| WoS 1684 .pdf Доступ ограничен | 124.41 kB | Adobe PDF | Просмотреть/Открыть | |
| scopusresults 2674 .pdf Доступ ограничен | 133.93 kB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.