{"ID":2886704,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2508.02081","arxiv_id":"2508.02081","title":"Optimization of Radar Search Patterns for Multiple Scanning Missions in Localized Clutter","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\\\u0026Bound and linear relaxation.","short_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 rang...","url_abs":"https://arxiv.org/abs/2508.02081","url_pdf":"https://arxiv.org/pdf/2508.02081v1","authors":"[\"Yann Briheche\",\"Frédéric Barbaresco\",\"Fouad Bennis\",\"Damien Chablat\"]","published":"2025-08-04T05:49:30Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}