论文标题
分支和结合方法，以优化雷达搜索模式
Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns
论文作者
论文摘要
通过使用双维梁形成和梁向导，电子相分阵雷达雷达为雷达搜索模式优化提供了新的可能性。雷达搜索模式优化可以作为设定盖问题近似，并使用整数编程解决，同时考虑到检测约束的局部杂物和地形蒙版。我们提出了一个设定盖问题近似值，以最大程度地预算雷达搜索模式，在范围的限制下，检测概率和方向特异性扫描更新速率。分支\＆Bound是解决组合问题的经典优化程序。它主要被称为一种精确的算法，但具有有趣的特征，使其特别适合在实时应用中解决优化问题并产生恰当的解决方案。
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.
