{"id":"https://openalex.org/W4292971265","doi":"https://doi.org/10.1109/tmc.2022.3200732","title":"Completion Time Minimization for UAV-Enabled Surveillance Over Multiple Restricted Regions","display_name":"Completion Time Minimization for UAV-Enabled Surveillance Over Multiple Restricted Regions","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4292971265","doi":"https://doi.org/10.1109/tmc.2022.3200732"},"language":"en","primary_location":{"id":"doi:10.1109/tmc.2022.3200732","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2022.3200732","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Mobile Computing","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/A5081476675","display_name":"Hsiang-Chun Tsai","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hsiang-Chun Tsai","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009791512","display_name":"Y.-W. Peter Hong","orcid":"https://orcid.org/0000-0001-7043-8276"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Y.-W. Peter Hong","raw_affiliation_strings":["Institute of Communications Engineering, National Tsing Hua University, Taiwan"],"raw_orcid":"https://orcid.org/0000-0001-7043-8276","affiliations":[{"raw_affiliation_string":"Institute of Communications Engineering, National Tsing Hua University, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033727760","display_name":"Jang\u2010Ping Sheu","orcid":"https://orcid.org/0000-0001-7688-5085"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jang-Ping Sheu","raw_affiliation_strings":["Department of Computer Science and the Institute of Communications Engineering, National Tsing Hua University, Taiwan"],"raw_orcid":"https://orcid.org/0000-0001-7688-5085","affiliations":[{"raw_affiliation_string":"Department of Computer Science and the Institute of Communications Engineering, National Tsing Hua University, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":null,"apc_paid":null,"fwci":11.8082,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.9791492,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":1.0,"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":1.0,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9973999857902527,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9926999807357788,"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.8068240880966187},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6406933665275574},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6184157133102417},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5856325626373291},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5320430994033813},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.48286062479019165},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4600830376148224},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4596315324306488},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.451959490776062},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4501417279243469},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4496975541114807},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3740569055080414},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3331618309020996},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.12925857305526733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1280665397644043},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11921685934066772}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8068240880966187},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6406933665275574},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6184157133102417},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5856325626373291},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5320430994033813},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.48286062479019165},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4600830376148224},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4596315324306488},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.451959490776062},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4501417279243469},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4496975541114807},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3740569055080414},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3331618309020996},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.12925857305526733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1280665397644043},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11921685934066772},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tmc.2022.3200732","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2022.3200732","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Mobile Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1968594877","https://openalex.org/W2586992378","https://openalex.org/W2604830243","https://openalex.org/W2804397006","https://openalex.org/W2898733141","https://openalex.org/W2907916537","https://openalex.org/W2931820896","https://openalex.org/W2961899294","https://openalex.org/W2962259706","https://openalex.org/W2962691117","https://openalex.org/W2963177943","https://openalex.org/W2963555336","https://openalex.org/W2964018918","https://openalex.org/W2964209416","https://openalex.org/W2964236960","https://openalex.org/W2984604293","https://openalex.org/W2990270976","https://openalex.org/W2995497578","https://openalex.org/W3002346944","https://openalex.org/W3003169134","https://openalex.org/W3007761703","https://openalex.org/W3023439282","https://openalex.org/W3035330356","https://openalex.org/W3036053249","https://openalex.org/W3040199322","https://openalex.org/W3046016465","https://openalex.org/W3046106787","https://openalex.org/W3046145391","https://openalex.org/W3046147954","https://openalex.org/W3048655386","https://openalex.org/W3089865507","https://openalex.org/W3092218356","https://openalex.org/W3097896433","https://openalex.org/W3111412729","https://openalex.org/W3112582623","https://openalex.org/W3113498731","https://openalex.org/W3134592246","https://openalex.org/W3157174894","https://openalex.org/W3165903104","https://openalex.org/W3166018589","https://openalex.org/W3175727193","https://openalex.org/W4246219036","https://openalex.org/W6784175745"],"related_works":["https://openalex.org/W1496222301","https://openalex.org/W3207760230","https://openalex.org/W1590307681","https://openalex.org/W4312814274","https://openalex.org/W4285370786","https://openalex.org/W2296488620","https://openalex.org/W2358353312","https://openalex.org/W2353836703","https://openalex.org/W41015297","https://openalex.org/W4280645561"],"abstract_inverted_index":{"This":[0],"work":[1],"examines":[2],"a":[3,46,76,151],"UAV-enabled":[4],"surveillance":[5,44,141],"mission":[6,22],"over":[7,108],"multiple":[8],"restricted":[9,32,112,137],"regions":[10,33,90,113],"and":[11,102,185],"aims":[12],"to":[13,35,56,60,146,170,196],"determine":[14],"the":[15,21,31,43,48,53,61,65,85,89,97,105,109,118,144,148,166,172,182,191],"optimal":[16],"UAV":[17,26,49,106,145],"trajectory":[18,107],"that":[19,82,130,181],"minimizes":[20],"completion":[23,78,193],"time.":[24],"The":[25],"is":[27,68,159],"prohibited":[28],"from":[29],"entering":[30],"due":[34],"government":[36],"regulations":[37],"or":[38],"adversarial":[39],"concerns.":[40],"However,":[41],"during":[42],"of":[45,88,96,111,120],"region,":[47],"can":[50,188],"move":[51],"along":[52],"region's":[54],"boundary":[55],"reduce":[57,190],"its":[58],"distance":[59,168],"next":[62],"region":[63,138],"once":[64],"local":[66],"task":[67],"completed.":[69],"To":[70],"exploit":[71],"this":[72],"advantage,":[73],"we":[74,122],"propose":[75,124],"minimum":[77],"time":[79,194],"(MinTime)":[80],"algorithm":[81,129],"first":[83],"determines":[84],"visiting":[86],"order":[87],"by":[91,162],"employing":[92],"an":[93,125,135],"approximate":[94],"solution":[95,158],"traveling":[98],"salesman":[99],"problem":[100],"(TSP)":[101],"then":[103],"optimizes":[104],"sequence":[110],"using":[114],"dynamic":[115],"programming.":[116],"In":[117],"presence":[119],"obstacles,":[121],"further":[123],"obstacle-aware":[126],"MinTime":[127,184],"(OA-MinTime)":[128],"treats":[131],"each":[132,175],"obstacle":[133],"as":[134],"additional":[136,167],"with":[139],"zero":[140],"duration,":[142],"allowing":[143],"avoid":[147],"obstacles":[149,173],"in":[150],"more":[152],"efficient":[153],"manner.":[154],"A":[155],"modified":[156],"TSP":[157],"also":[160],"proposed":[161,183],"taking":[163],"into":[164],"consideration":[165],"required":[169],"circumvent":[171],"on":[174],"inter-POI":[176],"path.":[177],"Simulation":[178],"results":[179],"show":[180],"OA-MinTime":[186],"algorithms":[187],"significantly":[189],"total":[192],"compared":[195],"conventional":[197],"minimum-distance":[198],"approaches.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":7}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}