Related Experiment Video
Updated: Jun 6, 2025

Author Spotlight: Enhancing Cryo-Electron Microscopy by Automated Data Collection and Analysis Techniques
Published on: December 1, 2023
A high-speed method for computing reachable sets based on variable-size grid
Wei Liao1, Ming Tang2, Yu Zhang1
1Advanced Manufacturing School, Nanchang University, Nanchang 330031, China; Jiangxi Key Laboratory of Intelligent Robot, Nanchang University, Nanchang 330031, China.
Abstract:
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.
Related Concept Videos
Area Computation by the Alternative Coordinate Method
Statically Indeterminate Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Theorems of Pappus and Guldinus: Problem Solving
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Method of Sections: Problem Solving II

