{"id":"https://openalex.org/W7157258475","doi":"https://doi.org/10.48550/arxiv.2604.23327","title":"An Efficient Beam Search Algorithm for Active Perception in Mobile Robotics","display_name":"An Efficient Beam Search Algorithm for Active Perception in Mobile Robotics","publication_year":2026,"publication_date":"2026-04-25","ids":{"openalex":"https://openalex.org/W7157258475","doi":"https://doi.org/10.48550/arxiv.2604.23327"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.23327","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.23327","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103191650","display_name":"Kaixian Qu","orcid":"https://orcid.org/0009-0003-4998-5576"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qu, Kaixian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134806682","display_name":"Han Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Han","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041410798","display_name":"Victor Klemm","orcid":"https://orcid.org/0000-0002-6752-3397"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klemm, Victor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134779912","display_name":"Cesar Cadena","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cadena, Cesar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134794440","display_name":"Marco Hutter","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hutter, Marco","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.3815000057220459,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.3815000057220459,"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.2915000021457672,"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.03579999879002571,"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/scalability","display_name":"Scalability","score":0.6123999953269958},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.5680000185966492},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.5217000246047974},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46639999747276306},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45089998841285706},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4406999945640564},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43540000915527344},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.42399999499320984},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4230000078678131}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6123999953269958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.593500018119812},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5898000001907349},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.5680000185966492},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5217000246047974},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46639999747276306},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45089998841285706},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4406999945640564},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43540000915527344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4251999855041504},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.42399999499320984},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4230000078678131},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4090000092983246},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3950999975204468},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.38280001282691956},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.3765999972820282},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3472000062465668},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3400999903678894},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3400000035762787},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.33009999990463257},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3043999969959259},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C26760741","wikidata":"https://www.wikidata.org/wiki/Q160402","display_name":"Perception","level":2,"score":0.2994000017642975},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29840001463890076},{"id":"https://openalex.org/C2776010242","wikidata":"https://www.wikidata.org/wiki/Q4677575","display_name":"Active perception","level":3,"score":0.2924000024795532},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.2581999897956848}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.23327","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.23327","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Active":[0],"perception":[1,223],"is":[2,90,102],"a":[3,38,51,103,145,184,201],"fundamental":[4],"problem":[5,43],"in":[6,9,22,197,232,246],"autonomous":[7],"robotics":[8],"which":[10,109,164],"the":[11,26,74,82,121,150,155,160,178,215,240],"robot":[12],"must":[13],"decide":[14],"where":[15],"to":[16,20,24,92,115,171],"move":[17],"and":[18,95,135,168,194],"what":[19],"sense":[21],"order":[23],"obtain":[25],"most":[27],"informative":[28,47],"observations":[29],"for":[30],"accomplishing":[31],"its":[32],"mission.":[33],"Existing":[34],"approaches":[35],"either":[36],"solve":[37],"computationally":[39],"expensive":[40],"traveling":[41],"salesman":[42],"over":[44],"heuristically":[45],"selected":[46],"nodes,":[48],"or":[49,234],"adopt":[50],"more":[52,117,235],"efficient":[53],"but":[54],"overly":[55],"constrained":[56],"shortest":[57],"path":[58,156],"tree":[59],"formulation.":[60],"To":[61],"address":[62],"these":[63],"limitations,":[64],"we":[65,148],"explore":[66],"beam":[67,76,105,142],"search":[68,77,106],"algorithms":[69,227],"as":[70],"scalable":[71],"alternatives.":[72,173],"While":[73],"standard":[75],"provides":[78],"scalability":[79],"by":[80,228],"preserving":[81],"top-B":[83,111],"paths":[84],"at":[85,140,229],"each":[86],"depth":[87],"level,":[88],"it":[89],"prone":[91],"local":[93,203],"optima":[94],"exhibits":[96],"parameter":[97],"sensitivity.":[98],"Our":[99,174],"first":[100],"contribution":[101,176],"node-wise":[104],"(NBS)":[107],"algorithm,":[108],"maintains":[110,136],"candidates":[112],"per":[113],"node":[114],"enable":[116],"effective":[118],"exploration":[119,167],"of":[120,152],"solution":[122],"space.":[123],"Systematic":[124],"benchmarking":[125],"on":[126,242],"graphs":[127],"shows":[128],"that":[129,189,209],"NBS":[130,210],"consistently":[131],"outperforms":[132],"other":[133],"baselines":[134],"strong":[137],"performance":[138,217],"even":[139],"low":[141],"widths.":[143],"As":[144],"second":[146],"contribution,":[147],"integrate":[149],"concept":[151],"frontiers":[153],"into":[154],"selection":[157],"criterion,":[158],"introducing":[159],"expected":[161],"gain":[162],"metric,":[163],"better":[165],"balances":[166],"exploitation":[169],"compared":[170],"existing":[172],"third":[175],"proposes":[177],"rapidly-exploring":[179],"random":[180],"annulus":[181],"graph":[182,186],"(RRAG),":[183],"novel":[185],"construction":[187],"method":[188],"preserves":[190],"full":[191],"orientation":[192],"sampling":[193],"ensures":[195],"connectivity":[196],"cluttered":[198],"environments":[199],"through":[200],"fallback":[202],"sampling-based":[204],"planner.":[205],"Extensive":[206],"experiments":[207],"demonstrate":[208],"combined":[211],"with":[212],"RRAG":[213],"achieves":[214],"highest":[216],"across":[218],"all":[219],"three":[220],"representative":[221],"active":[222],"tasks,":[224],"outperforming":[225],"state-of-the-art":[226],"least":[230],"20%":[231],"one":[233],"tasks.":[236],"We":[237],"further":[238],"validate":[239],"approach":[241],"real":[243],"robotic":[244],"platforms":[245],"different":[247],"scenarios.":[248]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-29T00:00:00"}