Labour division algorithm for a group of unmanned aerial vehicles in a clustered target field

In this paper we propose an algorithm for tasks distribution (division of labour) for a group of unmanned aerial vehicles (UAVs) when monitoring an emergency zone. The input data of the algorithm are information on the homogeneous group of UAVs, the coordinates of the home point, and a set of elemen...

Full description

Bibliographic Details
Main Authors: Tebueva Fariza, Antonov Vladimir, Svistunov Nikolay
Format: Article
Language:English
Published: EDP Sciences 2021-01-01
Series:E3S Web of Conferences
Online Access:https://www.e3s-conferences.org/articles/e3sconf/pdf/2021/46/e3sconf_wfces2021_01028.pdf
id doaj-1fbea26908ec4ffca54d6004e7ee91e4
record_format Article
spelling doaj-1fbea26908ec4ffca54d6004e7ee91e42021-06-11T07:21:41ZengEDP SciencesE3S Web of Conferences2267-12422021-01-012700102810.1051/e3sconf/202127001028e3sconf_wfces2021_01028Labour division algorithm for a group of unmanned aerial vehicles in a clustered target fieldTebueva FarizaAntonov VladimirSvistunov NikolayIn this paper we propose an algorithm for tasks distribution (division of labour) for a group of unmanned aerial vehicles (UAVs) when monitoring an emergency zone. The input data of the algorithm are information on the homogeneous group of UAVs, the coordinates of the home point, and a set of elementary subtasks coming from the command center. The presented algorithm is analytical and allows obtaining the correct distribution result for any consistent input data. The algorithm is based on the principle of preliminary combining elementary tasks into clusters on a territorial basis. The results of simulation showed that the proposed labour distribution algorithm allows to achieve an average of 4.7% – 12.8% less time to complete a global task in comparison with the greedy algorithm. We experimentally established that the best result is achieved when choosing a cluster size so that about 75% of tasks are included in clusters, and 25% of tasks remain free.https://www.e3s-conferences.org/articles/e3sconf/pdf/2021/46/e3sconf_wfces2021_01028.pdf
collection DOAJ
language English
format Article
sources DOAJ
author Tebueva Fariza
Antonov Vladimir
Svistunov Nikolay
spellingShingle Tebueva Fariza
Antonov Vladimir
Svistunov Nikolay
Labour division algorithm for a group of unmanned aerial vehicles in a clustered target field
E3S Web of Conferences
author_facet Tebueva Fariza
Antonov Vladimir
Svistunov Nikolay
author_sort Tebueva Fariza
title Labour division algorithm for a group of unmanned aerial vehicles in a clustered target field
title_short Labour division algorithm for a group of unmanned aerial vehicles in a clustered target field
title_full Labour division algorithm for a group of unmanned aerial vehicles in a clustered target field
title_fullStr Labour division algorithm for a group of unmanned aerial vehicles in a clustered target field
title_full_unstemmed Labour division algorithm for a group of unmanned aerial vehicles in a clustered target field
title_sort labour division algorithm for a group of unmanned aerial vehicles in a clustered target field
publisher EDP Sciences
series E3S Web of Conferences
issn 2267-1242
publishDate 2021-01-01
description In this paper we propose an algorithm for tasks distribution (division of labour) for a group of unmanned aerial vehicles (UAVs) when monitoring an emergency zone. The input data of the algorithm are information on the homogeneous group of UAVs, the coordinates of the home point, and a set of elementary subtasks coming from the command center. The presented algorithm is analytical and allows obtaining the correct distribution result for any consistent input data. The algorithm is based on the principle of preliminary combining elementary tasks into clusters on a territorial basis. The results of simulation showed that the proposed labour distribution algorithm allows to achieve an average of 4.7% – 12.8% less time to complete a global task in comparison with the greedy algorithm. We experimentally established that the best result is achieved when choosing a cluster size so that about 75% of tasks are included in clusters, and 25% of tasks remain free.
url https://www.e3s-conferences.org/articles/e3sconf/pdf/2021/46/e3sconf_wfces2021_01028.pdf
work_keys_str_mv AT tebuevafariza labourdivisionalgorithmforagroupofunmannedaerialvehiclesinaclusteredtargetfield
AT antonovvladimir labourdivisionalgorithmforagroupofunmannedaerialvehiclesinaclusteredtargetfield
AT svistunovnikolay labourdivisionalgorithmforagroupofunmannedaerialvehiclesinaclusteredtargetfield
_version_ 1721382744385126400