In this work, we study a class of deception planning problems in which an agent aims to alter a security monitoring system's sensor readings so as to disguise its adversarial itinerary as an allowed itinerary in the environment. The adversarial itinerary set and allowed itinerary set are captured by regular languages. To deviate without being detected, we investigate whether there exists a strategy for the agent to alter the sensor readings, with a minimal cost, such that for any of those paths it takes, the system thinks the agent took a path within the allowed itinerary. Our formulation assumes an offline sensor alteration where the agent determines the sensor alteration strategy and implement it, and then carry out any path in its deviation itinerary. We prove that the problem of solving the optimal sensor alteration is NP-hard, by a reduction from the directed multi-cut problem. Further, we present an exact algorithm based on integer linear programming and demonstrate the correctness and the efficacy of the algorithm in case studies.

翻译：本文研究一类欺骗规划问题，其中智能体旨在篡改安全监控系统的传感器读数，从而将其对抗性行程伪装为环境中的允许行程。对抗性行程集与允许行程集由正则语言刻画。为实现不被检测的偏离，我们探究是否存在一种智能体策略，能够以最小代价篡改传感器读数，使得无论智能体采取何种路径，系统皆认为其遵循了允许行程内的路径。本框架采用离线传感器篡改模式，即智能体先确定并实施传感器篡改策略，随后执行偏离行程中的任意路径。通过从有向多割问题的归约，我们证明了求解最优传感器篡改问题是NP难的。进一步，我们提出一种基于整数线性规划的精确算法，并通过案例研究验证了该算法的正确性与有效性。