TY - GEN
T1 - Defending an Asset with Partial Information and Selected Observations
T2 - 60th IEEE Conference on Decision and Control, CDC 2021
AU - Huang, Yunhan
AU - Chen, Juntao
AU - Zhu, Quanyan
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - This paper considers a linear-quadratic-Gaussian asset defending differential game (DADG) where the attacker and the defender do not know each other's state information. However, they both know the trajectory of a moving asset. Both players can choose to observe the other player's state information by paying a cost. The defender and the attacker have to craft both control strategies and observation strategies. We obtain a closed-form feedback solution that characterizes the Nash control strategies. We show that the trajectory of the asset does not affect both players' observation choices. Moreover, we show that we can decouple the observation choices of the defender and the attacker. One can obtain the Nash observation strategies by solving two independent optimization problems. A set of necessary conditions is developed to characterize the optimal observation instances. Based on the necessary conditions, we propose an effective algorithm to compute the optimal observation instances numerically. We also present a case study to demonstrate the effectiveness of the optimal observation instances.
AB - This paper considers a linear-quadratic-Gaussian asset defending differential game (DADG) where the attacker and the defender do not know each other's state information. However, they both know the trajectory of a moving asset. Both players can choose to observe the other player's state information by paying a cost. The defender and the attacker have to craft both control strategies and observation strategies. We obtain a closed-form feedback solution that characterizes the Nash control strategies. We show that the trajectory of the asset does not affect both players' observation choices. Moreover, we show that we can decouple the observation choices of the defender and the attacker. One can obtain the Nash observation strategies by solving two independent optimization problems. A set of necessary conditions is developed to characterize the optimal observation instances. Based on the necessary conditions, we propose an effective algorithm to compute the optimal observation instances numerically. We also present a case study to demonstrate the effectiveness of the optimal observation instances.
UR - http://www.scopus.com/inward/record.url?scp=85126069436&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85126069436&partnerID=8YFLogxK
U2 - 10.1109/CDC45484.2021.9683431
DO - 10.1109/CDC45484.2021.9683431
M3 - Conference contribution
AN - SCOPUS:85126069436
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 2366
EP - 2373
BT - 60th IEEE Conference on Decision and Control, CDC 2021
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 13 December 2021 through 17 December 2021
ER -