{"id":"https://openalex.org/W4297799136","doi":"https://doi.org/10.1109/tits.2022.3160402","title":"Multiregional Coverage Path Planning for Multiple Energy Constrained UAVs","display_name":"Multiregional Coverage Path Planning for Multiple Energy Constrained UAVs","publication_year":2022,"publication_date":"2022-03-28","ids":{"openalex":"https://openalex.org/W4297799136","doi":"https://doi.org/10.1109/tits.2022.3160402"},"language":"en","primary_location":{"id":"doi:10.1109/tits.2022.3160402","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2022.3160402","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-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/A5063416695","display_name":"Junfei Xie","orcid":"https://orcid.org/0000-0001-7406-3221"},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Junfei Xie","raw_affiliation_strings":["Department of Electrical and Computer Engineering, San Diego State University, San Diego, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-7406-3221","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, San Diego State University, San Diego, CA, USA","institution_ids":["https://openalex.org/I26538001"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100450156","display_name":"Jun Chen","orcid":"https://orcid.org/0000-0001-9896-6898"},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jun Chen","raw_affiliation_strings":["Department of Aerospace Engineering, San Diego State University, San Diego, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9896-6898","affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, San Diego State University, San Diego, CA, USA","institution_ids":["https://openalex.org/I26538001"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I26538001"],"apc_list":null,"apc_paid":null,"fwci":5.7475,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.97513295,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"23","issue":"10","first_page":"17366","last_page":"17381"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9958999752998352,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7499811053276062},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7361946702003479},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6463019847869873},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5606536865234375},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5598996877670288},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.49844789505004883},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4802725315093994},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.46072036027908325},{"id":"https://openalex.org/keywords/search-and-rescue","display_name":"Search and rescue","score":0.4549337327480316},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.4144875109195709},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.32636868953704834},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.17651572823524475},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15428254008293152},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14665895700454712},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12865135073661804},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1208861768245697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11778631806373596},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07335838675498962}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7499811053276062},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7361946702003479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6463019847869873},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5606536865234375},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5598996877670288},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.49844789505004883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4802725315093994},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.46072036027908325},{"id":"https://openalex.org/C2775935494","wikidata":"https://www.wikidata.org/wiki/Q741964","display_name":"Search and rescue","level":3,"score":0.4549337327480316},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.4144875109195709},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.32636868953704834},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17651572823524475},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15428254008293152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14665895700454712},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12865135073661804},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1208861768245697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11778631806373596},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07335838675498962},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tits.2022.3160402","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2022.3160402","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"display_name":"Climate action","id":"https://metadata.un.org/sdg/13"}],"awards":[{"id":"https://openalex.org/G5313193059","display_name":"CAREER: Towards Networked Airborne Computing in Uncertain Airspace: A  Control and Networking Facilitated Distributed Computing Framework","funder_award_id":"2048266","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6114365225","display_name":"CI-New: Collaborative Research: Developing an Open Networked Airborne Computing Platform","funder_award_id":"1953048","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309507","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":65,"referenced_works":["https://openalex.org/W84048113","https://openalex.org/W215447973","https://openalex.org/W1524742142","https://openalex.org/W1544032329","https://openalex.org/W1595882479","https://openalex.org/W1601649239","https://openalex.org/W1964196426","https://openalex.org/W1968594877","https://openalex.org/W1972645701","https://openalex.org/W1981700549","https://openalex.org/W1989432959","https://openalex.org/W1994649922","https://openalex.org/W1997193586","https://openalex.org/W2002730737","https://openalex.org/W2018960578","https://openalex.org/W2019738489","https://openalex.org/W2026167187","https://openalex.org/W2029681015","https://openalex.org/W2036573713","https://openalex.org/W2038583281","https://openalex.org/W2046419297","https://openalex.org/W2050819731","https://openalex.org/W2051369225","https://openalex.org/W2057025928","https://openalex.org/W2058892401","https://openalex.org/W2063472265","https://openalex.org/W2063605597","https://openalex.org/W2068840184","https://openalex.org/W2074136911","https://openalex.org/W2091669670","https://openalex.org/W2099114258","https://openalex.org/W2105848344","https://openalex.org/W2110362031","https://openalex.org/W2110368321","https://openalex.org/W2112094258","https://openalex.org/W2115772460","https://openalex.org/W2123241324","https://openalex.org/W2124086491","https://openalex.org/W2125334953","https://openalex.org/W2127577732","https://openalex.org/W2135149549","https://openalex.org/W2135201914","https://openalex.org/W2137363349","https://openalex.org/W2142473881","https://openalex.org/W2157331354","https://openalex.org/W2167861360","https://openalex.org/W2323709497","https://openalex.org/W2341256628","https://openalex.org/W2530592706","https://openalex.org/W2742700879","https://openalex.org/W2788813553","https://openalex.org/W2803857097","https://openalex.org/W2811185140","https://openalex.org/W2891973815","https://openalex.org/W2906764419","https://openalex.org/W2909399037","https://openalex.org/W2944433607","https://openalex.org/W2947008563","https://openalex.org/W3011231347","https://openalex.org/W3015527528","https://openalex.org/W3022347166","https://openalex.org/W3023540311","https://openalex.org/W3100079971","https://openalex.org/W6603440596","https://openalex.org/W6752062530"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W2153702122","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153"],"abstract_inverted_index":{"In":[0,114],"recent":[1],"years,":[2],"we":[3,105,117,137],"have":[4,106],"witnessed":[5],"a":[6,15,54,65,92,111,142,155],"growing":[7],"use":[8],"of":[9,17,94,110,180,186],"unmanned":[10],"aerial":[11],"vehicles":[12],"(UAVs)":[13],"in":[14,72,184],"variety":[16],"civil,":[18],"commercial":[19],"and":[20,45,153,173,188],"military":[21],"applications.":[22],"Among":[23],"these":[24],"applications,":[25,50],"many":[26],"require":[27],"the":[28,58,73,95,108,177,181],"UAVs":[29,126],"to":[30,122],"scan":[31],"or":[32,35],"survey":[33],"one":[34],"more":[36],"regions,":[37],"such":[38,49],"as":[39,91],"land":[40],"monitoring,":[41],"disaster":[42],"assessment,":[43],"search":[44],"rescue.":[46],"To":[47,130],"realize":[48],"path":[51,60,134],"planning":[52,61,135],"is":[53],"key":[55],"step.":[56],"Although":[57],"coverage":[59],"(CPP)":[62],"problem":[63,87,99],"for":[64,76],"single":[66,112],"region":[67],"has":[68,79],"been":[69],"extensively":[70],"studied":[71,107],"literature,":[74],"CPP":[75,86],"multiple":[77,125],"regions":[78],"gained":[80],"much":[81],"less":[82],"attention.":[83],"This":[84],"multi-regional":[85],"can":[88,148,162],"be":[89],"considered":[90],"variant":[93],"(multiple)":[96],"traveling":[97],"salesman":[98],"(TSP)":[100],"enhanced":[101],"with":[102,127],"CPP.":[103],"Previously,":[104],"case":[109],"UAV.":[113],"this":[115,132],"paper,":[116],"extend":[118],"our":[119],"previous":[120],"studies":[121],"further":[123],"consider":[124],"energy":[128],"constraints.":[129],"solve":[131,163],"new":[133],"problem,":[136],"develop":[138],"two":[139],"approaches:":[140],"1)":[141],"branch-and-bound":[143],"(BnB)":[144],"based":[145,159],"approach":[146,160],"that":[147,161],"find":[149],"(near)":[150],"optimal":[151],"tours":[152],"2)":[154],"genetic":[156],"algorithm":[157],"(GA)":[158],"large-scale":[164],"problems":[165],"efficiently":[166],"under":[167],"different":[168],"objectives.":[169],"Comprehensive":[170],"theoretical":[171],"analyses":[172],"computational":[174],"experiments":[175],"demonstrate":[176],"promising":[178],"performance":[179],"proposed":[182],"approaches":[183],"terms":[185],"optimality":[187],"efficiency.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":13},{"year":2025,"cited_by_count":35},{"year":2024,"cited_by_count":20},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":3}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}