Boundary-value problems in information theory of relay protection

Abstract

The problems of constructing actuation domains of recognition modules of relay protection, both autonomous and as part of a group, are discussed and illustrated by examples. The group forms a multidimen sional structure trained by imitation models of a protected object in controlled and alternative regimes.

K-Nearest Neighbors Algorithm Application in the Electrical Grid States Recognition Problems

“…Due to the use of an additional information feature, the probability of recognizing α-states increased to 98.4% completely excluding false operations. Thus, the threedimensional algorithm of relay protection [1,2], implemented on the basis of the k-nearest neighbors method, provides almost absolute state recognizability whereas traditional relay protection (current and distance) have a low recognition ability.…”

“…The current trend towards digitalization of secondary substation systems, including relay protection and automation, makes it possible to implement much more complex and potentially more efficient algorithms for recognizing emergency states in comparison with existing technical solutions. A promising direction in relay protection is the informational approach [1,2]. It involves the use of the states simulation modeling results to form protection algorithms.…”

“…An important feature of the information approach is the selection of the features controlled by the protections individually for each separate problem of states recognition, based on the impurity function. As a rule [1,2], the features are combined into a system of setting planes with operating zone formed by the simulation modeling and training results. However, the application of setting planes is not the only way to form a decision rule for relay protection using simulation modeling.…”