{"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/learning-heuristic-search-via-imitation","title":"Learning Heuristic Search via Imitation","arxiv_id":"1707.03034","date":"2017-07-10","proceeding":null,"authors":["Mohak Bhardwaj","Sanjiban Choudhury","Sebastian Scherer"],"abstract":"Robotic motion planning problems are typically solved by constructing a\nsearch tree of valid maneuvers from a start to a goal configuration. Limited\nonboard computation and real-time planning constraints impose a limit on how\nlarge this search tree can grow. Heuristics play a crucial role in such\nsituations by guiding the search towards potentially good directions and\nconsequently minimizing search effort. Moreover, it must infer such directions\nin an efficient manner using only the information uncovered by the search up\nuntil that time. However, state of the art methods do not address the problem\nof computing a heuristic that explicitly minimizes search effort. In this\npaper, we do so by training a heuristic policy that maps the partial\ninformation from the search to decide which node of the search tree to expand.\nUnfortunately, naively training such policies leads to slow convergence and\npoor local minima. We present SaIL, an efficient algorithm that trains\nheuristic policies by imitating \"clairvoyant oracles\" - oracles that have full\ninformation about the world and demonstrate decisions that minimize search\neffort. We leverage the fact that such oracles can be efficiently computed\nusing dynamic programming and derive performance guarantees for the learnt\nheuristic. We validate the approach on a spectrum of environments which show\nthat SaIL consistently outperforms state of the art algorithms. Our approach\npaves the way forward for learning heuristics that demonstrate an anytime\nnature - finding feasible solutions quickly and incrementally refining it over\ntime.","url_abs":"http://arxiv.org/abs/1707.03034v1","url_pdf":"http://arxiv.org/pdf/1707.03034v1.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":"learning-heuristic-search-via-imitation","repo_url":"https://github.com/omron-sinicx/planning-datasets","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"heuristic-search","task_name":"Heuristic Search"},{"task_slug":"motion-planning","task_name":"Motion Planning"},{"task_slug":null,"task_name":"valid"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1707.03034","atlas_url":"https://app.syntology.ai/?focus=1707.03034","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":"1707.03034"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1707.03034\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1707.03034"},"call":"get_concepts_for_paper(arxiv_id=\"1707.03034\")"}],"by_repo":[{"repo":"omron-sinicx/planning-datasets","kind":"listed","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":"50b71732eeee80eddc2185ba6ca614804f137900a2b607baf7b6f57886c86863","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}