{"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/optimizeddp-an-efficient-user-friendly","title":"OptimizedDP: An Efficient, User-friendly Library For Optimal Control and Dynamic Programming","arxiv_id":"2204.05520","date":"2022-04-12","proceeding":null,"authors":["Minh Bui","George Giovanis","Mo Chen","Arrvindh Shriraman"],"abstract":"This paper introduces OptimizedDP, a high-performance software library that solves time-dependent Hamilton-Jacobi partial differential equation (PDE), computes backward reachable sets with application in robotics, and contains value iterations algorithm implementation for continuous action-state space Markov Decision Process (MDP) while leveraging user-friendliness of Python for different problem specifications without sacrificing efficiency of the core computation. These algorithms are all based on dynamic programming, and hence can both be challenging to implement and have bad execution runtime due to the large high-dimensional tabular arrays. Although there are existing toolboxes for level set methods that are used to solve the HJ PDE, our toolbox makes solving the PDE at higher dimensions possible as well as having an order of magnitude improvement in execution times compared to other toolboxes while keeping the interface easy to specify different dynamical systems description. Our toolbox is available online at https://github.com/SFU-MARS/optimized_dp.","url_abs":"https://arxiv.org/abs/2204.05520v1","url_pdf":"https://arxiv.org/pdf/2204.05520v1.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":"optimizeddp-an-efficient-user-friendly","repo_url":"https://github.com/SFU-MARS/optimized_dp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"optimizeddp-an-efficient-user-friendly","repo_url":"https://github.com/Hu-Hanyang/MARAG","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2204.05520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.05520"}},"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/Hu-Hanyang/MARAG","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/SFU-MARS/optimized_dp","reach":{"status":"ok","spdx":"MIT"}}],"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":"eb1ea4c7df60f3f6","entry":"check_target","repo":"SFU-MARS/optimized_dp","repo_kind":"official","path":"odp/compute_trajectory_TTR.py","file_url":"https://github.com/SFU-MARS/optimized_dp/blob/HEAD/odp/compute_trajectory_TTR.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"eb1ea4c7df60f3f6"}},{"code_sha256_prefix":"57f4561416cb7a3d","entry":"compute_opt_traj_TTR","repo":"SFU-MARS/optimized_dp","repo_kind":"official","path":"odp/compute_trajectory_TTR.py","file_url":"https://github.com/SFU-MARS/optimized_dp/blob/HEAD/odp/compute_trajectory_TTR.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"57f4561416cb7a3d"}},{"code_sha256_prefix":"9cb372df10f9cb37","entry":"find_sign_change","repo":"SFU-MARS/optimized_dp","repo_kind":"official","path":"odp/compute_trajectory.py","file_url":"https://github.com/SFU-MARS/optimized_dp/blob/HEAD/odp/compute_trajectory.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9cb372df10f9cb37"}},{"code_sha256_prefix":"511408b75a40dd00","entry":"next_position","repo":"SFU-MARS/optimized_dp","repo_kind":"official","path":"odp/compute_trajectory.py","file_url":"https://github.com/SFU-MARS/optimized_dp/blob/HEAD/odp/compute_trajectory.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"511408b75a40dd00"}},{"code_sha256_prefix":"b6d3227bfb6cd485","entry":"slider_define","repo":"SFU-MARS/optimized_dp","repo_kind":"official","path":"odp/Plots/plotting_utilities.py","file_url":"https://github.com/SFU-MARS/optimized_dp/blob/HEAD/odp/Plots/plotting_utilities.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b6d3227bfb6cd485"}},{"code_sha256_prefix":"8bfc9b0e9e50bc1c","entry":"spa_deriv","repo":"SFU-MARS/optimized_dp","repo_kind":"official","path":"odp/compute_trajectory.py","file_url":"https://github.com/SFU-MARS/optimized_dp/blob/HEAD/odp/compute_trajectory.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8bfc9b0e9e50bc1c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}