Saved in:
Bibliographic Details
Main Authors: Bui, Minh, Hu, Hanyang, He, Chong, Lu, Michael, Giovanis, George, Shriraman, Arrvindh, Chen, Mo
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2204.05520
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911276936986624
author Bui, Minh
Hu, Hanyang
He, Chong
Lu, Michael
Giovanis, George
Shriraman, Arrvindh
Chen, Mo
author_facet Bui, Minh
Hu, Hanyang
He, Chong
Lu, Michael
Giovanis, George
Shriraman, Arrvindh
Chen, Mo
contents This paper introduces OptimizedDP, a high-performance software library for several common grid-based dynamic programming (DP) algorithms used in control theory and robotics. Specifically, OptimizedDP provides functions to numerically solve a class of time-dependent (dynamic) Hamilton-Jacobi (HJ) partial differential equations (PDEs), time-independent (static) HJ PDEs, and additionally value iteration for continuous action-state space Markov Decision Processes (MDP). The computational complexity of grid-based DP is exponential with respect to the number of grid or state space dimensions, and thus can have bad execution runtimes and memory usage whenapplied to large state spaces. We leverage the user-friendliness of Python for different problem specifications without sacrificing the efficiency of the core computation. This is achieved by implementing the core part of the code which the user does not see in heterocl, a framework we use to abstract away details of how computation is parallelized. Compared to similar 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 achieving an order of magnitude improvements in execution times, while keeping the interface easy for specifying different problem descriptions. Because of that, the toolbox has been adopted to solve control and optimization problems that were considered intractable before. Our toolbox is available publicly at https://github.com/SFU-MARS/optimized_dp.
format Preprint
id arxiv_https___arxiv_org_abs_2204_05520
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle OptimizedDP: An Efficient, User-friendly Library For Optimal Control and Dynamic Programming
Bui, Minh
Hu, Hanyang
He, Chong
Lu, Michael
Giovanis, George
Shriraman, Arrvindh
Chen, Mo
Systems and Control
This paper introduces OptimizedDP, a high-performance software library for several common grid-based dynamic programming (DP) algorithms used in control theory and robotics. Specifically, OptimizedDP provides functions to numerically solve a class of time-dependent (dynamic) Hamilton-Jacobi (HJ) partial differential equations (PDEs), time-independent (static) HJ PDEs, and additionally value iteration for continuous action-state space Markov Decision Processes (MDP). The computational complexity of grid-based DP is exponential with respect to the number of grid or state space dimensions, and thus can have bad execution runtimes and memory usage whenapplied to large state spaces. We leverage the user-friendliness of Python for different problem specifications without sacrificing the efficiency of the core computation. This is achieved by implementing the core part of the code which the user does not see in heterocl, a framework we use to abstract away details of how computation is parallelized. Compared to similar 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 achieving an order of magnitude improvements in execution times, while keeping the interface easy for specifying different problem descriptions. Because of that, the toolbox has been adopted to solve control and optimization problems that were considered intractable before. Our toolbox is available publicly at https://github.com/SFU-MARS/optimized_dp.
title OptimizedDP: An Efficient, User-friendly Library For Optimal Control and Dynamic Programming
topic Systems and Control
url https://arxiv.org/abs/2204.05520