Sökning: id:"swepub:oai:DiVA.org:kth-333584" >
A Task-Driven Seque...
-
Qi, NanNanjing Univ Aeronaut & Astronaut, Key Lab Dynam Cognit Syst Electromagnet Spectrum S, Minist Ind & Informat Technol, Nanjing 210016, Peoples R China.
(författare)
A Task-Driven Sequential Overlapping Coalition Formation Game for Resource Allocation in Heterogeneous UAV Networks
- Artikel/kapitelEngelska2023
Förlag, utgivningsår, omfång ...
-
Institute of Electrical and Electronics Engineers (IEEE),2023
-
printrdacarrier
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:kth-333584
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-333584URI
-
https://doi.org/10.1109/TMC.2022.3165965DOI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:art swepub-publicationtype
Anmärkningar
-
QC 20230803
-
A heterogeneous unmanned aerial vehicle (UAV) network where UAVs carrying different resources form coalition and cooperatively carry out tasks is of crucial importance for fulfilling diverse tasks. However, the existing coalition formation (CF) game model only optimizes the composition of UAVs in a single coalition, which results in disjoined coalitions. In order to tackle this issue, a sequential overlapping coalition formation (OCF) game is proposed by considering the overlapping and complementary relations of resource properties and the task execution order. Moreover, different from the Pareto and selfish orders, a bilateral mutual benefit transfer (BMBT) order is proposed to optimize the cooperative task resource allocation through partial cooperation among overlapping coalition members. Furthermore, using the preference relation between UAVs carrying resources and tasks requiring the same type of resource, a preference gravity-guided tabu search (PGG-TS) algorithm is developed to obtain a stable coalition structure. Numerical results verify that the proposed PGG-TS algorithm increases the average utility of tasks by 12.5% and 38.5% compared with the split-merge preferred OCF algorithm and non-overlapping CF algorithm, respectively. The utility of the proposed BMBT order increases by 25.1% and 34.3% compared with selfish and Pareto orders, respectively.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Huang, ZanqiNanjing Univ Aeronaut & Astronaut, Key Lab Dynam Cognit Syst Electromagnet Spectrum S, Minist Ind & Informat Technol, Nanjing 210016, Peoples R China.
(författare)
-
Zhou, FuhuiNanjing Univ Aeronaut & Astronaut, Key Lab Dynam Cognit Syst Electromagnet Spectrum S, Minist Ind & Informat Technol, Nanjing 210016, Peoples R China.
(författare)
-
Shi, QingjiangTongji Univ, Sch Software Engn, Shanghai 201804, Peoples R China.;Shenzhen Res Inst Big Data, Shenzhen 518172, Peoples R China.
(författare)
-
Wu, QihuiNanjing Univ Aeronaut & Astronaut, Key Lab Dynam Cognit Syst Electromagnet Spectrum S, Minist Ind & Informat Technol, Nanjing 210016, Peoples R China.
(författare)
-
Xiao, Ming,1975-KTH,Teknisk informationsvetenskap(Swepub:kth)u1iq6n9a
(författare)
-
Nanjing Univ Aeronaut & Astronaut, Key Lab Dynam Cognit Syst Electromagnet Spectrum S, Minist Ind & Informat Technol, Nanjing 210016, Peoples R China.Tongji Univ, Sch Software Engn, Shanghai 201804, Peoples R China.;Shenzhen Res Inst Big Data, Shenzhen 518172, Peoples R China.
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:IEEE Transactions on Mobile Computing: Institute of Electrical and Electronics Engineers (IEEE)22:8, s. 4439-44551536-12331558-0660
Internetlänk
Hitta via bibliotek
Till lärosätets databas