Verifiable RNN-Based Policies for POMDPs Under Temporal Logic Constraints
Verifiable RNN-Based Policies for POMDPs Under Temporal Logic Constraints
复制标题
时态逻辑约束下可验证的基于 RNN 的 POMDP 策略
DOI:
--
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
U. Topcu
中科院分区:
文献类型:
--
作者:
Steven Carr;N. Jansen;U. Topcu
Recurrent neural networks (RNNs) have emerged as an effective representation of control policies in sequential decision-making problems.
However, a major drawback in the application of RNN-based policies is the difficulty in providing formal guarantees on the satisfaction of behavioral specifications, e.g. safety and/or reachability.
By integrating techniques from formal methods and machine learning, we propose an approach to automatically extract a finite-state controller (FSC) from an RNN, which, when composed with a finite-state system model, is amenable to existing formal verification tools.
Specifically, we introduce an iterative modification to the so-called quantized bottleneck insertion technique to create an FSC as a randomized policy with memory.
For the cases in which the resulting FSC fails to satisfy the specification, verification generates diagnostic information.
We utilize this information to either adjust the amount of memory in the extracted FSC or perform focused retraining of the RNN.
While generally applicable, we detail the resulting iterative procedure in the context of policy synthesis for partially observable Markov decision processes (POMDPs), which is known to be notoriously hard.
The numerical experiments show that the proposed approach outperforms traditional POMDP synthesis methods by 3 orders of magnitude within 2% of optimal benchmark values.
影响因子:
1.3
作者:
Norman, Gethin;Parker, David;Zou, Xueyi
通讯作者:
Zou, Xueyi