Method of fast maximum search on the bearing landscape
Yu. B. Nechaev, S. A. Zotov · Radioelectronics and Communications Systems · 2010
On the basis of analyzing the known maximum search algorithms in one and two dimensional cases a conclusion is made that most of them cannot be directly used in the radio bearing problems, since the analyzed dependence has complex landscape with a great number of maxima and minima. A method of using some algorithms for the radio bearing problem is suggested which allows making the bearing up to 10 times faster in the one dimensional and up to 1000 times faster in the two dimensional case if compared to linear search.