{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/despot-online-pomdp-planning-with","title":"DESPOT: Online POMDP Planning with Regularization","arxiv_id":"1609.03250","date":"2016-09-12","proceeding":"NeurIPS 2013 12","authors":["Nan Ye","Adhiraj Somani","David Hsu","Wee Sun Lee"],"abstract":"The partially observable Markov decision process (POMDP) provides a\nprincipled general framework for planning under uncertainty, but solving POMDPs\noptimally is computationally intractable, due to the \"curse of dimensionality\"\nand the \"curse of history\". To overcome these challenges, we introduce the\nDeterminized Sparse Partially Observable Tree (DESPOT), a sparse approximation\nof the standard belief tree, for online planning under uncertainty. A DESPOT\nfocuses online planning on a set of randomly sampled scenarios and compactly\ncaptures the \"execution\" of all policies under these scenarios. We show that\nthe best policy obtained from a DESPOT is near-optimal, with a regret bound\nthat depends on the representation size of the optimal policy. Leveraging this\nresult, we give an anytime online planning algorithm, which searches a DESPOT\nfor a policy that optimizes a regularized objective function. Regularization\nbalances the estimated value of a policy under the sampled scenarios and the\npolicy size, thus avoiding overfitting. The algorithm demonstrates strong\nexperimental results, compared with some of the best online POMDP algorithms\navailable. It has also been incorporated into an autonomous driving system for\nreal-time vehicle control. The source code for the algorithm is available\nonline.","url_abs":"http://arxiv.org/abs/1609.03250v3","url_pdf":"http://arxiv.org/pdf/1609.03250v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"despot-online-pomdp-planning-with","repo_url":"https://github.com/AdaCompNUS/despot","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"autonomous-driving","task_name":"Autonomous Driving"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1609.03250","atlas_url":"https://app.syntology.ai/?focus=1609.03250","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1609.03250"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1609.03250\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1609.03250"},"call":"get_concepts_for_paper(arxiv_id=\"1609.03250\")"}],"by_repo":[{"repo":"AdaCompNUS/despot","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c5d4629a42c32bde26c0f0071e2c6030dd3bb64da76cf80214cddfe7be8d67fb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}