【摘要】 将目标检测问题转化为椭球体的截面对圆的覆盖问题,并给出了“逐层收缩”方案,给出了一个可计算的较优的结果;通过对逐层收缩方案的调整,获得了最优解:18个球(9个红球和9个蓝球).本文将目标定位问题转化为圆的三重覆盖问题,建立“球均定位能力”模型证明了一个红(蓝)球周围有4个蓝(红)球这种模式具有最大的球均定位能力,在此基础上给出红、蓝球的一个布局.36个球(18个红球和18个蓝球).更多还原

【Abstract】 This paper firstly interprets the problem of target detection to the one of circle-covering with ellipses. A solution of ″shrinking level-by-level scheme″ is then provided, and the result is acceptable and computable. Through adjusting this scheme, we further acquire the optimal solution of 18 balls with 9 red balls and 9 blue balls. This paper also interprets the problem of target localization to that of triple circle-covering, and establishes a model of Average Localization Ability of a Ball. It is proved that the pattern of four blue/red balls around one red/blue ball has the maximal Average Localization Ability. The optimal station distribution of target localization with 36 balls(18 red balls and 18 blue balls)is hence provided.更多还原