Task assignment is crucial for multitarget tracking of the radar network and is mainly solved by centralized optimization methods, which results in the issues of robustness deficiency, high computational cost, and inflexible adaptability in complex environments. To overcome these issues, task assignment of the radar network for multitarget tracking is formulated as a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">multiagent decision-making and learning</i> problem, where each radar node in the network acts as an intelligent agent that can make the tracking decision according to its task preference and interact with other agents for the sake of the best network utility. To describe the decision references of radar nodes for various tasks, the criterion for the design of the utility function is presented, and a utility function under this criterion is devised based on the quality of service framework. Then, the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">coalition game with transferrable utility</i> is developed for task assignment, where the utility of the coalition is completely transferred to all coalition members. The existence of the stable coalition partition of the developed game is analyzed theoretically, and the model-based multiagent <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">random Fourier features reinforcement learning</i> (RFFRL) algorithm is proposed to solve the optimal solution to the game in the high dimensional state space, which is proven to be converged at a Nash-stable coalition partition. Some numerical simulation results are provided to illustrate the effectiveness of the proposed algorithm in terms of tracking performance and resource conservation.
Read full abstract