{"id":"https://openalex.org/W7225762023","doi":"https://doi.org/10.21203/rs.3.rs-11677459/v1","title":"Maximizing Detection Probability in UAV Search Missions using Random-Key Optimizers","display_name":"Maximizing Detection Probability in UAV Search Missions using Random-Key Optimizers","publication_year":2026,"publication_date":"2026-11-10","ids":{"openalex":"https://openalex.org/W7225762023","doi":"https://doi.org/10.21203/rs.3.rs-11677459/v1"},"language":"en","primary_location":{"id":"doi:10.21203/rs.3.rs-11677459/v1","doi":"https://doi.org/10.21203/rs.3.rs-11677459/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11677459/v1","pdf_url":"https://www.researchsquare.com/article/rs-11677459/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.researchsquare.com/article/rs-11677459/latest.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101055154","display_name":"Antonio Dantas","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I88273585","display_name":"Universidade Federal de S\u00e3o Paulo","ror":"https://ror.org/02k5swt12","country_code":"BR","type":"education","lineage":["https://openalex.org/I88273585"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Antonio Dantas","raw_affiliation_strings":["Universidade Federal de S\u00e3o Paulo"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal de S\u00e3o Paulo","institution_ids":["https://openalex.org/I88273585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121862146","display_name":"Elcio Shiguemori","orcid":"https://orcid.org/0000-0001-5226-0435","observed_orcids":["https://orcid.org/0000-0001-5226-0435"]},"institutions":[{"id":"https://openalex.org/I4210108684","display_name":"Instituto de Estudios Avanzados","ror":"https://ror.org/014apwk83","country_code":"VE","type":"government","lineage":["https://openalex.org/I4210108684"]},{"id":"https://openalex.org/I4403928426","display_name":"Instituto de Estudos Avan\u00e7ados da Universidade de S\u00e3o Paulo","ror":"https://ror.org/04t6wsp57","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374","https://openalex.org/I4403928426"]}],"countries":["BR","VE"],"is_corresponding":false,"raw_author_name":"Elcio Shiguemori","raw_affiliation_strings":["Instituto de Estudos Avan\u00e7ados"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Estudos Avan\u00e7ados","institution_ids":["https://openalex.org/I4210108684","https://openalex.org/I4403928426"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5161415204","display_name":"Antonio Chaves","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I88273585","display_name":"Universidade Federal de S\u00e3o Paulo","ror":"https://ror.org/02k5swt12","country_code":"BR","type":"education","lineage":["https://openalex.org/I88273585"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Antonio Chaves","raw_affiliation_strings":["Universidade Federal de S\u00e3o Paulo"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal de S\u00e3o Paulo","institution_ids":["https://openalex.org/I88273585"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.8833000063896179,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.8833000063896179,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.05640000104904175,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.042100001126527786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6858000159263611},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6571999788284302},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.654699981212616},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5684000253677368},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5504000186920166},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5429999828338623},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.499099999666214},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4438999891281128},{"id":"https://openalex.org/C2775935494","wikidata":"https://www.wikidata.org/wiki/Q741964","display_name":"Search and rescue","level":3,"score":0.43299999833106995},{"id":"https://openalex.org/C177769412","wikidata":"https://www.wikidata.org/wiki/Q278090","display_name":"Prior probability","level":3,"score":0.4237000048160553},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4221000075340271},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4162999987602234},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.35910001397132874},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3391000032424927},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.3257000148296356},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3206999897956848},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3059999942779541},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29030001163482666},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.25040000677108765},{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21203/rs.3.rs-11677459/v1","doi":"https://doi.org/10.21203/rs.3.rs-11677459/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11677459/v1","pdf_url":"https://www.researchsquare.com/article/rs-11677459/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.21203/rs.3.rs-11677459/v1","doi":"https://doi.org/10.21203/rs.3.rs-11677459/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11677459/v1","pdf_url":"https://www.researchsquare.com/article/rs-11677459/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225762023.pdf","grobid_xml":"https://content.openalex.org/works/W7225762023.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W4396601327"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"focuses":[3],"on":[4],"the":[5,39,54,61,108],"stochastic":[6],"and":[7,19,28,73,113,123],"real-time":[8],"constraints":[9],"of":[10,53,120],"Unmanned":[11],"Aerial":[12],"Vehicle":[13,56],"(UAV)":[14],"path":[15],"planning":[16,132],"in":[17,118,133,136],"Search":[18],"Rescue":[20],"(SAR)":[21],"missions.":[22],"We":[23],"introduce":[24],"a":[25,34,49,88,126],"configurable":[26],"data-driven":[27],"intelligent":[29,131],"routing":[30],"architecture":[31],"that":[32,107],"combines":[33],"closed-loop":[35],"probability":[36,71],"update":[37],"with":[38,99,115],"Random-Key":[40],"Optimizers":[41],"(RKO).":[42],"Our":[43],"problem":[44],"is":[45,111],"mathematically":[46],"modeled":[47],"as":[48,95,97,125],"dynamic":[50],"probabilistic":[51],"variant":[52],"Open":[55],"Routing":[57],"Problem":[58],"(OVRP),":[59],"enabling":[60],"solver":[62],"to":[63],"switch":[64],"adaptively":[65],"between":[66],"two":[67],"objectives,":[68],"thereby":[69],"balancing":[70],"maximization":[72],"resource":[74],"minimization.":[75],"The":[76],"framework":[77],"degrades":[78],"elegantly":[79],"under":[80,85],"noisy":[81],"priors":[82],"but":[83],"not":[84],"biased":[86,90],"ones:":[87],"systematically":[89],"map":[91],"performs":[92],"about":[93],"half":[94],"well":[96],"flying":[98],"no":[100],"prior":[101],"at":[102],"all.":[103],"Computational":[104],"tests":[105],"show":[106],"proposed":[109],"scheme":[110],"scalable":[112],"competitive":[114],"single-path":[116],"scenarios":[117],"terms":[119],"solution":[121],"performance":[122],"serves":[124],"strong":[127],"decision":[128],"guide":[129],"for":[130],"SAR":[134],"operations":[135],"unstable":[137],"environments.":[138]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2026-11-11T00:00:00"}