通过拉格朗日方法对离散时间随机系统的可达-避集进行下界估计
Underapproximation of Reach-Avoid Sets for Discrete-Time Stochastic Systems via Lagrangian Methods
AI总结:
本文通过统一两种拉格朗日方法,提出计算离散时间非线性系统有限时间 horizon 随机可达-避集的下界估计方法,该方法具有更高的计算效率和可扩展性。
摘要:
我们研究了拉格朗日技术用于计算离散时间非线性系统有限时间 horizon 随机可达-避集的下界估计。我们利用控制文献中目标管的可达性概念,定义了参数化于目标集、安全集和扰动来源集的鲁棒可达-避集。我们统一了两种现有拉格朗日方法,证明了鲁棒可达-避集存在最优控制策略,即马尔可夫策略。基于这些结果,我们表征了扰动空间子集,其对应的鲁棒可达-避集对于给定的目标和安全集是随机可达-避集的保证下界估计。所提出的方法在计算效率上显著优于基于网格的传统方法。尽管该方法具有保守性,但不依赖网格,从而在已知计算几何约束下具有可扩展性。我们通过两个例子验证了该方法:一个简单的二维积分器和一个空间车辆对接问题。
英文摘要:
We examine Lagrangian techniques for computing underapproximations of finite-time horizon, stochastic reach-avoid level-sets for discrete-time, nonlinear systems. We use the concept of reachability of a target tube in the control literature to define robust reach-avoid sets which are parameterized by the target set, safe set, and the set in which the disturbance is drawn from. We unify two existing Lagrangian approaches to compute these sets and establish that there exists an optimal control policy of the robust reach-avoid sets which is a Markov policy. Based on these results, we characterize the subset of the disturbance space whose corresponding robust reach-avoid set for the given target and safe set is a guaranteed underapproximation of the stochastic reach-avoid level-set of interest. The proposed approach dramatically improves the computational efficiency for obtaining an underapproximation of stochastic reach-avoid level-sets when compared to the traditional approaches based on gridding. Our method, while conservative, does not rely on a grid, implying scalability as permitted by the known computational geometry constraints. We demonstrate the method on two examples: a simple two-dimensional integrator, and a space vehicle rendezvous-docking problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。