{"id":"https://openalex.org/W7124436613","doi":"https://doi.org/10.1109/taes.2026.3652988","title":"A Mixed-Integer Convex Optimization-Based Approach for Hybrid UAV Path Planning in Noise-Restricted Zones","display_name":"A Mixed-Integer Convex Optimization-Based Approach for Hybrid UAV Path Planning in Noise-Restricted Zones","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7124436613","doi":"https://doi.org/10.1109/taes.2026.3652988"},"language":null,"primary_location":{"id":"doi:10.1109/taes.2026.3652988","is_oa":false,"landing_page_url":"https://doi.org/10.1109/taes.2026.3652988","pdf_url":null,"source":{"id":"https://openalex.org/S193624734","display_name":"IEEE Transactions on Aerospace and Electronic Systems","issn_l":"0018-9251","issn":["0018-9251","1557-9603","2371-9877"],"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 Aerospace and Electronic 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/A5123202971","display_name":"Saurabh Belgaonkar","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Saurabh Belgaonkar","raw_affiliation_strings":["Mechanical Engineering Department, Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Mechanical Engineering Department, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063616340","display_name":"Deepak Prakash Kumar","orcid":"https://orcid.org/0000-0001-6446-2077"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Deepak Prakash Kumar","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Irvine, Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Irvine, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Sivakumar Rathinam","orcid":"https://orcid.org/0000-0002-9223-7456"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sivakumar Rathinam","raw_affiliation_strings":["Computer Science and Engineering Department, Mechanical Engineering Department, Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, Mechanical Engineering Department, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105985471","display_name":"Swaroop Darbha","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Swaroop Darbha","raw_affiliation_strings":["Mechanical Engineering Department, Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Mechanical Engineering Department, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072710973","display_name":"Trevor Bihl","orcid":"https://orcid.org/0000-0003-2431-2749"},"institutions":[{"id":"https://openalex.org/I1280414376","display_name":"United States Air Force Research Laboratory","ror":"https://ror.org/02e2egq70","country_code":"US","type":"facility","lineage":["https://openalex.org/I1280414376","https://openalex.org/I1330347796","https://openalex.org/I4210102105","https://openalex.org/I4389425425"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Trevor Bihl","raw_affiliation_strings":["Air Force Research Laboratory (AFRL), Dayton, OH, USA"],"affiliations":[{"raw_affiliation_string":"Air Force Research Laboratory (AFRL), Dayton, OH, USA","institution_ids":["https://openalex.org/I1280414376"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5123202971"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10994307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"62","issue":null,"first_page":"3536","last_page":"3551"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.5149000287055969,"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.5149000287055969,"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/T11133","display_name":"UAV Applications and Optimization","score":0.22619999945163727,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0357000008225441,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5644999742507935},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5192000269889832},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4982999861240387},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.44780001044273376},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4357999861240387},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42989999055862427},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.4099000096321106},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.3817000091075897},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.35190001130104065}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6553000211715698},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5644999742507935},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5192000269889832},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4982999861240387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48649999499320984},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.44780001044273376},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4357999861240387},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42989999055862427},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.4099000096321106},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.3817000091075897},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.35190001130104065},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3061999976634979},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.27799999713897705},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C1034443","wikidata":"https://www.wikidata.org/wiki/Q2583685","display_name":"Propulsion","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27059999108314514},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.2565000057220459},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/taes.2026.3652988","is_oa":false,"landing_page_url":"https://doi.org/10.1109/taes.2026.3652988","pdf_url":null,"source":{"id":"https://openalex.org/S193624734","display_name":"IEEE Transactions on Aerospace and Electronic Systems","issn_l":"0018-9251","issn":["0018-9251","1557-9603","2371-9877"],"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 Aerospace and Electronic Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.9068024158477783,"display_name":"Affordable and clean energy"}],"awards":[{"id":"https://openalex.org/G4476264382","display_name":null,"funder_award_id":"APRS-RYA-2025-05-00001","funder_id":"https://openalex.org/F4320338294","funder_display_name":"Air Force Research Laboratory"}],"funders":[{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1517470327","https://openalex.org/W1904799423","https://openalex.org/W1967005434","https://openalex.org/W1997098460","https://openalex.org/W2112271657","https://openalex.org/W2117829256","https://openalex.org/W2139059344","https://openalex.org/W2159524963","https://openalex.org/W2479723776","https://openalex.org/W2923307172","https://openalex.org/W2979440009","https://openalex.org/W3097484703","https://openalex.org/W3123076862","https://openalex.org/W3172683300","https://openalex.org/W3210448484","https://openalex.org/W4221056548","https://openalex.org/W4282970004","https://openalex.org/W4283454281","https://openalex.org/W4285821434","https://openalex.org/W4294690771","https://openalex.org/W4311625877","https://openalex.org/W4384831806","https://openalex.org/W4386851522","https://openalex.org/W4400975375","https://openalex.org/W4403977848","https://openalex.org/W4404102566","https://openalex.org/W4408171592"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"integrated":[4],"approach":[5,191,205],"for":[6,151],"efficient":[7],"path":[8,81],"planning":[9],"and":[10,66,145,156,169,176,219],"energy":[11],"management":[12],"in":[13,28,133,148,225,258],"hybrid":[14],"unmanned":[15],"aerial":[16],"vehicles":[17],"(HUAVs)":[18],"equipped":[19],"with":[20,227],"dual":[21],"fuel-electric":[22],"propulsion":[23],"systems.":[24],"These":[25],"HUAVs":[26],"operate":[27],"environments":[29,226],"that":[30,284],"include":[31],"noise-restricted":[32],"zones,":[33,38,229],"referred":[34],"to":[35,142,206,213,221,240,269],"as":[36,92],"quiet":[37,61,228],"where":[39],"only":[40],"electric":[41],"mode":[42],"is":[43,255,267],"permitted.":[44],"We":[45,88,201,236],"address":[46],"the":[47,51,57,60,72,79,116,153,157,162,166,170,177,184,189,195,208,211,242,246,261,271,276,285,294],"problem":[48,73,91],"by":[49,114],"parameterizing":[50],"position":[52],"of":[53,59,77,85,197,210,217,249,293],"a":[54,67,75,83,93,107,130,137,143,215,231,289],"point":[55],"along":[56],"side":[58],"zone":[62],"using":[63,103],"its":[64,222],"endpoints":[65],"scalar":[68],"parameter,":[69],"which":[70,98],"transforms":[71],"into":[74],"variant":[76],"finding":[78],"shortest":[80],"over":[82,125,136],"graph":[84],"convex":[86,95],"sets.":[87],"formulate":[89],"this":[90],"mixed-integer":[94],"program":[96],"(MICP),":[97],"can":[99,111],"be":[100,112,270],"efficiently":[101],"solved":[102],"commercial":[104],"solvers.":[105],"Additionally,":[106],"tight":[108],"lower":[109,154,171,182],"bound":[110,155,172],"obtained":[113,187],"relaxing":[115],"path-selection":[117],"variable.":[118],"Through":[119],"extensive":[120],"computations":[121],"across":[122],"200":[123],"instances":[124],"four":[126],"maps,":[127],"we":[128],"show":[129],"substantial":[131],"improvement":[132],"computational":[134,303],"efficiency":[135],"state-of-the-art":[138,190],"method,":[139],"achieving":[140],"up":[141],"100-fold":[144],"10-fold":[146],"decrease":[147],"computation":[149],"time":[150],"calculating":[152],"exact":[158,167,178],"solution,":[159],"respectively.":[160],"Moreover,":[161],"average":[163,298],"gap":[164],"between":[165],"cost":[168,179,290],"was":[173,180],"approximately":[174],"0.24%,":[175],"1.05%":[181],"than":[183],"feasible":[185],"solution":[186],"from":[188],"on":[192,297],"average,":[193],"highlighting":[194],"effectiveness":[196],"our":[198,204],"proposed":[199],"method.":[200],"also":[202],"extend":[203],"plan":[207],"route":[209],"HUAV":[212,277],"visit":[214],"set":[216],"targets":[218],"return":[220],"starting":[223],"location":[224],"yielding":[230],"Traveling":[232],"Salesman":[233],"Problem":[234],"(TSP).":[235],"employ":[237],"two":[238],"methodologies":[239],"solve":[241],"TSP:":[243],"one":[244],"wherein":[245],"battery's":[247,262],"State":[248],"charge":[250],"(SOC)":[251],"at":[252,264],"each":[253,265],"target":[254,266],"discretized,":[256],"whereas,":[257],"another":[259],"approach,":[260],"SOC":[263],"assumed":[268],"minimum":[272],"allowable":[273],"level":[274],"when":[275],"departs":[278],"it.":[279],"A":[280],"comparative":[281],"analysis":[282],"reveals":[283],"second":[286],"method":[287,296],"achieves":[288],"within":[291],"1.02%":[292],"first":[295],"while":[299],"requiring":[300],"significantly":[301],"less":[302],"time.":[304]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-01-17T00:00:00"}