{"id":"https://openalex.org/W3181962000","doi":"https://doi.org/10.1155/2021/5530454","title":"Solving \u201cLimited\u201d Task Allocation Problem for UAVs Based on Optimization Algorithms","display_name":"Solving \u201cLimited\u201d Task Allocation Problem for UAVs Based on Optimization Algorithms","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3181962000","doi":"https://doi.org/10.1155/2021/5530454","mag":"3181962000"},"language":"en","primary_location":{"id":"doi:10.1155/2021/5530454","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/5530454","pdf_url":"https://downloads.hindawi.com/journals/wcmc/2021/5530454.pdf","source":{"id":"https://openalex.org/S235346","display_name":"Wireless Communications and Mobile Computing","issn_l":"1530-8669","issn":["1530-8669","1530-8677"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Wireless Communications and Mobile Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://downloads.hindawi.com/journals/wcmc/2021/5530454.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077768585","display_name":"Xiaopan Zhang","orcid":"https://orcid.org/0000-0002-1167-6730"},"institutions":[{"id":"https://openalex.org/I196699116","display_name":"Wuhan University of Technology","ror":"https://ror.org/03fe7t173","country_code":"CN","type":"education","lineage":["https://openalex.org/I196699116"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaopan Zhang","raw_affiliation_strings":["School of Resources and Environmental Engineering, Wuhan University of Technology, Wuhan 430070, China","School of Resources and Environmental Engineering, Wuhan University of Technology, Wuhan 430070"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Resources and Environmental Engineering, Wuhan University of Technology, Wuhan 430070, China","institution_ids":["https://openalex.org/I196699116"]},{"raw_affiliation_string":"School of Resources and Environmental Engineering, Wuhan University of Technology, Wuhan 430070","institution_ids":["https://openalex.org/I196699116"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034101610","display_name":"Xingjun Chen","orcid":"https://orcid.org/0000-0003-0568-2218"},"institutions":[{"id":"https://openalex.org/I157637111","display_name":"Naval Academy","ror":"https://ror.org/05syseh24","country_code":"TR","type":"education","lineage":["https://openalex.org/I157637111"]},{"id":"https://openalex.org/I4401200389","display_name":"Dalian Naval Academy","ror":"https://ror.org/014c1mf08","country_code":null,"type":"education","lineage":["https://openalex.org/I4401200389"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Xingjun Chen","raw_affiliation_strings":["Institution of Dalian Naval Academy, Dalian 116018, China","Institution of Dalian Naval Academy, Dalian 116018"],"raw_orcid":"https://orcid.org/0000-0003-0568-2218","affiliations":[{"raw_affiliation_string":"Institution of Dalian Naval Academy, Dalian 116018, China","institution_ids":["https://openalex.org/I4401200389"]},{"raw_affiliation_string":"Institution of Dalian Naval Academy, Dalian 116018","institution_ids":["https://openalex.org/I157637111","https://openalex.org/I4401200389"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034101610"],"corresponding_institution_ids":["https://openalex.org/I157637111","https://openalex.org/I4401200389"],"apc_list":{"value":2550,"currency":"USD","value_usd":2550},"apc_paid":{"value":2550,"currency":"USD","value_usd":2550},"fwci":0.1817,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.4568371,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"2021","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8721849918365479},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.751676082611084},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6648391485214233},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5630764961242676},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5360190272331238},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.5205181837081909},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5131383538246155},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.47785207629203796},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.44739001989364624},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4339081645011902},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4162948727607727},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40144604444503784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3380542993545532},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28935033082962036},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.24194738268852234},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.07571783661842346}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8721849918365479},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.751676082611084},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6648391485214233},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5630764961242676},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5360190272331238},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5205181837081909},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5131383538246155},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.47785207629203796},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.44739001989364624},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4339081645011902},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4162948727607727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40144604444503784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3380542993545532},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28935033082962036},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.24194738268852234},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.07571783661842346},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1155/2021/5530454","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/5530454","pdf_url":"https://downloads.hindawi.com/journals/wcmc/2021/5530454.pdf","source":{"id":"https://openalex.org/S235346","display_name":"Wireless Communications and Mobile Computing","issn_l":"1530-8669","issn":["1530-8669","1530-8677"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Wireless Communications and Mobile Computing","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:62d868d697f7459ebffe0ea5602a19f2","is_oa":false,"landing_page_url":"https://doaj.org/article/62d868d697f7459ebffe0ea5602a19f2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wireless Communications and Mobile Computing, Vol 2021 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1155/2021/5530454","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/5530454","pdf_url":"https://downloads.hindawi.com/journals/wcmc/2021/5530454.pdf","source":{"id":"https://openalex.org/S235346","display_name":"Wireless Communications and Mobile Computing","issn_l":"1530-8669","issn":["1530-8669","1530-8677"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Wireless Communications and Mobile Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2906937672","display_name":"\u57fa\u4e8e\u6df7\u5408\u7c92\u5ea6\u4e8b\u4ef6\u56fe\u7684\u6d77\u6218\u573a\u8054\u5408\u7f16\u961f\u4f5c\u6218\u4efb\u52a1\u89c4\u5212\u7814\u7a76","funder_award_id":"71701208","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3181962000.pdf","grobid_xml":"https://content.openalex.org/works/W3181962000.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W152613852","https://openalex.org/W196129739","https://openalex.org/W1991528957","https://openalex.org/W2003085167","https://openalex.org/W2005547638","https://openalex.org/W2012902352","https://openalex.org/W2022485595","https://openalex.org/W2035549557","https://openalex.org/W2052140935","https://openalex.org/W2098392363","https://openalex.org/W2107315187","https://openalex.org/W2133491672","https://openalex.org/W2163923281","https://openalex.org/W2250322698","https://openalex.org/W2734482142","https://openalex.org/W2811487153","https://openalex.org/W2886699371","https://openalex.org/W2971525201","https://openalex.org/W2982129463","https://openalex.org/W3015712234","https://openalex.org/W3035816547","https://openalex.org/W3120436174"],"related_works":["https://openalex.org/W2891776881","https://openalex.org/W2244559970","https://openalex.org/W2557467218","https://openalex.org/W2536297025","https://openalex.org/W2360483549","https://openalex.org/W2771290394","https://openalex.org/W2918080139","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2145877535"],"abstract_inverted_index":{"With":[0],"the":[1,19,25,33,72,75,96,106,110,119,126,132,138,145,149,153,159,164,195,199,209,214,219,228],"rapid":[2],"development":[3],"of":[4,18,27,35,48,53,74,99,109,128,134,140,147,213],"science":[5],"and":[6,29,131,155,174,185,211],"technology,":[7],"unmanned":[8],"technology":[9],"has":[10,188],"been":[11,189,206],"widely":[12],"used":[13],"in":[14,24,137,158,218,227],"many":[15],"fields.":[16],"One":[17],"most":[20],"important":[21,65],"applications":[22],"is":[23,68,92],"field":[26,34],"civil":[28],"military":[30,36],"UAVs.":[31],"In":[32,50],"UAVs":[37,41],"(unmanned":[38],"aerial":[39],"vehicles),":[40],"usually":[42],"have":[43,205],"to":[44,71,89,94,104],"complete":[45],"a":[46,179],"series":[47,52],"tasks.":[49,60],"this":[51],"tasks,":[54,101],"there":[55],"are":[56,183,225],"often":[57],"some":[58],"key":[59,100,150],"Key":[61],"tasks":[62,88],"play":[63],"an":[64],"role,":[66],"which":[67],"highly":[69],"related":[70],"feasibility":[73],"whole":[76],"action":[77],"or":[78],"task;":[79],"mission":[80],"failure":[81],"sometimes":[82],"causes":[83],"incalculable":[84],"damage.":[85],"When":[86],"assigning":[87],"UAVs,":[90],"it":[91,187],"necessary":[93],"ensure":[95,105],"accurate":[97],"implementation":[98,108],"so":[102],"as":[103],"orderly":[107],"overall":[111],"task.":[112],"This":[113],"paper":[114],"not":[115],"only":[116],"successfully":[117],"solved":[118],"previous":[120],"problems":[121,157],"but":[122],"also":[123],"comprehensively":[124],"considered":[125],"minimization":[127],"resource":[129],"consumption":[130],"maximization":[133],"task":[135,142,161,222],"revenue":[136],"process":[139],"UAV":[141,160,221],"allocation.":[143],"On":[144],"basis":[146],"considering":[148,152],"system,":[151],"constraints":[154],"multiobjective":[156],"allocation":[162,166,223],"process,":[163],"violence":[165],"algorithm,":[167,171,173],"constraint":[168,180],"optimization":[169],"evolutionary":[170,181],"PSO":[172],"greedy":[175],"algorithm":[176,182],"combined":[177],"with":[178],"improved":[184],"optimized;":[186],"proven":[190],"that":[191],"they":[192],"can":[193],"solve":[194],"above":[196,215],"difficulties.":[197],"At":[198],"same":[200],"time,":[201],"several":[202],"comparison":[203],"experiments":[204],"carried":[207],"out;":[208],"performance":[210],"conclusion":[212],"four":[216],"algorithms":[217],"\u201climited\u201d":[220],"scheme":[224],"analyzed":[226],"experimental":[229],"part.":[230]},"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}