{"id":"https://openalex.org/W4399400258","doi":"https://doi.org/10.1109/tits.2024.3403887","title":"Joint Optimization of UAV Trajectory and Communication Resources With Complete Avoidance of No-Fly-Zones","display_name":"Joint Optimization of UAV Trajectory and Communication Resources With Complete Avoidance of No-Fly-Zones","publication_year":2024,"publication_date":"2024-06-04","ids":{"openalex":"https://openalex.org/W4399400258","doi":"https://doi.org/10.1109/tits.2024.3403887"},"language":"en","primary_location":{"id":"doi:10.1109/tits.2024.3403887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2024.3403887","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/A5090564661","display_name":"Kanghyun Heo","orcid":null},"institutions":[{"id":"https://openalex.org/I205490536","display_name":"Dongguk University","ror":"https://ror.org/057q6n778","country_code":"KR","type":"education","lineage":["https://openalex.org/I205490536"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kanghyun Heo","raw_affiliation_strings":["Department of Information and Communication Engineering, Dongguk University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Communication Engineering, Dongguk University, Seoul, South Korea","institution_ids":["https://openalex.org/I205490536"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069499207","display_name":"Gitae Park","orcid":"https://orcid.org/0000-0002-6212-5584"},"institutions":[{"id":"https://openalex.org/I205490536","display_name":"Dongguk University","ror":"https://ror.org/057q6n778","country_code":"KR","type":"education","lineage":["https://openalex.org/I205490536"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Gitae Park","raw_affiliation_strings":["Department of Information and Communication Engineering, Dongguk University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Communication Engineering, Dongguk University, Seoul, South Korea","institution_ids":["https://openalex.org/I205490536"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057269433","display_name":"Kisong Lee","orcid":"https://orcid.org/0000-0001-8206-4558"},"institutions":[{"id":"https://openalex.org/I205490536","display_name":"Dongguk University","ror":"https://ror.org/057q6n778","country_code":"KR","type":"education","lineage":["https://openalex.org/I205490536"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kisong Lee","raw_affiliation_strings":["Department of Information and Communication Engineering, Dongguk University, Seoul, South Korea"],"raw_orcid":"https://orcid.org/0000-0001-8206-4558","affiliations":[{"raw_affiliation_string":"Department of Information and Communication Engineering, Dongguk University, Seoul, South Korea","institution_ids":["https://openalex.org/I205490536"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I205490536"],"apc_list":null,"apc_paid":null,"fwci":13.9751,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.98313421,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"25","issue":"10","first_page":"14259","last_page":"14265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9991999864578247,"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.9991999864578247,"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.9897000193595886,"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.9805999994277954,"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/trajectory-optimization","display_name":"Trajectory optimization","score":0.7122390270233154},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.7103878259658813},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6290910243988037},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5861432552337646},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.5608110427856445},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5490059852600098},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5472956299781799},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.5286272764205933},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5144503116607666},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.45023804903030396},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.43332213163375854},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.35254019498825073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.251251757144928},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.18676882982254028},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09948140382766724},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.07341259717941284}],"concepts":[{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.7122390270233154},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.7103878259658813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6290910243988037},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5861432552337646},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.5608110427856445},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5490059852600098},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5472956299781799},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.5286272764205933},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5144503116607666},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.45023804903030396},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.43332213163375854},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.35254019498825073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.251251757144928},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.18676882982254028},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09948140382766724},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.07341259717941284},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tits.2024.3403887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2024.3403887","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":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2221524898","https://openalex.org/W2268751503","https://openalex.org/W2342656438","https://openalex.org/W2523219060","https://openalex.org/W2738731084","https://openalex.org/W2788350651","https://openalex.org/W2890112374","https://openalex.org/W2931820896","https://openalex.org/W2963061782","https://openalex.org/W2964023906","https://openalex.org/W3013032983","https://openalex.org/W3193975672","https://openalex.org/W4312694937"],"related_works":["https://openalex.org/W3101253900","https://openalex.org/W3153752017","https://openalex.org/W2133687134","https://openalex.org/W2347892399","https://openalex.org/W2997189060","https://openalex.org/W4395060245","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W3038596169","https://openalex.org/W345637666"],"abstract_inverted_index":{"In":[0,23],"this":[1],"paper,":[2],"we":[3,25,53,95],"explore":[4],"a":[5,27,151],"joint":[6],"optimization":[7,91,98],"of":[8,20,62,68],"unmanned":[9],"aerial":[10],"vehicle":[11],"(UAV)":[12],"trajectory":[13,42,67,128],"and":[14,66,107],"communication":[15],"resources":[16],"with":[17,43],"complete":[18],"avoidance":[19],"no-fly-zones":[21],"(NFZs).":[22],"particular,":[24],"introduce":[26],"new":[28],"constraint":[29,50,119,148],"that":[30,116],"allows":[31],"the":[32,39,48,57,63,69,73,84,89,108,117,126,133,141,145],"UAV":[33,70,86],"to":[34,55,71,156],"perfectly":[35],"avoid":[36],"NFZs":[37,121],"throughout":[38],"entire":[40,127],"continuous":[41],"rigorous":[44],"mathematical":[45],"proof.":[46],"Under":[47],"proposed":[49,118,134],"on":[51],"NFZs,":[52],"aim":[54],"optimize":[56],"scheduling,":[58],"transmit":[59],"power,":[60],"length":[61],"time":[64],"slot,":[65],"maximize":[72],"minimum":[74],"throughput":[75,139],"among":[76],"ground":[77],"nodes":[78],"without":[79],"violating":[80],"NFZs.":[81],"To":[82],"find":[83],"optimal":[85],"strategy":[87],"from":[88,122],"non-convex":[90],"problem":[92],"formulated":[93],"here,":[94],"use":[96],"various":[97],"techniques,":[99],"such":[100],"as":[101],"quadratic":[102],"transform,":[103],"successive":[104],"convex":[105],"approximation,":[106],"block":[109],"coordinate":[110],"descent":[111],"algorithm.":[112],"Simulation":[113],"results":[114],"confirm":[115],"prevents":[120],"being":[123],"violated":[124],"over":[125],"in":[129],"any":[130],"scenario.":[131],"Furthermore,":[132],"scheme":[135,143],"shows":[136],"significantly":[137],"higher":[138],"than":[140],"baseline":[142],"using":[144],"traditional":[146],"NFZ":[147,157],"by":[149],"achieving":[150],"zero":[152],"outage":[153],"probability":[154],"due":[155],"violations.":[158]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2024-06-07T00:00:00"}