Probabilistic reach-Avoid problems in nondeterministic systems with time-Varying targets and obstacles

作者：

Highlights：

• Based on the existing works, the definition of the probabilistic reachable set is refined by taking into account the time-varying target set and obstacle.

• A numerical method based on backward recursion and grid interpolation is proposed to compute probabilistic reachable sets.

摘要

•Based on the existing works, the definition of the probabilistic reachable set is refined by taking into account the time-varying target set and obstacle.•A numerical method based on backward recursion and grid interpolation is proposed to compute probabilistic reachable sets.

论文关键词：Nondeterministic system,Probabilistic reachable set,Optimal control,Dynamic programming

论文评审过程：Received 7 August 2021, Revised 11 November 2021, Accepted 1 March 2022, Available online 19 March 2022, Version of Record 19 March 2022.

论文官网地址：https://doi.org/10.1016/j.amc.2022.127054