Summary: We describe algorithms of the LOKATOR family which are designed for fast directed search of the closest analogue in the pattern recognition process. The algorithms are based on a step-by-step reduction of the number of competing images and on focusing on those images that have the best chance of being winners in this competition. Estimates for the complexity of the algorithms are given that depend weakly on the number of images and the dimension of the attribute space.