Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/20.500.12258/24287
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPetrenko, V. I.-
dc.contributor.authorПетренко, В. И.-
dc.contributor.authorTebueva, F. B.-
dc.contributor.authorТебуева, Ф. Б.-
dc.contributor.authorAntonov, V. O.-
dc.contributor.authorАнтонов, В. О.-
dc.contributor.authorRyabtsev, S. S.-
dc.contributor.authorРябцев, С. С.-
dc.contributor.authorPavlov, A. S.-
dc.contributor.authorПавлов, А. С.-
dc.date.accessioned2023-08-04T11:51:30Z-
dc.date.available2023-08-04T11:51:30Z-
dc.date.issued2023-
dc.identifier.citationPetrenko, 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.101580ru
dc.identifier.urihttp://hdl.handle.net/20.500.12258/24287-
dc.description.abstractThe 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.ru
dc.language.isoenru
dc.relation.ispartofseriesJournal of King Saud University - Computer and Information Sciences-
dc.subjectDecentralized task allocationru
dc.subjectTask allocationru
dc.subjectSwarm roboticsru
dc.subjectMulti-robotic systemsru
dc.subjectLabor divisionru
dc.subjectGroup controlru
dc.titleMethod and algorithm for task allocation in a heterogeneous group of UAVs in a clustered field of targetsru
dc.typeСтатьяru
vkr.instИнститут цифрового развитияru
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File Description SizeFormat 
WoS 1684 .pdf
  Restricted Access
124.41 kBAdobe PDFView/Open
scopusresults 2674 .pdf
  Restricted Access
133.93 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.