A gatesize computing method in target tracking

Abstract

It is important for target tracking to decide "gatesize" in clutter environment. When the detection probability is equal to 1.0, the conventional gatesize has a problem that the gatesize becomes infinite. Another problem is that usually the same values have been employed for both the gatesize of a tracking radar and that of a search radar, although such practice has not been verified. To solve these problems, we propose a gatesize computing method which determines the gatesize by means of maximizing the difference between the density of the targets and the density of the clutters in gate. Then using our proposed method, we show that the appropriate value for the gatesize of a tracking radar and that of a search radar are different. The effectiveness of the proposed method has been confirmed through computer simulation.