We consider a team of autonomous agents that navigate in an adversarial environment and aim to achieve a task by allocating their resources over a set of target locations. The adversaries in the environment observe the autonomous team's behavior to infer their objective and counter-allocate their own resources to the target locations. In this setting, we develop strategies for controlling the density of the autonomous team so that they can deceive the adversaries regarding their objective while achieving the desired final resource allocation. We first develop a prediction algorithm, based on the principle of maximum entropy, to express the team's behavior expected by the adversaries. Then, by measuring the deceptiveness via Kullback-Leibler divergence, we develop convex optimization-based planning algorithms that deceives adversaries by either exaggerating the behavior towards a decoy allocation strategy or creating ambiguity regarding the final allocation strategy. Finally, we illustrate the performance of the proposed algorithms through numerical simulations.
翻译:我们考虑的是一支由自主人员组成的队伍,在敌对的环境中航行,目的是通过在一组目标地点上分配资源来完成任务。环境中的对手观察自主团队的推论行为,将自己的资源反向分配给目标地点。在这个背景下,我们制定了控制自主团队密度的战略,以便在达到预期的最后资源分配目标的同时,在目标上欺骗对手。我们首先根据最大加密原则开发一种预测算法,以表达对手所期望的团队行为。然后,通过Kullback-Leibeller差异来测量欺骗性,我们开发基于等式优化的规划算法,通过将行为夸大到诱饵分配战略或者在最后分配战略上制造模糊性来欺骗对手。最后,我们通过数字模拟来说明拟议算法的表现。