{"id":"https://openalex.org/W4205098832","doi":"https://doi.org/10.1109/icct52962.2021.9657867","title":"Interference Resource Scheduling Algorithm Based on Potential Game for UAV Cooperative Combat","display_name":"Interference Resource Scheduling Algorithm Based on Potential Game for UAV Cooperative Combat","publication_year":2021,"publication_date":"2021-10-13","ids":{"openalex":"https://openalex.org/W4205098832","doi":"https://doi.org/10.1109/icct52962.2021.9657867"},"language":"en","primary_location":{"id":"doi:10.1109/icct52962.2021.9657867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icct52962.2021.9657867","pdf_url":null,"source":{"id":"https://openalex.org/S4363607878","display_name":"2021 IEEE 21st International Conference on Communication Technology (ICCT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 21st International Conference on Communication Technology (ICCT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052212946","display_name":"Min Deng","orcid":"https://orcid.org/0000-0003-3211-2931"},"institutions":[{"id":"https://openalex.org/I4610292","display_name":"Xiangtan University","ror":"https://ror.org/00xsfaz62","country_code":"CN","type":"education","lineage":["https://openalex.org/I4610292"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Min Deng","raw_affiliation_strings":["School of Automatic and Electronic Information Xiangtan University Hunan National Center for Applied Mathematics, Xiangtan, China"],"affiliations":[{"raw_affiliation_string":"School of Automatic and Electronic Information Xiangtan University Hunan National Center for Applied Mathematics, Xiangtan, China","institution_ids":["https://openalex.org/I4610292"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086376901","display_name":"Zhigao Wu","orcid":"https://orcid.org/0000-0002-5369-9965"},"institutions":[{"id":"https://openalex.org/I4610292","display_name":"Xiangtan University","ror":"https://ror.org/00xsfaz62","country_code":"CN","type":"education","lineage":["https://openalex.org/I4610292"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhigao Wu","raw_affiliation_strings":["School of Automatic and Electronic Information Xiangtan University, Xiangtan, China"],"affiliations":[{"raw_affiliation_string":"School of Automatic and Electronic Information Xiangtan University, Xiangtan, China","institution_ids":["https://openalex.org/I4610292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022457238","display_name":"Yongqi Chen","orcid":"https://orcid.org/0000-0001-7237-8385"},"institutions":[{"id":"https://openalex.org/I4210160629","display_name":"China Information Technology Security Evaluation Center","ror":"https://ror.org/053cexp66","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210160629"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yongqi Chen","raw_affiliation_strings":["Science and Technology on Communication Information Security Control Laboratory,Jiaxing,China"],"affiliations":[{"raw_affiliation_string":"Science and Technology on Communication Information Security Control Laboratory,Jiaxing,China","institution_ids":["https://openalex.org/I4210160629"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052212946"],"corresponding_institution_ids":["https://openalex.org/I4610292"],"apc_list":null,"apc_paid":null,"fwci":1.2515,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77953378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"982","last_page":"987"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9979000091552734,"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/T12158","display_name":"Guidance and Control Systems","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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.7100781202316284},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.667506754398346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6110236644744873},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.5634204149246216},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.5441731810569763},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.4444776475429535},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43948376178741455},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4338158369064331},{"id":"https://openalex.org/keywords/potential-game","display_name":"Potential game","score":0.4285619854927063},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.4175569713115692},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4155852198600769},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3783133029937744},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.29471564292907715},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12975284457206726},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.11827215552330017}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7100781202316284},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.667506754398346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6110236644744873},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.5634204149246216},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.5441731810569763},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.4444776475429535},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43948376178741455},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4338158369064331},{"id":"https://openalex.org/C2778079155","wikidata":"https://www.wikidata.org/wiki/Q288500","display_name":"Potential game","level":3,"score":0.4285619854927063},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.4175569713115692},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4155852198600769},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3783133029937744},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.29471564292907715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12975284457206726},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.11827215552330017},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icct52962.2021.9657867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icct52962.2021.9657867","pdf_url":null,"source":{"id":"https://openalex.org/S4363607878","display_name":"2021 IEEE 21st International Conference on Communication Technology (ICCT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 21st International Conference on Communication Technology (ICCT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G664115231","display_name":null,"funder_award_id":"20l9JJ50620","funder_id":"https://openalex.org/F4320322843","funder_display_name":"Natural Science Foundation of\u00a0Hunan Province"},{"id":"https://openalex.org/G718473409","display_name":null,"funder_award_id":"2020YFA0713502","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"}],"funders":[{"id":"https://openalex.org/F4320322843","display_name":"Natural Science Foundation of\u00a0Hunan Province","ror":null},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1855445777","https://openalex.org/W2045495451","https://openalex.org/W2345486249","https://openalex.org/W2517977512","https://openalex.org/W2792557859","https://openalex.org/W2968331804","https://openalex.org/W2974272797","https://openalex.org/W3022321359","https://openalex.org/W3032373658","https://openalex.org/W3034825911","https://openalex.org/W3045457574","https://openalex.org/W3092206612","https://openalex.org/W3120287418","https://openalex.org/W3127894535"],"related_works":["https://openalex.org/W4210759752","https://openalex.org/W2528338391","https://openalex.org/W2150034320","https://openalex.org/W2121776644","https://openalex.org/W2052317362","https://openalex.org/W2103989257","https://openalex.org/W2953849958","https://openalex.org/W2185830305","https://openalex.org/W3119014777","https://openalex.org/W2557418835"],"abstract_inverted_index":{"Interference":[0],"resource":[1,32,73,110,121],"scheduling":[2,24,33,74,122],"is":[3,44,60,76],"crucial":[4],"in":[5],"UAV":[6],"(unmanned":[7],"aerial":[8],"vehicle)":[9],"cooperative":[10],"combats":[11],"of":[12,17,21,37,41,50,66,87],"all":[13],"scales.":[14],"In":[15],"view":[16],"the":[18,22,38,48,54,64,71,79,83,88,101,108,118,130],"simple":[19],"constraints":[20],"existing":[23],"models":[25],"and":[26,52,68,85],"their":[27],"small-scale":[28],"application":[29],"situations,":[30],"a":[31,94],"model":[34,75],"with":[35,100,134],"constraint":[36],"minimum":[39],"number":[40],"jammed":[42],"targets":[43],"proposed":[45,105],"to":[46,62,106],"maximize":[47],"benefit":[49,67,128],"interference":[51,72,109,120],"minimize":[53],"cost.":[55,69],"The":[56,113],"analytic":[57],"hierarchy":[58],"process":[59],"used":[61],"weight":[63],"indicators":[65],"And":[70],"constructed":[77],"by":[78],"game":[80,96],"theory.":[81],"Besides,":[82],"feasibility":[84],"existence":[86],"Nash":[89],"equilibrium":[90],"are":[91],"proved.":[92],"Then,":[93],"potential":[95],"theory":[97],"algorithm":[98,103,123],"combined":[99],"tabu":[102],"was":[104],"solve":[107],"allocation":[111],"problem.":[112],"simulation":[114],"results":[115],"show":[116],"that":[117],"designed":[119],"can":[124],"achieve":[125],"higher":[126],"integration":[127],"than":[129],"other":[131],"compared":[132],"algorithms":[133],"less":[135],"iterations.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}