Applied Physics and Mathematics Annotation << Back ALGORITHMS FOR SEARCHING TARGETS ON ROUTES WITH RISK B.K. NARTOV, A.N. POLUYANOV The paper formulates the basic strategies for optimal control of the search for fixed targets with given distributions of coordinates on routes with given distributions of the risk of losing search units. The corresponding tasks have been studied under maximized quality criteria: “probability of target detection” and “difference between the probability of target detection and the probability of losing a search unit.” Calculation formulas for the outcomes of non-optimized route scanning have been obtained, and the problems of optimal search interruption have been formalized in options for planning and managing the search in real time. Search problems with correction of the initial distributions of target coordinates and risk distributions in real time are discussed. Simulation experiments that verify the analytical results of the work are described. The developed search simulation application programs make it possible to calculate the effectiveness of the main route scanning strategies for any given analytically or tabular distributions of risk and target coordinates. Keywords: search strategies, route, risk, simulation. DOI: 10.25791/pfi m.06.2023.1283 Pp. 46-52.