Desensitization and Deception in Differential Games with Asymmetric Information
Desensitization addresses safe optimal planning under parametric uncertainties by providing sensitivity function-based risk estimates. This paper expands upon the existing work on desensitization in optimal control to address safe planning for a class of two-player differential games. In the proposed game, parametric uncertainties correspond to variations of the model parameters for each player about their nominal values. The two players in the proposed formulation are assumed to have perfect information about these nominal parameter values. However, it is assumed that only one of the players has complete knowledge of the actual parameter value, resulting in information asymmetry in the proposed game. This lack of knowledge regarding the parameter variations is expected to result in state constraint violations for the player with an information disadvantage. In this regard, a desensitized feedback strategy that provides safe trajectories is proposed for the player with incomplete information. The proposed feedback strategy is evaluated for instances involving a single pursuer and a single evader with an uncertain moving obstacle, where the pursuer is assumed to only know the nominal value of the obstacle's speed. At the same time, the evader knows the obstacle's true speed, and also the fact that the pursuer knows only the nominal value of the obstacle's speed. Subsequently, deceptive strategies are proposed for the evader, who has an information advantage, and these strategies are assessed against the pursuer's desensitized strategy.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Theory of Hypergames on Graphs for Synthesizing Dynamic Cyber Defense with Deception
In this chapter, we present an approach using formal methods to synthesize reactive defense strategy in a cyber network, equipped with a set of decoy systems. We first generalize formal graphical security models--attack …
Formal LogicQuantitative Planning with Action Deception in Concurrent Stochastic Games
We study a class of two-player competitive concurrent stochastic games on graphs with reachability objectives. Specifically, player 1 aims to reach a subset $F_1$ of game states, and player 2 aims to reach a subset $F_2$…
Motion PlanningA Dynamic Game Framework for Rational and Persistent Robot Deception With an Application to Deceptive Pursuit-Evasion
This article studies rational and persistent deception among intelligent robots to enhance security and operational efficiency. We present an N-player K-stage game with an asymmetric information structure where each robo…
Deception in Nash Equilibrium Seeking
In socio-technical multi-agent systems, deception exploits privileged information to induce false beliefs in "victims," keeping them oblivious and leading to outcomes detrimental to them or advantageous to the deceiver. …
The Traitors: Deception and Trust in Multi-Agent Language Model Simulations
As AI systems increasingly assume roles where trust and alignment with human values are essential, understanding when and why they engage in deception has become a critical research priority. We introduce The Traitors, a…
Language ModelingLanguage ModellingLarge Language Model