Non-uniform constrained optimization of radar search patterns in direction cosines space using integer programming

Electronic Phased-Array Radars offer new possibilities for Radar Search Pattern Optimization by using variable beam-shapes. Radar Search Pattern Optimization can be approximated by a Set Covering Problem. This allows automatic generation of Search Patterns for non-uniform constrained environments in operational situation. We present a Set Covering Problem approximation for Time-Budget minimization of Search Patterns, in Direction Cosines space, under constraints of range and detection probability.