返回
A high-speed method for computing reachable sets based on variable-size grid
DOI:10.1016/j.isatra.2024.11.021.png)
摘要
En 中文
In this paper, we improve the dynamic programming based reachable set computation method by replacing the constant size grid in the original method with a variable size grid. With this improvement, the computational time consumption can be significantly reduced while maintaining the accuracy. The proposed method represents the reachable set as a sublevel set of a discount cost-to-go function, which is generated by dynamic programming. In order to compute the discount cost-to-go function quickly and accurately, the proposed method consists of three steps: (1) Rough computation. This step uses a coarse grid to obtain an interpolation function that is close to the real discount cost-to-go function; (2) Upsampling. This step is for generating a fine grid; (3) Fine tuning. This step generates an interpolation function that exactly approximates the real discount cost-to-go function. This paper theoretically proves the correctness of the proposed method and verifies its effectiveness by some examples.
Keyword:
Reachable set
Dynamic programming
Grid size
Function approximation
期刊
IF:
6.5
论文数:
6.1K
被引数:
2.0W
机构
引用论文
Stabilization of nonlinear dynamical systems via intermittent control with non-instantaneous impulses and actuator saturation
ISA TRANSACTIONS
IF6.5
A novel model predictive control for a piecewise affine class of hybrid system with repetitive disturbance
ISA TRANSACTIONS
IF6.5
A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games连续动态游戏的可到达集的时间相关的hamilton-jacobi公式
Combining anti-cyclic citrullinated peptide with the American College of Rheumatology 1987 criteria failed to improve early rheumatoid arthritis diagnosis in the community-based very early arthritis cohort
Rheumatology
IF0

