Designing safe zones for systems facing strategic attacks

A new mathematical framework helps defenders choose safe regions while anticipating an attacker's response.

A constrained control system can be certified by building an invariant set. This is a region where control inputs keep the system trajectory within bounds despite disturbances.

In adversarial settings, an attacker observes the defensive design. The attacker then chooses an attack set within certain budget constraints to disrupt the system.

This work studies a Stackelberg set selection game. In this game, a defender chooses a vector parameter for a safe set template. The attacker then selects a vector parameter for an attack set after seeing the defender's choice.

The study uses a signed, facet-normalised invariance margin as the payoff. This margin tests invariance exactly. It also quantifies the available contraction or the facet inflation needed if invariance fails.

The framework handles two information patterns. Controlled invariance means the control input can depend on the disturbance and the attack. Robust controlled invariance means the control input depends only on the state.

The researchers show that the margin is concave in the attack parameter within each validity region. This allows the attacker's best response to be found among a finite number of extreme parameters.

The complete max, min game is solved using a finite family of linear programs. There is one linear program per defender validity region. This method enforces all attacker regions under a single defender decision.

The framework can manage hard state constraints and costs related to the size of the safe set. It also identifies the optimal set parameters and the specific state and attack realizations that activate the certificate.

Key facts

  • The signed margin ϵν\epsilon_{\nu} is ≥0\geq 0 if and only if the set S(b)S(b) satisfies the invariance condition.
  • The attacker's best response is selected from the union of the vertices of the validity regions.
  • The game is solved by one linear program per defender validity region.

All sections

Edition