{"id":"https://openalex.org/W7125110665","doi":"https://doi.org/10.48550/arxiv.2601.12701","title":"RPT*: Global Planning with Probabilistic Terminals for Target Search in Complex Environments","display_name":"RPT*: Global Planning with Probabilistic Terminals for Target Search in Complex Environments","publication_year":2026,"publication_date":"2026-01-19","ids":{"openalex":"https://openalex.org/W7125110665","doi":"https://doi.org/10.48550/arxiv.2601.12701"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.12701","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.12701","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.12701","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123481704","display_name":"Yunpeng Lyu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lyu, Yunpeng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123477773","display_name":"Chao Cao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cao, Chao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123507477","display_name":"Ji Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Ji","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067202248","display_name":"Howie Choset","orcid":"https://orcid.org/0000-0002-2266-8744"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Choset, Howie","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ren, Zhongqiang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5123481704"],"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.5911999940872192,"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.5911999940872192,"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/T12288","display_name":"Optimization and Search Problems","score":0.18320000171661377,"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"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.03880000114440918,"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/heuristics","display_name":"Heuristics","score":0.6032999753952026},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6032999753952026},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5989999771118164},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5989999771118164},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.579200029373169},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.579200029373169},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4715000092983246},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4715000092983246},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3901999890804291},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3901999890804291},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.3855000138282776}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6032999753952026},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6032999753952026},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5989999771118164},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5989999771118164},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.579200029373169},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.579200029373169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5590000152587891},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5590000152587891},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49810001254081726},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49810001254081726},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4715000092983246},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4715000092983246},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.3855000138282776},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.3855000138282776},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.34709998965263367},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.34709998965263367},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.34709998965263367},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.34709998965263367},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.32749998569488525},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.32749998569488525},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31610000133514404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31610000133514404},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.3125},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.3125},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.29899999499320984},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.29899999499320984}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.12701","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.12701","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.12701","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.12701","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Routing":[0],"problems":[1,92],"such":[2],"as":[3,87,103,118],"Hamiltonian":[4],"Path":[5],"Problem":[6],"(HPP),":[7],"seeks":[8],"a":[9,17,27,38,66,156,169,191],"path":[10,22,46,57,130],"to":[11,53,74,173,181,215],"visit":[12,70],"all":[13,71],"the":[14,21,41,44,50,55,82,116,128,134,152,175,184],"vertices":[15,138],"in":[16,61,105,113,119,124,136,168,218,222],"graph":[18],"while":[19],"minimizing":[20],"cost.":[23,58],"This":[24,142],"paper":[25],"studies":[26],"variant,":[28],"HPP":[29],"with":[30,160,201,209],"Probabilistic":[31],"Terminals":[32],"(HPP-PT),":[33],"where":[34,65],"each":[35],"vertex":[36,88],"has":[37],"probability":[39],"representing":[40],"likelihood":[42],"that":[43,198,229],"robot's":[45],"terminates":[47],"there,":[48],"and":[49,78,178,225,237],"objective":[51],"is":[52,85],"minimize":[54],"expected":[56,129],"HPP-PT":[59],"arises":[60],"target":[62,207],"object":[63],"search,":[64],"mobile":[67],"robot":[68,227],"must":[69],"candidate":[72],"locations":[73],"find":[75,216],"an":[76],"object,":[77],"prior":[79],"knowledge":[80],"of":[81,99],"object's":[83],"location":[84],"expressed":[86],"probabilities.":[89],"While":[90],"routing":[91],"have":[93],"been":[94],"studied":[95],"for":[96,205],"decades,":[97],"few":[98],"them":[100],"consider":[101],"uncertainty":[102],"required":[104],"this":[106],"work.":[107],"The":[108],"challenge":[109],"lies":[110],"not":[111],"only":[112],"optimally":[114],"ordering":[115],"vertices,":[117],"standard":[120],"HPP,":[121],"but":[122],"also":[123],"handling":[125],"history":[126,176],"dependency:":[127],"cost":[131],"depends":[132],"on":[133,187,244],"order":[135],"which":[137,164],"were":[139],"previously":[140],"visited.":[141],"makes":[143],"many":[144],"existing":[145],"methods":[146],"inefficient":[147],"or":[148,212],"inapplicable.":[149],"To":[150],"address":[151],"challenge,":[153],"we":[154,189],"propose":[155],"search-based":[157],"approach":[158,231],"RPT*":[159,200],"solution":[161],"optimality":[162],"guarantees,":[163],"leverages":[165],"dynamic":[166],"programming":[167],"new":[170],"state":[171],"space":[172],"bypass":[174],"dependency":[177],"novel":[179],"heuristics":[180],"speed":[182],"up":[183],"computation.":[185],"Building":[186],"RPT*,":[188],"design":[190],"Hierarchical":[192],"Autonomous":[193],"Target":[194],"Search":[195],"(HATS)":[196],"system":[197],"combines":[199],"either":[202],"Bayesian":[203],"filtering":[204],"lifelong":[206],"search":[208],"noisy":[210],"sensors,":[211],"autonomous":[213],"exploration":[214],"targets":[217,241],"unknown":[219],"environments.":[220],"Experiments":[221],"both":[223],"simulation":[224],"real":[226],"show":[228],"our":[230],"can":[232],"naturally":[233],"balance":[234],"between":[235],"exploitation":[236],"exploration,":[238],"thereby":[239],"finding":[240],"more":[242],"quickly":[243],"average":[245],"than":[246],"baseline":[247],"methods.":[248]},"counts_by_year":[],"updated_date":"2026-01-22T23:33:04.759266","created_date":"2026-01-22T00:00:00"}