We track moving targets with a distributed multiple-input multiple-output (MIMO) radar, for which the transmitters and receivers are appropriately paired and selected with a limited number of radar stations. We aim to maximize the sum of the signal-to-interference-plus-noise ratios (SINRs) of all the targets by sensibly selecting the transmitter-receiver pairs during the tracking period. A key is to model the optimization problem of selecting the transmitter-receiver pairs by a restless multi-armed bandit (RMAB) model that is able to formulate the time-varying signals of the transceiver channels whenever the channels are being probed or not. We regard the estimated mean reward (i.e., SINR) as the state of an arm. If an arm is probed, the estimated mean reward of the arm is the weighted sum of the observed reward and the predicted mean reward; otherwise, it is the predicted mean reward. We associate the predicted mean reward with the estimated mean reward at the previous time slot and the state of the target, which is estimated via the interacting multiple model-unscented Kalman filter (IMM-UKF). The optimized selection of transmitter-receiver pairs at each time is accomplished by using Binary Particle Swarm Optimization (BPSO) based on indexes of arms, each of which is designed by the upper confidence bound (UCB1) algorithm. Above all, a multi-group combinatorial-restless-bandit technique taking into account of different combinations of transmitters and receivers and the closed-loop scheme between transmitter-receiver pair selection and target state estimation, namely MG-CRB-CL, is developed to achieve a near-optimal selection strategy and improve multi-target tracking performance. Simulation results for different scenarios are provided to verify the effectiveness and superior performance of our MG-CRB-CL algorithm.
Optimal Threshold Type Policies for Partially Observable Restless Bandits
Department of Electrical Engineering, Indian Institute of Technology Madras(印度马德拉斯理工学院电气工程系);Indian Institute of Information Technology, Allahabad(印度安拉阿巴德信息科技学院)
Lagrangian Relaxation for Multi-Action Partially Observable Restless Bandits: Heuristic Policies and Indexability
Department of Electrical Engineering, Indian Institute of Technology Madras(印度理工学院马德拉斯分校电子工程系);Department of Electrical Engineering and Computer Science, University of Ottawa(渥太华大学电子工程与计算机科学系)
On Optimality of Myopic Policy for Restless Multi-armed Bandit Problem with Non i.i.d. Arms and Imperfect Detection
Laboratoire de Recherche en Informatique (LRI), Department of Computer Science, the University of Paris-Sud XI(巴黎南第十一大学计算机科学与信息研究实验室);school of Information Engineering, Wuhan University of Technology(武汉理工大学信息工程学院)
Constrained Restless Bandits for Dynamic Scheduling in Cyber-Physical Systems
Department of Electrical Engineering, Indian Institute of Technology Bombay(印度理工学院班加罗尔电子工程系);Polytechnique Montreal(蒙特利尔理工学院);IIIT Allahabad(阿哈迈德纳巴德印度理工学院);University of Ottawa(渥太华大学);IIT Bombay(印度理工学院班加罗尔)
Restless Multi-Process Multi-Armed Bandits with Applications to Self-Driving Microscopies
Department of Information Science and Engineering(信息科学与工程系);Department of Applied Physics(应用物理系);Department of Biophysics(生物物理系);KTH Royal Institute of Technology(皇家理工学院)
The Non-Bayesian Restless Multi-Armed Bandit: A Case of Near-Logarithmic Strict Regret
Department of Aeronautics;Astronautics Massachusetts Institute of Technology, Cambridge, MA 02139, USA Ming Hsieh Department of Electrical Engineering University of Southern California, Los Angeles, CA 90089, USA Department of Electrical;Computer Engineering University of California, Davis, CA 95616, USA Email