雷达搜索方向图准时Optimization的分支定界法
Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns
摘要：
电子相控阵雷达通过使用二维波束形成和波束控制为雷达搜索方向图优化提供了新的可能性。雷达搜索方向图的优化可以近似为一个集合覆盖问题，并使用整数规划求解，同时考虑局部杂波和地形掩模的检测约束。在距离、检测概率和特定方向的扫描更新率的约束下，提出了一种雷达搜索模式时间预算最小化的集合覆盖问题近似。分枝定界法是求解组合优化问题的经典方法。它主要被认为是一种精确算法，但具有有趣的特性，使其特别适合于解决实时应用中的最优化问题并产生即时解决方案。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
