{"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-from-the-hindsight-plan-episodic-mpc","title":"Learning from the Hindsight Plan -- Episodic MPC Improvement","arxiv_id":"1609.09001","date":"2016-09-28","proceeding":null,"authors":["Aviv Tamar","Garrett Thomas","Tianhao Zhang","Sergey Levine","Pieter Abbeel"],"abstract":"Model predictive control (MPC) is a popular control method that has proved\neffective for robotics, among other fields. MPC performs re-planning at every\ntime step. Re-planning is done with a limited horizon per computational and\nreal-time constraints and often also for robustness to potential model errors.\nHowever, the limited horizon leads to suboptimal performance. In this work, we\nconsider the iterative learning setting, where the same task can be repeated\nseveral times, and propose a policy improvement scheme for MPC. The main idea\nis that between executions we can, offline, run MPC with a longer horizon,\nresulting in a hindsight plan. To bring the next real-world execution closer to\nthe hindsight plan, our approach learns to re-shape the original cost function\nwith the goal of satisfying the following property: short horizon planning (as\nrealistic during real executions) with respect to the shaped cost should result\nin mimicking the hindsight plan. This effectively consolidates long-term\nreasoning into the short-horizon planning. We empirically evaluate our approach\nin contact-rich manipulation tasks both in simulated and real environments,\nsuch as peg insertion by a real PR2 robot.","url_abs":"http://arxiv.org/abs/1609.09001v2","url_pdf":"http://arxiv.org/pdf/1609.09001v2.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-from-the-hindsight-plan-episodic-mpc","repo_url":"https://github.com/zuoxingdong/VIN_PyTorch_Visdom","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"contact-rich-manipulation","task_name":"Contact-rich Manipulation"},{"task_slug":"model-predictive-control","task_name":"Model Predictive Control"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1609.09001","atlas_url":"https://app.syntology.ai/?focus=1609.09001","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.09001"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1609.09001\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1609.09001"},"call":"get_concepts_for_paper(arxiv_id=\"1609.09001\")"}],"by_repo":[{"repo":"zuoxingdong/VIN_PyTorch_Visdom","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1602.02867"],"harvested_for_calls":[{"arxiv_id":"1602.02867","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1602.02867"},"call":"get_harvested_code_for_paper(arxiv_id=\"1602.02867\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"893eea3cb93e4df8f843bf1def1a57ca77a3a7af4cf086e573402e91216f51d9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}