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.
@article{arxiv.2508.02081,
title = {Optimization of Radar Search Patterns for Multiple Scanning Missions in Localized Clutter},
author = {Yann Briheche and Frédéric Barbaresco and Fouad Bennis and Damien Chablat},
journal= {arXiv preprint arXiv:2508.02081},
year = {2025}
}
Comments
Antenna Measurements & Applications (CAMA), 2016 IEEE Conference on, Oct 2016, Syracuse, United States