Optimization of Radar Search Patterns for Multiple Scanning Missions in Localized Clutter

TL;DR

This paper presents an optimization approach for radar search patterns in cluttered environments, modeling the problem as a Set Cover Problem and solving it with Integer Programming to minimize scanning time.

Contribution

It introduces a novel approximation of radar search pattern optimization as a Set Cover Problem and applies Integer Programming techniques for efficient solutions.

Findings

Set Cover approximation effectively models radar search optimization.

Integer Programming methods provide near-optimal solutions.

Reduced time-budget for radar scanning in cluttered environments.

Abstract

Electronic Phased-Array Radars offer new possibilities for Optimization of Radar Search Pattern by using bi-dimensional beam forming and beam steering, along both elevation and azimuth axes. The minimization of the Time-Budget required for multiple Radar scanning missions in localized clutter, under constraints of range and detection probability, can be approximated as a Set Cover Problem. We present a Set Cover Problem approximation for Time-Budget minimization of the Radar Search Pattern, and solved this optimization problem using Integer Programming methods based on Branch\&Bound and linear relaxation.