A decomposition-based sensor scheduling procedure in radar networks

This paper addresses the sensor resource scheduling problem that allocating the radar resources to track targets under the time and energy constrains in the multi-radar system. The objective is to maximize the number of the targets which can be tracked and improve the utilization of the sensor resources. The optimal scheduling problem with maximize the tracking number and matching number is developed. We then proposed a decomposition-based procedure to solve the problem. It decomposes the bi-objective problem into two sub-problems and solves the two sub-problems optimally with the implicit enumeration method. The simulation results show that the proposed method improves the overall capacity of a multi-radar system compared to the existing techniques.