The search procedure, as a part of the Modified Ambiguity Function Approach (MAFA), is conducted in the coordinate space. The main advantage of searching for a fixed solution in the coordinate domain, instead of in the ambiguity domain, is the constant search space dimension, which amounts to three. In contrast, an ambiguity space dimension can presently achieve over twenty when the positioning is based on multi-system data. Thus, in the MAFA method, the computational complexity is independent of the number of satellites. We propose a new method of estimating the length of the search step. In this method, the actual satellite configuration determines the size of the search step. Therefore, the data-driven search step is always optimal, regardless of the current satellite configuration. The mathematical model of the new approach is provided together with a detailed algorithm. The numerical experiment follows the description of the search procedure.

作为修正模糊函数方法 (MAFA) 的一部分，搜索过程在坐标空间中进行。在坐标域而不是在歧义域中搜索固定解的主要优点是搜索空间维数不变，总计为 3。相比之下，当定位基于多系统数据时，模糊空间维度目前可以达到二十多个。因此，在 MAFA 方法中，计算复杂度与卫星数量无关。我们提出了一种估计搜索步骤长度的新方法。在这种方法中，实际的卫星配置决定了搜索步长的大小。因此，无论当前的卫星配置如何，数据驱动的搜索步骤始终是最佳的。提供了新方法的数学模型以及详细的算法。数值实验遵循搜索过程的描述。