SSR Surveillance Network Double Covering Problem with Obstacle Effect Consideration

Abstract

In this paper, SSR surveillance network double covering problem with obstructing affected by surface features is studied. The purpose is to improve the performance of SSR surveillance network, thus ensure the efficiency and safety management in airspace. The objective is to minimize the number of radar and the decision variable is the site of radar. Only one type of radar is considered. Firstly, radar network covering problem without obstructing affect is studied. The objective is to minimize the number of radar by arrange them in suitable position satisfying the requirement of complete coverage. For this problem, regular hexagonal expansion algorithm and tabu search algorithm is proposed. Worst-case analysis is provided. We conclude the performance of the algorithm is better when the ratio between the whole region area and radar coverage area is bigger. Secondly, double covering problem in the whole region is taken into account. For this problem, regular triangular expansion algorithm and tabu search algorithm is provided firstly which is more efficient for double covering problem. For those convex target areas worst-case analysis is provided also. Finally, SSR surveillance network covering problem with obstructing affected by surface features is studied. The constraint of complete coverage in whole region is also considered in this problem. This problem is more complex and no efficient optimal algorithm can be used. For this problem, improved hexagon expansion algorithm and tabu search algorithm is applied..