Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns
Abstract
Electronic phased-array radars offer new possibilities for radar search pattern optimization by using bi-dimensional beam-forming and beam-steering. Radar search pattern optimization can be approximated as a set cover problem and solved using integer programming, while accounting for localized clutter and terrain masks in detection constraints. We present a set cover problem approximation for time-budget minimization of radar search patterns, under constraints of range, detection probability and direction-specific scan update rates. Branch\&Bound is a classical optimization procedure for solving combinatorial problems. It is known mainly as an exact algorithm, but features interesting characteristics, making it particularly fit for solving optimization problems in real-time applications and producing just-in-time solutions.
Cite
@article{arxiv.2002.04906,
title = {Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns},
author = {Yann Briheche and Frédéric Barbaresco and Fouad Bennis and Damien Chablat},
journal= {arXiv preprint arXiv:2002.04906},
year = {2020}
}