{"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/hyp-despot-a-hybrid-parallel-algorithm-for","title":"HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty","arxiv_id":"1802.06215","date":"2018-02-17","proceeding":null,"authors":["Panpan Cai","Yuanfu Luo","David Hsu","Wee Sun Lee"],"abstract":"Planning under uncertainty is critical for robust robot performance in\nuncertain, dynamic environments, but it incurs high computational cost.\nState-of-the-art online search algorithms, such as DESPOT, have vastly improved\nthe computational efficiency of planning under uncertainty and made it a\nvaluable tool for robotics in practice. This work takes one step further by\nleveraging both CPU and GPU parallelization in order to achieve near real-time\nonline planning performance for complex tasks with large state, action, and\nobservation spaces. Specifically, we propose Hybrid Parallel DESPOT\n(HyP-DESPOT), a massively parallel online planning algorithm that integrates\nCPU and GPU parallelism in a multi-level scheme. It performs parallel DESPOT\ntree search by simultaneously traversing multiple independent paths using\nmulti-core CPUs and performs parallel Monte-Carlo simulations at the leaf nodes\nof the search tree using GPUs. Experimental results show that HyP-DESPOT speeds\nup online planning by up to several hundred times, compared with the original\nDESPOT algorithm, in several challenging robotic tasks in simulation.","url_abs":"http://arxiv.org/abs/1802.06215v1","url_pdf":"http://arxiv.org/pdf/1802.06215v1.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":"hyp-despot-a-hybrid-parallel-algorithm-for","repo_url":"https://github.com/AdaCompNUS/hyp-despot","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":null,"task_name":"CPU"},{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":null,"task_name":"GPU"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.06215","atlas_url":"https://app.syntology.ai/?focus=1802.06215","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":"1802.06215"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.06215\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.06215"},"call":"get_concepts_for_paper(arxiv_id=\"1802.06215\")"}],"by_repo":[{"repo":"AdaCompNUS/hyp-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":"accef785d76d102333aa83d46f76f702a4b868119a05ab6961f2fbc2ef2eaadf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}