Non-Uniform Constrained Optimization of Radar Search Patterns in Direction Cosines Space Using Integer Programming - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Non-Uniform Constrained Optimization of Radar Search Patterns in Direction Cosines Space Using Integer Programming

Abstract

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.
No file

Dates and versions

hal-01559432 , version 1 (10-07-2017)

Identifiers

Cite

Yann Briheche, Frédéric Barbaresco, Fouad Bennis, Damien Chablat. Non-Uniform Constrained Optimization of Radar Search Patterns in Direction Cosines Space Using Integer Programming. Radar Symposium (IRS), 2016 17th International, May 2016, Krakow, Poland. ⟨10.1109/IRS.2016.7497343⟩. ⟨hal-01559432⟩
132 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More