Identifying Cognitive Radars - Inverse Reinforcement Learning Using Revealed Preferences
Identifying Cognitive Radars - Inverse Reinforcement Learning Using Revealed Preferences
复制标题
DOI:
10.1109/tsp.2020.3013516
复制
发表时间:
2019-12
影响因子:
5.4
通讯作者:
V. Krishnamurthy;D. Angley;R. Evans;B. Moran
中科院分区:
文献类型:
--
作者:
V. Krishnamurthy;D. Angley;R. Evans;B. Moran
We consider an inverse reinforcement learning problem involving “us” versus an “enemy” radar equipped with a Bayesian tracker. By observing the emissions of the enemy radar, how can we identify if the radar is cognitive (constrained utility maximizer)? Given the observed sequence of actions taken by the enemy's radar, we consider three problems: (i) Are the enemy radar's actions (waveform choice, beam scheduling) consistent with constrained utility maximization? If so how can we estimate the cognitive radar's utility function that is consistent with its actions. We formulate, and solve the problem in terms of the spectra (eigenvalues) of the state, and observation noise covariance matrices, and the algebraic Riccati equation. (ii) How to construct a statistical test for detecting a cognitive radar (constrained utility maximization) when we observe the radar's actions in noise or the radar observes our probe signal in noise? We propose a statistical detector with a tight Type-II error bound. (iii) How can we optimally probe (interrogate) the enemy's radar by choosing our state to minimize the Type-II error of detecting if the radar is deploying an economic rational strategy, subject to a constraint on the Type-I detection error? We present a stochastic optimization algorithm to optimize our probe signal. The main analysis framework used in this paper is that of revealed preferences from microeconomics.