Computing Reachable Sets as Capture-Viability Kernels in Reverse Time

• 作者: No?l Bonneuil
• 来源期刊: 应用数学(英文)
• 学科: 数学
• 关键词: SET-VALUED Analysis Reachable Set
• 年，卷（期）: 2012,（11）
• 页码范围: 1593-1597
• 页数: 5页
• 分类号: O1

摘要

The set SF(x0;T) of states y reachable from a given state x0 at time T under a set-valued dynamic x’(t)∈F(x (t)) and under constraints x(t)∈K where K is a closed set, is also the capture-viability kernel of x0 at T in reverse time of the target {x0} while remaining in K. In dimension up to three, Saint-Pierre’s viability algorithm is well-adapted;for higher dimensions, Bonneuil’s viability algorithm is better suited. It is used on a large-dimensional example.