Secure Control under Partial Observability with Temporal Logic Constraints
This work addresses secure control under partial observability for applications like autonomous systems, but it appears incremental as it builds on existing game-theoretic and temporal logic frameworks.
The paper tackles the problem of synthesizing control policies for an agent to satisfy temporal logic specifications in a partially observable environment with an adversary, by modeling it as a partially observable stochastic game and limiting policies to finite state controllers for tractability, resulting in a procedure to determine such controllers that maximize specification satisfaction.
This paper studies the synthesis of control policies for an agent that has to satisfy a temporal logic specification in a partially observable environment, in the presence of an adversary. The interaction of the agent (defender) with the adversary is modeled as a partially observable stochastic game. The search for policies is limited to over the space of finite state controllers, which leads to a tractable approach to determine policies. The goal is to generate a defender policy to maximize satisfaction of a given temporal logic specification under any adversary policy. We relate the satisfaction of the specification in terms of reaching (a subset of) recurrent states of a Markov chain. We then present a procedure to determine a set of defender and adversary finite state controllers of given sizes that will satisfy the temporal logic specification. We illustrate our approach with an example.