초록
Ryu et al. proposed a multiple target angle-tracking algorithm without a data association problem using angular innovations. This algorithm, however, needs the computational loads in proportion to the square number of sensors regardless of the number of targets, because it uses a nonlinear equation between the signal subspace and angular innovation. In this Paper, we proposed an efficient algorithm for the multiple target angle-tracking using angular innovations. The proposed algorithm extracts the angular innovations from noise subspace. Also, it is demonstrated by computer simulations dealing with the tracking of crossing targets. The simulation results show that the computational loads of the proposed algorithm are $80\%$ and $60\%$ of those of Ryu's algorithm for 3 targets and 6 targets without degrading the performance of the target tracking.