Finding plans subject to stipulations on what information they divulge
Finding plans subject to stipulations on what information they divulge
复制标题
寻找受所披露信息规定约束的计划
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
J. O’Kane
中科院分区：
文献类型：
--
作者：
Yulin Zhang;Dylan A. Shell;J. O’Kane
出于应用程序的隐私是很重要的，我们考虑规划问题的机器人在观察员的存在。我们首先制定计划问题，然后根据计划执行过程中信息披露的规定来解决计划问题-适当的解决方案概念是计划和信息披露政策。我们提出这一类问题的最坏情况下的模型的框架内的procrustean图，制定披露政策作为一个特定类型的地图上的边缘标签。我们设计的算法，给定一个规划问题补充信息规定，可以找到一个计划，相关的披露政策，或两者兼而有之，如果有的话。计划和相关联的公开策略都可以微妙地取决于观察者可用的附加信息，诸如观察者是否知道机器人的计划（例如，通过侧通道泄漏）。我们的实现找到一个计划和一个合适的披露政策，联合，当任何这样的对存在，尽管小的问题的情况。
Motivated by applications where privacy is important, we consider planning problems for robots acting in the presence of an observer. We first formulate and then solve planning problems subject to stipulations on the information divulged during plan execution --- the appropriate solution concept being both a plan and an information disclosure policy. We pose this class of problem under a worst-case model within the framework of procrustean graphs, formulating the disclosure policy as a particular type of map on edge labels. We devise algorithms that, given a planning problem supplemented with an information stipulation, can find a plan, associated disclosure policy, or both if some exists. Both the plan and associated disclosure policy may depend subtlety on additional information available to the observer, such as whether the observer knows the robot's plan (e.g., leaked via a side-channel). Our implementation finds a plan and a suitable disclosure policy, jointly, when any such pair exists, albeit for small problem instances.