Underwater Target Motion Analysis using Product Beamformer and Bearing Match in Simulated Space

Target Maneuvers Analysis (TMA) is an indispensable part of the modern antisubmarine warfare system. A lot of research has gone into various passive TMA techniques. Some of these are batch processing methods, whereas many are iterative. Most iterative methods based on the Bayesian recursion framework had gained wide popularity in recent years. The method presented in this paper is a naïve method, based on inputs of possible values of range, and speed of the target. The method does a deterministic search on a possible discrete solution space. A set of possible target bearing sequences is constructed and the measured bearings are matched against these generated bearings to identify the best match. The dynamics of the best match give a robust solution to the TMA problem.