Abstract: In this paper, a radar deployment problem was translated into graph theory problem by some pre-processing operations, like discretization, to solve a multi-objective optimization problem for radar deployment based on graph theory knowledge. Firstly, different models were established according to various constraints and a corresponding algorithm was designed based on the state compression technology. Compared with traditional algorithms, this algorithm was arranged to be suitable for the solution of the radar deployment problems with more complicated constraints and area conditions, to present an optimal radar deployment scheme rapidly for different constraints. And then, some problems with factors of key area and redundancy were analyzed. Finally, the numerical simulations were carried out. The results show that, the proposed method can provide an optimal radar deployment scheme, which can not only cover whole area, but also minimize the redundancy and avoid resource consuming.