Time-optimal algorithms focused on the search for random pulsed-point sources

The article describes methods and algorithms related to the analysis of dynamically changing discrete random fields. Time-optimal strategies for the localization of pulsed-point sources having a random spatial distribution and indicating themselves by generating instant delta pulses at random times are proposed. An optimal strategy is a procedure that has a minimum (statistically) average localization time. The search is performed in accordance with the requirements for localization accuracy and is carried out by a system with one or several receiving devices. Along with the predetermined accuracy of localization of a random pulsed-point source, a significant complicating factor of the formulated problem is that the choice of the optimal search procedure is not limited to one-step algorithms that end at the moment of first pulse generation. Moreover, the article shows that even with relatively low requirements for localization accuracy, the time-optimal procedure consists of several steps, and the transition from one step to another occurs at the time of registration of the next pulse by the receiving system. In this case, the situation is acceptable when during the process of optimal search some of the generated pulses are not fixed by the receiving system. The parameters of the optimal search depending on the number of receiving devices and the required accuracy of localization are calculated and described in the paper.