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难的。进一步，提出基于整数线性规划的精确算法，并通过案例研究验证了算法的正确性与有效性。