{"id":"https://openalex.org/W3011231347","doi":"https://doi.org/10.1109/access.2020.2980203","title":"Path Planning for UAV to Cover Multiple Separated Convex Polygonal Regions","display_name":"Path Planning for UAV to Cover Multiple Separated Convex Polygonal Regions","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3011231347","doi":"https://doi.org/10.1109/access.2020.2980203","mag":"3011231347"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.2980203","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.2980203","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09032151.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09032151.pdf","any_repository_has_fulltext":true},"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, 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, USA","institution_ids":["https://openalex.org/I26538001"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019550547","display_name":"Luis Rodolfo Garc\u00eda Carrillo","orcid":"https://orcid.org/0000-0003-0713-512X"},"institutions":[{"id":"https://openalex.org/I96749437","display_name":"Texas A&M University \u2013 Corpus Christi","ror":"https://ror.org/01mrfdz82","country_code":"US","type":"education","lineage":["https://openalex.org/I96749437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Luis Rodolfo Garcia Carrillo","raw_affiliation_strings":["Department of Engineering, Texas A&M University\u2013Corpus Christi, Corpus Christi, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Engineering, Texas A&M University\u2013Corpus Christi, Corpus Christi, USA","institution_ids":["https://openalex.org/I96749437"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101734363","display_name":"Lei Jin","orcid":"https://orcid.org/0000-0002-8025-3395"},"institutions":[{"id":"https://openalex.org/I96749437","display_name":"Texas A&M University \u2013 Corpus Christi","ror":"https://ror.org/01mrfdz82","country_code":"US","type":"education","lineage":["https://openalex.org/I96749437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lei Jin","raw_affiliation_strings":["Department of Mathematics and Statistics, Texas A&M University\u2013Corpus Christi, Corpus Christi, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Texas A&M University\u2013Corpus Christi, Corpus Christi, USA","institution_ids":["https://openalex.org/I96749437"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":4.8874,"has_fulltext":true,"cited_by_count":94,"citation_normalized_percentile":{"value":0.96230633,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"8","issue":null,"first_page":"51770","last_page":"51785"},"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.9983999729156494,"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.9948999881744385,"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.6959367394447327},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.694500207901001},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6856683492660522},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6826226711273193},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6071776151657104},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5821744203567505},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5765615105628967},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5480960011482239},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.45200225710868835},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44148486852645874},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.43257153034210205},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21595874428749084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18673118948936462},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14975976943969727},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.13614940643310547},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07002130150794983}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6959367394447327},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.694500207901001},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6856683492660522},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6826226711273193},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6071776151657104},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5821744203567505},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5765615105628967},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5480960011482239},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.45200225710868835},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44148486852645874},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.43257153034210205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21595874428749084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18673118948936462},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14975976943969727},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.13614940643310547},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07002130150794983},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"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.1109/access.2020.2980203","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.2980203","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09032151.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:6945ff3bc19643519fc37098eb1e2d7a","is_oa":true,"landing_page_url":"https://doaj.org/article/6945ff3bc19643519fc37098eb1e2d7a","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 8, Pp 51770-51785 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2020.2980203","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.2980203","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09032151.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Zero hunger","id":"https://metadata.un.org/sdg/2","score":0.5099999904632568}],"awards":[{"id":"https://openalex.org/G3034797704","display_name":"MULTI-AGENT NETWORK CONTROL - A BRAIN EMOTIONAL LEARNING-INSPIRED APPROACH","funder_award_id":"W911NF1810210","funder_id":"https://openalex.org/F4320306078","funder_display_name":"U.S. Department of Defense"},{"id":"https://openalex.org/G5909035826","display_name":null,"funder_award_id":"CI-1953048","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"},{"id":"https://openalex.org/G6968696895","display_name":"CI-New: Collaborative Research: Developing an Open Networked Airborne Computing Platform","funder_award_id":"1730589","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7190702502","display_name":null,"funder_award_id":"CI-1953048/1730589","funder_id":"https://openalex.org/F4320335353","funder_display_name":"National Science Foundation of Sri Lanka"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306078","display_name":"U.S. Department of Defense","ror":"https://ror.org/0447fe631"},{"id":"https://openalex.org/F4320309507","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42"},{"id":"https://openalex.org/F4320335353","display_name":"National Science Foundation of Sri Lanka","ror":"https://ror.org/010xaa060"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3011231347.pdf","grobid_xml":"https://content.openalex.org/works/W3011231347.grobid-xml"},"referenced_works_count":82,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W140238390","https://openalex.org/W187767610","https://openalex.org/W307896644","https://openalex.org/W626292722","https://openalex.org/W1482722110","https://openalex.org/W1535557537","https://openalex.org/W1544032329","https://openalex.org/W1561418801","https://openalex.org/W1573676079","https://openalex.org/W1590932131","https://openalex.org/W1626619708","https://openalex.org/W1884989760","https://openalex.org/W1971086298","https://openalex.org/W1971483538","https://openalex.org/W1995235889","https://openalex.org/W2017708378","https://openalex.org/W2018691209","https://openalex.org/W2019738489","https://openalex.org/W2029242918","https://openalex.org/W2029681015","https://openalex.org/W2033052486","https://openalex.org/W2037332764","https://openalex.org/W2037455079","https://openalex.org/W2038849901","https://openalex.org/W2040678783","https://openalex.org/W2044493395","https://openalex.org/W2050819731","https://openalex.org/W2054083850","https://openalex.org/W2055207897","https://openalex.org/W2055942436","https://openalex.org/W2057657969","https://openalex.org/W2058937865","https://openalex.org/W2066086285","https://openalex.org/W2077831477","https://openalex.org/W2086364863","https://openalex.org/W2089344586","https://openalex.org/W2093894544","https://openalex.org/W2099144379","https://openalex.org/W2101997841","https://openalex.org/W2121866178","https://openalex.org/W2123241324","https://openalex.org/W2124086491","https://openalex.org/W2124993036","https://openalex.org/W2135149549","https://openalex.org/W2135709143","https://openalex.org/W2137363349","https://openalex.org/W2159017378","https://openalex.org/W2159570978","https://openalex.org/W2161373934","https://openalex.org/W2161754147","https://openalex.org/W2171266831","https://openalex.org/W2283031475","https://openalex.org/W2399100674","https://openalex.org/W2434797109","https://openalex.org/W2471190594","https://openalex.org/W2530592706","https://openalex.org/W2543580944","https://openalex.org/W2557741120","https://openalex.org/W2608726595","https://openalex.org/W2743148411","https://openalex.org/W2792125179","https://openalex.org/W2800263833","https://openalex.org/W2811185140","https://openalex.org/W2891973815","https://openalex.org/W2909399037","https://openalex.org/W2944573081","https://openalex.org/W2980995577","https://openalex.org/W2981880765","https://openalex.org/W3010084146","https://openalex.org/W3023768696","https://openalex.org/W3118260104","https://openalex.org/W4210339101","https://openalex.org/W4230268831","https://openalex.org/W4293682399","https://openalex.org/W6605705772","https://openalex.org/W6607571859","https://openalex.org/W6628973536","https://openalex.org/W6684051851","https://openalex.org/W6684055839","https://openalex.org/W6729319880","https://openalex.org/W6730308440"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W4297427155","https://openalex.org/W3025823153","https://openalex.org/W3136451934","https://openalex.org/W3200006077","https://openalex.org/W2975368677","https://openalex.org/W2170228269","https://openalex.org/W2011675579"],"abstract_inverted_index":{"In":[0,90,102],"many":[1],"unmanned":[2],"aerial":[3],"vehicle":[4],"(UAV)":[5],"applications":[6],"such":[7],"as":[8,65],"land":[9],"assessment,":[10],"search":[11],"and":[12,14,74,116,157,173,180],"rescue,":[13],"precision":[15],"agriculture,":[16],"UAVs":[17],"are":[18],"often":[19],"required":[20],"to":[21,37,44,138],"survey":[22],"multiple":[23],"spatially":[24],"distributed":[25],"regions.":[26,48],"To":[27],"perform":[28],"these":[29],"applications,":[30],"one":[31],"of":[32,68,182],"the":[33,39,42,59,69,75,88,99,140,153,178,183],"key":[34],"steps":[35],"is":[36],"plan":[38],"path":[40,51,77],"for":[41,112,122],"UAV":[43],"quickly":[45],"cover":[46],"all":[47],"The":[49],"new":[50,114],"planning":[52,78],"problem":[53,72],"explored":[54],"here,":[55],"which":[56,81],"we":[57,93,104,133,176],"call":[58],"TSP-CPP":[60,100,141],"problem,":[61,80,115,142],"can":[62,151,163],"be":[63],"viewed":[64],"an":[66],"integration":[67],"traveling":[70],"salesman":[71],"(TSP)":[73],"coverage":[76],"(CPP)":[79],"has":[82],"not":[83],"been":[84],"well":[85],"studied":[86],"in":[87],"literature.":[89],"this":[91,113,131],"paper,":[92],"conduct":[94],"a":[95,107,119,124,145,159],"systematic":[96],"investigation":[97],"on":[98,130],"problem.":[101],"particular,":[103],"first":[105],"provide":[106],"mixed":[108],"integer":[109],"programming":[110],"formulation":[111],"then":[117,134],"introduce":[118],"CPP":[120],"method":[121],"covering":[123],"single":[125],"convex":[126],"polygonal":[127],"region.":[128],"Based":[129],"method,":[132],"develop":[135],"two":[136],"approaches":[137],"solve":[139],"including":[143],"1)":[144],"dynamic":[146],"programming-based":[147],"exact":[148],"approach":[149,161],"that":[150,162],"find":[152],"(near)":[154],"optimal":[155],"tour,":[156],"2)":[158],"heuristic":[160],"generate":[164],"high-quality":[165],"tours":[166],"very":[167],"efficiently.":[168],"Through":[169],"comprehensive":[170],"theoretical":[171],"analyses":[172],"simulation":[174],"studies,":[175],"demonstrate":[177],"optimality":[179],"efficiency":[181],"proposed":[184],"approaches.":[185]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":24},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":18},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":5}],"updated_date":"2026-07-14T08:27:34.040176","created_date":"2025-10-10T00:00:00"}