3 citations · 3 across the 3 of their papers we have counts for
6 papers
Probabilistic Reach-Avoid Reachability in Nondeterministic Systems with Time-VaryingTargets and Obstacles
Wei Liao, Taotao Liang, Xiaohui Wei +1
The probabilistic reachability problems of nondeterministic systems are studied. Based on the existing studies, the definition of probabilistic reachable sets is generalized by tak…
Computation of Reachable Sets Based on Hamilton-Jacobi-Bellman Equation with Running Cost Function
Weiwei Liao, Tao Liang
A novel method for computing reachable sets is proposed in this paper. In the proposed method, a Hamilton-Jacobi-Bellman equation with running cost functionis numerically solved an…
Smooth Q-learning: Accelerate Convergence of Q-learning Using Similarity
Wei Liao, Xiaohui Wei, Jizhou Lai
An improvement of Q-learning is proposed in this paper. It is different from classic Q-learning in that the similarity between different states and actions is considered in the pro…
A Novel Unified Framework for Solving Reachability, Viability and Invariance Problems
Wei Liao, Taotao Liang, Xiaohui Wei +1
The level set method is a widely used tool for solving reachability and invariance problems. However, some shortcomings, such as the difficulties of handling dissipation function a…
An Improved Level Set Method for Reachability Problems in Differential Games
Wei Liao, Taotao Liang, Pengwen Xiong +3
This study focuses on reachability problems in differential games. An improved level set method for computing reachable tubes is proposed in this paper. The reachable tube is descr…
Recursive Regret Matching: A General Method for Solving Time-invariant Nonlinear Zero-sum Differential Games
Wei Liao, Xiaohui Wei, Jizhou Lai
In this paper, a new method is proposed to compute the rolling Nash equilibrium of the time-invariant nonlinear two-person zero-sum differential games. The idea is to discretize th…