{"id":"https://openalex.org/W7148849799","doi":"https://doi.org/10.48550/arxiv.2604.01434","title":"Leveraging the Value of Information in POMDP Planning","display_name":"Leveraging the Value of Information in POMDP Planning","publication_year":2026,"publication_date":"2026-04-01","ids":{"openalex":"https://openalex.org/W7148849799","doi":"https://doi.org/10.48550/arxiv.2604.01434"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.01434","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01434","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.01434","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044169293","display_name":"Zakariya Laouar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laouar, Zakariya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132859611","display_name":"Qi Heng Ho","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ho, Qi Heng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5054686855","display_name":"Zachary N. Sunberg","orcid":"https://orcid.org/0000-0001-9707-3035"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sunberg, Zachary","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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.8758000135421753,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.8758000135421753,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0471000000834465,"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"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.011300000362098217,"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":[{"id":"https://openalex.org/keywords/partially-observable-markov-decision-process","display_name":"Partially observable Markov decision process","score":0.8575999736785889},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6184999942779541},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.607699990272522},{"id":"https://openalex.org/keywords/value-of-information","display_name":"Value of information","score":0.5852000117301941},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5077000260353088},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4122999906539917},{"id":"https://openalex.org/keywords/automated-planning-and-scheduling","display_name":"Automated planning and scheduling","score":0.40950000286102295},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.3962000012397766},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.3950999975204468}],"concepts":[{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.8575999736785889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7365000247955322},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6184999942779541},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.607699990272522},{"id":"https://openalex.org/C92424840","wikidata":"https://www.wikidata.org/wiki/Q7912772","display_name":"Value of information","level":2,"score":0.5852000117301941},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5077000260353088},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4122999906539917},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.40950000286102295},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3962000012397766},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3950999975204468},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39399999380111694},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3935000002384186},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.391400009393692},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.374099999666214},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3402999937534332},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.3212999999523163},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C205706631","wikidata":"https://www.wikidata.org/wiki/Q2319304","display_name":"Expected utility hypothesis","level":2,"score":0.3059999942779541},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C20837028","wikidata":"https://www.wikidata.org/wiki/Q623966","display_name":"Influence diagram","level":3,"score":0.30090001225471497},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.2777999937534332},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27059999108314514},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.25679999589920044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.01434","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01434","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.01434","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01434","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.673061728477478}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Partially":[0],"observable":[1],"Markov":[2],"decision":[3],"processes":[4],"(POMDPs)":[5],"offer":[6],"a":[7,32,72,106],"principled":[8],"formalism":[9],"for":[10,150],"planning":[11,29,104],"under":[12,27],"state":[13],"and":[14,41,145],"transition":[15],"uncertainty.":[16],"Despite":[17],"advances":[18],"made":[19],"towards":[20],"solving":[21],"large":[22],"POMDPs,":[23],"obtaining":[24],"performant":[25],"policies":[26],"limited":[28],"time":[30],"remains":[31],"major":[33],"challenge":[34],"due":[35],"to":[36],"the":[37,42,50,56,67,86,124,138],"curse":[38,43],"of":[39,44,52,88,100,131,140],"dimensionality":[40],"history.":[45],"For":[46],"many":[47],"POMDP":[48,161],"problems,":[49],"value":[51,87],"information":[53,89,122],"(VOI)":[54],"-":[55,64],"expected":[57],"performance":[58],"gain":[59],"from":[60],"reasoning":[61,143],"about":[62],"observations":[63,83],"varies":[65],"over":[66],"belief":[68],"space.":[69],"We":[70,133],"introduce":[71],"dynamic":[73],"programming":[74],"framework":[75,144],"that":[76,112,155],"exploits":[77],"this":[78,95],"structure":[79],"by":[80,118],"conditionally":[81],"processing":[82],"based":[84],"on":[85,94,137,159],"at":[90],"each":[91],"belief.":[92],"Building":[93],"framework,":[96],"we":[97],"propose":[98],"Value":[99],"Information":[101],"Monte":[102,107],"Carlo":[103,108],"(VOIMCP),":[105],"Tree":[109],"Search":[110],"algorithm":[111],"allocates":[113],"computational":[114],"effort":[115],"more":[116],"efficiently":[117],"selectively":[119],"disregarding":[120],"observation":[121],"when":[123],"VOI":[125,142],"is":[126],"low,":[127],"avoiding":[128],"unnecessary":[129],"branching":[130],"observations.":[132],"provide":[134],"theoretical":[135],"guarantees":[136],"near-optimality":[139],"our":[141],"derive":[146],"non-asymptotic":[147],"convergence":[148],"bounds":[149],"VOIMCP.":[151],"Simulation":[152],"evaluations":[153],"demonstrate":[154],"VOIMCP":[156],"outperforms":[157],"baselines":[158],"several":[160],"benchmarks.":[162]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-04T00:00:00"}