{"id":"https://openalex.org/W3124066600","doi":"https://doi.org/10.1109/globecom42002.2020.9322226","title":"Cooperative Path Planning of a UAV Swarm to Meet Temporal-Spatial User Demands","display_name":"Cooperative Path Planning of a UAV Swarm to Meet Temporal-Spatial User Demands","publication_year":2020,"publication_date":"2020-12-01","ids":{"openalex":"https://openalex.org/W3124066600","doi":"https://doi.org/10.1109/globecom42002.2020.9322226","mag":"3124066600"},"language":"en","primary_location":{"id":"doi:10.1109/globecom42002.2020.9322226","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom42002.2020.9322226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","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/A5100437036","display_name":"Kai Wang","orcid":"https://orcid.org/0000-0002-6170-4744"},"institutions":[{"id":"https://openalex.org/I174442536","display_name":"South Central Minzu University","ror":"https://ror.org/03d7sax13","country_code":"CN","type":"education","lineage":["https://openalex.org/I174442536"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kai Wang","raw_affiliation_strings":["College of Computer Science, South-Central University for Nationalities, Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, South-Central University for Nationalities, Wuhan, China","institution_ids":["https://openalex.org/I174442536"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100696673","display_name":"Xiao Zhang","orcid":"https://orcid.org/0000-0002-8020-6142"},"institutions":[{"id":"https://openalex.org/I174442536","display_name":"South Central Minzu University","ror":"https://ror.org/03d7sax13","country_code":"CN","type":"education","lineage":["https://openalex.org/I174442536"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiao Zhang","raw_affiliation_strings":["College of Computer Science, South-Central University for Nationalities, Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, South-Central University for Nationalities, Wuhan, China","institution_ids":["https://openalex.org/I174442536"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007119869","display_name":"Lingjie Duan","orcid":"https://orcid.org/0000-0002-0217-6507"},"institutions":[{"id":"https://openalex.org/I152815399","display_name":"Singapore University of Technology and Design","ror":"https://ror.org/05j6fvn87","country_code":"SG","type":"education","lineage":["https://openalex.org/I152815399"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Lingjie Duan","raw_affiliation_strings":["Engineering Systems and Design Pillar, Singapore University of Technology and Design, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Engineering Systems and Design Pillar, Singapore University of Technology and Design, Singapore","institution_ids":["https://openalex.org/I152815399"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8946,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.96311491,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9998999834060669,"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.9998999834060669,"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.996999979019165,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7789900302886963},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6023709177970886},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.5993777513504028},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.503731906414032},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4945044219493866},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4847976267337799},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.47306859493255615},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.46852347254753113},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.4437049329280853},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43261459469795227},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.42725133895874023},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41442203521728516},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.38991695642471313},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.33156684041023254},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32837170362472534},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14818713068962097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14754030108451843},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13406920433044434}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7789900302886963},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6023709177970886},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.5993777513504028},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.503731906414032},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4945044219493866},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4847976267337799},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.47306859493255615},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46852347254753113},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.4437049329280853},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43261459469795227},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.42725133895874023},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41442203521728516},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.38991695642471313},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.33156684041023254},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32837170362472534},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14818713068962097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14754030108451843},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13406920433044434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"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/C136264566","wikidata":"https://www.wikidata.org/wiki/Q159810","display_name":"Economy","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom42002.2020.9322226","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom42002.2020.9322226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.550000011920929,"display_name":"Partnerships for the goals"}],"awards":[{"id":"https://openalex.org/G1484860470","display_name":null,"funder_award_id":"CZT20027","funder_id":"https://openalex.org/F4320323209","funder_display_name":"South-Central University of Nationalities"},{"id":"https://openalex.org/G1761249070","display_name":null,"funder_award_id":"CZT19010","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"},{"id":"https://openalex.org/G4723305082","display_name":null,"funder_award_id":"61902437","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7504064280","display_name":null,"funder_award_id":"YZZ18006","funder_id":"https://openalex.org/F4320323209","funder_display_name":"South-Central University of Nationalities"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320323209","display_name":"South-Central University of Nationalities","ror":"https://ror.org/03d7sax13"},{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1974757757","https://openalex.org/W2077831477","https://openalex.org/W2428120229","https://openalex.org/W2803834024","https://openalex.org/W2903682059","https://openalex.org/W2962804513","https://openalex.org/W2963697941","https://openalex.org/W2990806882","https://openalex.org/W3022112171","https://openalex.org/W3037515790","https://openalex.org/W6765026408"],"related_works":["https://openalex.org/W4288714711","https://openalex.org/W3200708550","https://openalex.org/W2736680465","https://openalex.org/W2771637876","https://openalex.org/W4294093918","https://openalex.org/W4240853094","https://openalex.org/W2810496283","https://openalex.org/W2170656329","https://openalex.org/W3131977017","https://openalex.org/W3013845525"],"abstract_inverted_index":{"Unmanned":[0],"Aerial":[1],"Vehicle":[2],"(UAV)":[3],"technology":[4],"is":[5,46,76,82,164,245,274],"a":[6,27,93,129,207],"promising":[7],"solution":[8],"for":[9,41,48,56,96,200],"providing":[10],"high-quality":[11],"mobile":[12],"services":[13],"(e.g.,":[14,39],"edge":[15],"computing,":[16],"fast":[17,183],"Internet":[18],"connection,":[19],"and":[20,60,87,106,163,177,197],"local":[21],"caching)":[22],"to":[23,51,62,68,85,118,121,166,175,190,247,256,267,276],"ground":[24],"users,":[25,59],"where":[26],"UAV":[28,94],"with":[29,53,102,139,154,188,228],"limited":[30],"service":[31],"coverage":[32],"travels":[33],"among":[34],"multiple":[35],"geographical":[36],"user":[37,104,171,195,198],"locations":[38,101,196],"hotspots)":[40],"servicing":[42,57,98],"demands":[43,75],"locally.":[44],"It":[45],"necessary":[47],"different":[49,258],"UAVs":[50,142,212,255],"cooperate":[52],"each":[54,114,147],"other":[55,141],"many":[58,71,99,170],"how":[61],"determine":[63],"their":[64],"cooperative":[65,89],"path":[66],"planning":[67],"best":[69],"meet":[70],"users'":[72],"spatio-temporally":[73],"distributed":[74],"an":[77,179,224],"important":[78],"question.":[79],"This":[80],"paper":[81],"the":[83,110,124,140,144,155,192,202,215,241,250,277],"first":[84],"design":[86],"analyze":[88],"path-planning":[90],"algorithms":[91],"of":[92,182,194,211,253],"swarm":[95],"optimally":[97],"spatial":[100],"dynamic":[103,160,216],"arrivals":[105],"waiting":[107],"deadlines":[108],"in":[109,133,143,240],"time":[111,185],"horizon.":[112],"For":[113,146],"UAV,":[115],"it":[116,158],"needs":[117],"decide":[119],"whether":[120],"wait":[122],"at":[123],"current":[125],"location":[126],"or":[127],"chase":[128],"newly":[130],"released":[131],"demand":[132],"another":[134],"location,":[135],"under":[136],"upper":[137],"coordination":[138],"swarm.":[145],"UAV's":[148,203],"routing":[149],"problem":[150],"even":[151],"without":[152],"coordinating":[153],"rest":[156],"UAVs,":[157],"follows":[159],"programming":[161,217],"structure":[162],"difficult":[165],"solve":[167],"directly":[168],"given":[169],"demands.":[172],"We":[173],"manage":[174],"simplify":[176],"propose":[178],"optimal":[180,204],"algorithm":[181,227],"computation":[184],"(only":[186],"polynomial":[187],"respect":[189],"both":[191],"numbers":[193],"demands)":[199],"returning":[201],"path-planning.":[205],"When":[206],"large":[208],"number":[209],"|K|":[210],"are":[213],"coordinating,":[214],"simplification":[218],"becomes":[219],"intractable.":[220],"Alternatively,":[221],"we":[222,263],"present":[223],"iterative":[225],"cooperation":[226],"approximation":[229],"ratio":[230],"1":[231],"-":[232,234],"(1":[233],"1/|K|":[235],")":[236],"<sup":[237],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[238],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">|K|</sup>":[239],"worst":[242],"case,":[243],"which":[244],"proved":[246],"obviously":[248],"outperform":[249],"traditional":[251],"idea":[252],"partitioning":[254],"serve":[257],"user/location":[259],"clusters":[260],"separately.":[261],"Finally,":[262],"conduct":[264],"simulation":[265],"experiments":[266],"show":[268],"that":[269],"our":[270],"algorithm's":[271],"average":[272],"performance":[273],"close":[275],"optimum.":[278]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
