Instruments and Systems: Monitoring, Control, and Diagnostics Annotation << Back To modeling of the automated searching of stationary objects B.K. NARTOV, A.N. POLUYANOV In work the problems arising when developing mathematical models of optimum searching of stationary objects and the realizing algorithms of the automated systems of searching are analyzed. The first main problem is lack of the common efficient way of the analytical accounting of crossings and self-crossings of the strips of searching which are swept up by the search units (SU). As a result in attempts of formalization of specific objectives of searching in the form of problems of optimum control to often have to fix the scheme of searching and to introduce padding restrictions for managements of SU. The second main problem is correlation of optimum search plans and the optimum managements corresponding to them in real time. Formalization even of one-criteria problems of optimum control of searching in real time makes one of the main problems of algorithmic providing the automated systems of searching. In the majority of actual problems of searching the initial plan degrades in the course of realization and demands the continuous (in each discrete of control) recalculation. The approach presented in work allows to solve these problems for all class of problems of the automated searching of stationary objects with the given density functions of coordinates. At the same time, even when the complete algorithmic realization of the formalized task in system of searching is difficult, the received formalizm allow to correlate optimum search plans with each other and to the relevant optimum managements in real time and provide the common scheme of an algorithm and algorithms of updating of the current information. Results of numerical model operation the cornerstone of the offered approach of «resilient» function are discussed. Keywords: optimal search, stationary targets, simulation modeling. Contacts: E-mail: nartov@ofim.oscsbras.ru Pp. 18-22.