Formalization of the Problem of Optimization of Base Places and Routes of the UAV Group
Introduction. The problem of planning the mission of a set of heterogeneous unmanned aerial vehicles (UAVs)is considered, which is to survey and/or service a given set of targets in the field. A mathematical model of the problem and algorithms for its solving that is based on deterministic local sea...
Saved in:
| Published in: | Kìbernetika ta komp'ûternì tehnologìï (Online) no. 4; pp. 12 - 26 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
V.M. Glushkov Institute of Cybernetics
30.12.2021
|
| Subjects: | |
| ISSN: | 2707-4501, 2707-451X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Introduction. The problem of planning the mission of a set of heterogeneous unmanned aerial vehicles (UAVs)is considered, which is to survey and/or service a given set of targets in the field. A mathematical model of the problem and algorithms for its solving that is based on deterministic local search, as well as optimization by ant colonies are proposed. The efficiency of algorithms is investigated based on the results of solving problems with real objects in the field. The relative error of the results of each algorithm was obtained, which allowed to compare their efficiency.
The purpose of the paper is to solve a routing problem in different ways to reduce overall mission cost and compare the efficiency. The problem statement considers multiple starting points and destinations (depots) for UAVs with determined capacity, so algorithms proposed in the paper are designed to optimize the initial placement. Each UAV has a maximum flight distance because of an energy limit, though vehicles can be recharged by visiting one of previously placed depots. The mission goal is to visit all the given targets while minimizing the overall cost, so fuel consumption over distance, depot placement, and resources needed to survey and/or service of the target by each UAV are considered as components of the final cost metric to be minimized considering a set of specific constraints.
Results. To solve the given UAV routing problem, a max-min algorithm of ant systems was developed, which features step-by-step interaction of ants to form solutions, a hybrid taboo search algorithm and a deterministic local search algorithm - the decay vector method. The developed algorithms were tested both on the known travelling salesman problems, and on specially developed problems with multiple depots and additional restrictions.
Conclusions. The proposed algorithms which are based on ant colony optimization are compared both in terms of accuracy and computation time. A hybrid algorithm achieved slightly better score, though computation time has increased. Keywords: routing, combinatorial optimization, UAV, local search, ant colony optimization algorithms. |
|---|---|
| AbstractList | Introduction. The problem of planning the mission of a set of heterogeneous unmanned aerial vehicles (UAVs)is considered, which is to survey and/or service a given set of targets in the field. A mathematical model of the problem and algorithms for its solving that is based on deterministic local search, as well as optimization by ant colonies are proposed. The efficiency of algorithms is investigated based on the results of solving problems with real objects in the field. The relative error of the results of each algorithm was obtained, which allowed to compare their efficiency.
The purpose of the paper is to solve a routing problem in different ways to reduce overall mission cost and compare the efficiency. The problem statement considers multiple starting points and destinations (depots) for UAVs with determined capacity, so algorithms proposed in the paper are designed to optimize the initial placement. Each UAV has a maximum flight distance because of an energy limit, though vehicles can be recharged by visiting one of previously placed depots. The mission goal is to visit all the given targets while minimizing the overall cost, so fuel consumption over distance, depot placement, and resources needed to survey and/or service of the target by each UAV are considered as components of the final cost metric to be minimized considering a set of specific constraints.
Results. To solve the given UAV routing problem, a max-min algorithm of ant systems was developed, which features step-by-step interaction of ants to form solutions, a hybrid taboo search algorithm and a deterministic local search algorithm - the decay vector method. The developed algorithms were tested both on the known travelling salesman problems, and on specially developed problems with multiple depots and additional restrictions.
Conclusions. The proposed algorithms which are based on ant colony optimization are compared both in terms of accuracy and computation time. A hybrid algorithm achieved slightly better score, though computation time has increased. Keywords: routing, combinatorial optimization, UAV, local search, ant colony optimization algorithms. Introduction. The problem of planning the mission of a set of heterogeneous unmanned aerial vehicles (UAVs)is considered, which is to survey and/or service a given set of targets in the field. A mathematical model of the problem and algorithms for its solving that is based on deterministic local search, as well as optimization by ant colonies are proposed. The efficiency of algorithms is investigated based on the results of solving problems with real objects in the field. The relative error of the results of each algorithm was obtained, which allowed to compare their efficiency. The purpose of the paper is to solve a routing problem in different ways to reduce overall mission cost and compare the efficiency. The problem statement considers multiple starting points and destinations (depots) for UAVs with determined capacity, so algorithms proposed in the paper are designed to optimize the initial placement. Each UAV has a maximum flight distance because of an energy limit, though vehicles can be recharged by visiting one of previously placed depots. The mission goal is to visit all the given targets while minimizing the overall cost, so fuel consumption over distance, depot placement, and resources needed to survey and/or service of the target by each UAV are considered as components of the final cost metric to be minimized considering a set of specific constraints. Results. To solve the given UAV routing problem, a max-min algorithm of ant systems was developed, which features step-by-step interaction of ants to form solutions, a hybrid taboo search algorithm and a deterministic local search algorithm - the decay vector method. The developed algorithms were tested both on the known travelling salesman problems, and on specially developed problems with multiple depots and additional restrictions. Conclusions. The proposed algorithms which are based on ant colony optimization are compared both in terms of accuracy and computation time. A hybrid algorithm achieved slightly better score, though computation time has increased. |
| Author | Hulianytskyi, Leonid Rybalchenko, Oleg |
| Author_xml | – sequence: 1 givenname: Leonid orcidid: 0000-0002-1379-4132 surname: Hulianytskyi fullname: Hulianytskyi, Leonid organization: V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv – sequence: 2 givenname: Oleg orcidid: 0000-0002-5716-030X surname: Rybalchenko fullname: Rybalchenko, Oleg organization: V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv |
| BookMark | eNpNkM1OwzAQhC1UJErpA3DLCyT4N3aOpaKlUqUiRIGbtXZsSJXUlZMe4OlJf1Rx2Z2d0X6HuUWDbdg6hO4JzhintHigEsuUC_KZUZLxjF6h4cUaXDQmN2jcthuMMS0IZkoM0ccsxAbq6he6KmyT4JPu2yUvMZjaNYdzteuq5l_8CG2f12Bdm8C2TF7Dvuvl-XE9eU_mMex3d-jaQ9268XmP0Hr29DZ9Tper-WI6WaaWCELTojASFOcCmCPWGOcVFbl1glgOIDn2DntDlcdMWoo5zY3ISyxL7HDuSmAjtDhxywAbvYtVA_FHB6j00QjxS0PsKls7LRXBTuWCAZHcMQvgi1wZgH4YRcueRU4sG0PbRucvPIL1sWh9aFIfWtWUaK4p-wMrYXHs |
| Cites_doi | 10.1155/2019/9063232 10.1007/978-3-319-91086-4_10 10.7551/mitpress/1290.001.0001 10.1016/j.endm.2018.03.022 10.1007/s00500-013-0993-y 10.1007/s10559-020-00235-8 10.1080/13675567.2019.1630374 10.1016/j.eswa.2020.113846 10.1016/S0167-739X(00)00043-1 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.34229/2707-451X.21.4.2 |
| DatabaseName | CrossRef DOAJ Open Access Full Text |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Sciences (General) |
| EISSN | 2707-451X |
| EndPage | 26 |
| ExternalDocumentID | oai_doaj_org_article_7810e8653a174e3caaf968baa68bb82d 10_34229_2707_451X_21_4_2 |
| GroupedDBID | AAYXX ALMA_UNASSIGNED_HOLDINGS CITATION GROUPED_DOAJ |
| ID | FETCH-LOGICAL-c1512-99b7a8445a3e1cbbef8256ce51c4aa740fe0fb28f037c20426b56d07d0e06eda3 |
| IEDL.DBID | DOA |
| ISSN | 2707-4501 |
| IngestDate | Fri Oct 03 12:45:10 EDT 2025 Sat Nov 29 04:41:23 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://creativecommons.org/licenses/by-nc-sa/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c1512-99b7a8445a3e1cbbef8256ce51c4aa740fe0fb28f037c20426b56d07d0e06eda3 |
| ORCID | 0000-0002-1379-4132 0000-0002-5716-030X |
| OpenAccessLink | https://doaj.org/article/7810e8653a174e3caaf968baa68bb82d |
| PageCount | 15 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_7810e8653a174e3caaf968baa68bb82d crossref_primary_10_34229_2707_451X_21_4_2 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-12-30 |
| PublicationDateYYYYMMDD | 2021-12-30 |
| PublicationDate_xml | – month: 12 year: 2021 text: 2021-12-30 day: 30 |
| PublicationDecade | 2020 |
| PublicationTitle | Kìbernetika ta komp'ûternì tehnologìï (Online) |
| PublicationYear | 2021 |
| Publisher | V.M. Glushkov Institute of Cybernetics |
| Publisher_xml | – name: V.M. Glushkov Institute of Cybernetics |
| References | ref13 ref12 ref14 ref11 ref10 ref0 ref2 ref1 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref13 – ident: ref4 – ident: ref5 doi: 10.1155/2019/9063232 – ident: ref8 doi: 10.1007/978-3-319-91086-4_10 – ident: ref6 – ident: ref9 doi: 10.7551/mitpress/1290.001.0001 – ident: ref7 – ident: ref1 doi: 10.1016/j.endm.2018.03.022 – ident: ref14 doi: 10.1007/s00500-013-0993-y – ident: ref3 doi: 10.1007/s10559-020-00235-8 – ident: ref0 doi: 10.1080/13675567.2019.1630374 – ident: ref2 doi: 10.1016/j.eswa.2020.113846 – ident: ref11 – ident: ref12 – ident: ref10 doi: 10.1016/S0167-739X(00)00043-1 |
| SSID | ssj0002910385 ssib044750725 |
| Score | 2.1673489 |
| Snippet | Introduction. The problem of planning the mission of a set of heterogeneous unmanned aerial vehicles (UAVs)is considered, which is to survey and/or service a... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| StartPage | 12 |
| SubjectTerms | ant colony optimization algorithms combinatorial optimization local search routing uav |
| Title | Formalization of the Problem of Optimization of Base Places and Routes of the UAV Group |
| URI | https://doaj.org/article/7810e8653a174e3caaf968baa68bb82d |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2707-451X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002910385 issn: 2707-4501 databaseCode: DOA dateStart: 20200101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2707-451X dateEnd: 99991231 omitProxy: false ssIdentifier: ssib044750725 issn: 2707-4501 databaseCode: M~E dateStart: 20200101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQYmBBlIcoL3lgAKS0fiWOxxZRMaDSgUI3y3ZsCQla1BZ-P77EoDCxsESJ89R3l3sk5-8QuvCe25JRnsV0wsYEpaKZZRXPFPSz5sSUJtQThe_leFzOZmrSavUFNWENPXADXF-WlPiyyLmJsbPnzpigitIaExfxLhVYXyJVK5mKmgQsdkQmTQWbzBQQgUM9I5MEiL4JbX5xcsGY6qdBOusx2hM99stJtbj8a6cz2kU7KVrEg-YpO2jDz_dQJ72PK3yZSKOv9tHzCILP1zSrEi8CjpEdnjTtYmDzIdqGt9buYXRfeFJXZGEzrzCUBsXVdOJ08ITrz1IHaDq6fby5y1LThMyB886UstKUQuSGe-qs9SHmgIXzOXXCGClI8CRYVgbCpWOQQdm8qIisiCeFrww_RJvzxdwfIexsyJ3gRQzCvJCSGBXjExeYqYnmgu-i62-U9HvDjaFjTlFDqgFSDZBqRrXQrIuGgOPPgUBrXQ9EYeskbP2XsI__4yInaJtBYQqwNZJTtLlefvgztOU-1y-r5XmtR1_c5ccC |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Formalization+of+the+Problem+of+Optimization+of+Base+Places+and+Routes+of+the+UAV+Group&rft.jtitle=K%C3%ACbernetika+ta+komp%27%C3%BBtern%C3%AC+tehnolog%C3%AC%C3%AF+%28Online%29&rft.au=Leonid+Hulianytskyi&rft.au=Oleg+Rybalchenko&rft.date=2021-12-30&rft.pub=V.M.+Glushkov+Institute+of+Cybernetics&rft.issn=2707-4501&rft.eissn=2707-451X&rft.issue=4&rft.spage=12&rft.epage=26&rft_id=info:doi/10.34229%2F2707-451X.21.4.2&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_7810e8653a174e3caaf968baa68bb82d |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2707-4501&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2707-4501&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2707-4501&client=summon |