{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/value-iteration-networks-on-multiple-levels","title":"Value Iteration Networks on Multiple Levels of Abstraction","arxiv_id":"1905.11068","date":"2019-05-27","proceeding":null,"authors":["Daniel Schleich","Tobias Klamt","Sven Behnke"],"abstract":"Learning-based methods are promising to plan robot motion without performing extensive search, which is needed by many non-learning approaches. Recently, Value Iteration Networks (VINs) received much interest since---in contrast to standard CNN-based architectures---they learn goal-directed behaviors which generalize well to unseen domains. However, VINs are restricted to small and low-dimensional domains, limiting their applicability to real-world planning problems. To address this issue, we propose to extend VINs to representations with multiple levels of abstraction. While the vicinity of the robot is represented in sufficient detail, the representation gets spatially coarser with increasing distance from the robot. The information loss caused by the decreasing resolution is compensated by increasing the number of features representing a cell. We show that our approach is capable of solving significantly larger 2D grid world planning tasks than the original VIN implementation. In contrast to a multiresolution coarse-to-fine VIN implementation which does not employ additional descriptive features, our approach is capable of solving challenging environments, which demonstrates that the proposed method learns to encode useful information in the additional features. As an application for solving real-world planning tasks, we successfully employ our method to plan omnidirectional driving for a search-and-rescue robot in cluttered terrain.","url_abs":"https://arxiv.org/abs/1905.11068v2","url_pdf":"https://arxiv.org/pdf/1905.11068v2.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":"value-iteration-networks-on-multiple-levels","repo_url":"https://github.com/AIS-Bonn/abstract_vin","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"BSD-3-Clause"}}],"tasks":[{"task_slug":"descriptive","task_name":"Descriptive"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1905.11068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11068"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/AIS-Bonn/abstract_vin","reach":{"status":"ok","spdx":"BSD-3-Clause"}}],"summary":{"unverified":6},"by_repo_kind":{"official":{"samples":6,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"5cd9dd16b55352d2","entry":"astar_planner_2d","repo":"AIS-Bonn/abstract_vin","repo_kind":"official","path":"astar.py","file_url":"https://github.com/AIS-Bonn/abstract_vin/blob/HEAD/astar.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"5cd9dd16b55352d2"}},{"code_sha256_prefix":"10a5ab07e978fc98","entry":"astar_planner_3d","repo":"AIS-Bonn/abstract_vin","repo_kind":"official","path":"astar.py","file_url":"https://github.com/AIS-Bonn/abstract_vin/blob/HEAD/astar.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"10a5ab07e978fc98"}},{"code_sha256_prefix":"42c64ef42fdbdf23","entry":"calculate_local_footprints_mulitlayer","repo":"AIS-Bonn/abstract_vin","repo_kind":"official","path":"utils.py","file_url":"https://github.com/AIS-Bonn/abstract_vin/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"42c64ef42fdbdf23"}},{"code_sha256_prefix":"e5b7d69fb339f427","entry":"dijkstra_planner_2d","repo":"AIS-Bonn/abstract_vin","repo_kind":"official","path":"astar.py","file_url":"https://github.com/AIS-Bonn/abstract_vin/blob/HEAD/astar.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"e5b7d69fb339f427"}},{"code_sha256_prefix":"09544ad183940e78","entry":"extract_path","repo":"AIS-Bonn/abstract_vin","repo_kind":"official","path":"utils.py","file_url":"https://github.com/AIS-Bonn/abstract_vin/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"09544ad183940e78"}},{"code_sha256_prefix":"d8d471c0b514b660","entry":"get_wheel_coord","repo":"AIS-Bonn/abstract_vin","repo_kind":"official","path":"utils.py","file_url":"https://github.com/AIS-Bonn/abstract_vin/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"d8d471c0b514b660"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}