RU2105343C1 - Device for situation control - Google Patents

Abstract

FIELD: automation and systems for automatic control, in particular, for control of digital control objects, solving recognition and analysis problems for objects, situations, processes and phenomena which are described by finite set of features (symptoms, characteristics). SUBSTANCE: device has input register, N output registers, clock oscillator, OR gate which has N inputs, N classification units, each of which has AND gate, three memory units, comparison unit and address counter. In addition device has control unit, which has N OR gates, two groups off N AND gates and N inhibition gates which have M-1 inputs. In addition device has decision making unit which has M groups of AND gates which have respectively two, three, .., M inputs, and group of M OR gates which have respectively N-m inputs. EFFECT: searching tolerance classes of current control situations and corresponding control actions from set of connected component tolerance spaces which are dual to linear structure. 3 cl, 5 dwg

Description

 The invention relates to automated systems, automatic control systems and can be used to control complex objects with a predominantly discrete nature of the technological cycle, as well as to solve problems of recognition and analysis of these objects, situations, processes or phenomena of an arbitrary nature, described by sets of signs (symptoms, factors )

 A device is known that contains first and second registers, first, second and third memory blocks, a comparison circuit, a block of AND elements, an address counter, a clock generator, a control unit [1].

 The disadvantage of this device is its limited scope, due to the use of such an ideal classification system, which defines its division into classes of equivalence of situations on the original set of complete situations. When describing complex real control objects, it is usually not possible to find a partition of complete situations of their presentation into equivalence classes due to the blurred boundaries of classifications.

 Also known is a device containing an input register, N output registers, N blocks of AND elements, N comparison blocks, three groups of N memory blocks, N address counters, an OR element on N inputs, a control unit, a clock generator [2].

 The disadvantage of the device is its limited scope, due to the ability to search for tolerance classes of current control situations for various fully connected tolerance spaces, while the choice of appropriate solutions (effects) remains ambiguous (uncertain) even for tolerance classes uniquely identified by the device.

 Of the known devices, the closest in technical essence and in the totality of features is a device containing an input register, a first output register, a control unit, a clock generator, a first classification block that contains an AND element, three memory blocks, a comparison unit and an address counter, counting the input of which is the counting input of the classification block, the outputs of the address counter are connected to the corresponding inputs of the memory blocks, the outputs of the first memory block are connected to the first group of inputs of the And element, the second the input group of which is a group of information inputs of the classification block, the group of outputs of the And element is connected to the first group of inputs of the comparison block, the output of which is the clock output of the classification block, the second group of inputs of the comparison block is connected to the outputs of the second memory block, the outputs of the third memory block are the group of information outputs classification block, and the information input of the input register is the input of the device, and the outputs are connected by the corresponding information inputs of the first block classification, the clock input of which is connected to the corresponding clock input of the first group of inputs of the control unit, the synchronization input of which is connected to the output of the clock generator, the information outputs of the first classification block are connected respectively to the information inputs of the first output register, the outputs of which are the first outputs of the device, the counting input of the first the classification unit is connected to the corresponding output of the first group of the control unit, the outputs of the second group of which are connected respective clock inputs of said first output registers [3].

 The disadvantage of this device is its limited scope, due to the ability to search for tolerance classes of current control situations only for sequentially conjugate (linearly conjugate) tolerance spaces.

 The purpose of the invention is the expansion of the scope of the device due to the implementation of the ability to make the choice of control solutions on a variety of different fully connected spaces of tolerance, paired to a linear structure.

 This goal is achieved by the fact that a group of N-1 registers is entered into the device containing the input register, the first output register, the control unit, the clock generator, the first classification block, which contains the And element, three memory blocks, the comparison unit and the address counter output, a group of N-1 classification blocks, an OR element and a control decision selection block, wherein the information inputs of the group classification blocks are connected to the corresponding outputs of the input register, the clock outputs of the group classification blocks are connected s with the corresponding clock inputs of the first group of inputs of the control unit, the information outputs of the group classification units are connected respectively to the information inputs of the group output registers, the counting inputs of the group classification units are connected with the corresponding outputs of the first group of the control unit, the outputs of the second group of which are connected with the corresponding clock inputs of the output registers groups, inputs of the block of choice of control decisions are connected respectively to the clock outputs of the classification blocks, in moves selecting unit control decisions connected with timing inputs of the second group of the control unit, the outputs of the second group are connected to inputs of the OR gate, whose output is connected to a clock output of the input register.

), выходы элементов И каждой j-й группы подключены соответственно к i-м входам соответственно i-го элемента ИЛИ, выходы элементов ИЛИ являются выходами блока выбора управляющих решений.The control decision selection block contains M groups of AND elements for two, three, ..., M inputs and a group of M OR elements for N - M inputs, each i-th input of the block is connected to the i-th one, (i - 1 ) -th, (i - 2) -th, ..., [i- (M-1)] - th element And of the j-th group of elements, (where

), the outputs of the AND elements of each j-th group are connected respectively to the i-th inputs of the i-th OR element, respectively, the outputs of the OR elements are outputs of the control decision selection block.

) тактирующий вход второй группы блока соединен с запрещающими входами каждого из N элементов ЗАПРЕТ группы, кроме одноименного.The control unit contains a group of N elements OR, two groups of N elements and a group of N elements FORBID on M-1 inputs, and the synchronization input of the block is connected to the first inputs of the OR elements and the And elements of the first and second groups, and the clock inputs of the first group are connected respectively, to the second inputs of the AND elements of the first group and OR elements, the outputs of the OR elements of the group are connected respectively to the second inputs of the AND elements of the second group, the outputs of which are the outputs of the first group of the block, the outputs of the elements AND of the first group are connected to the permissive inputs of the corresponding BAN elements, the outputs of which are the outputs of the second group of the block, each i-th (

) the clocking input of the second group of the block is connected to the inhibitory inputs of each of the N elements of the FORBID group, except for the same name.

 Introduction to the device of additional blocks and connections allows you to implement an effective scheme for choosing control solutions on a variety of different fully connected structures (tolerance spaces), conjugate to classes linear in characteristic vectors extracted from memory blocks and the corresponding control decision codes, which significantly expands the scope of the device.

 In FIG. 1 shows a functional diagram of a device for situational control: in FIG. 2 - adopted conditional classification scheme and selection of control decisions; in FIG. 3 - functional construction of the classification block; in FIG. 4 - functional construction of the control unit; in FIG. 5 - functional building block selection of control decisions.

The device (Fig. 1) contains an input register 1, blocks 2 ₁ -2 _N classification, registers 3 ₁ -3 _N output, element OR 4 on N inputs, block 5 for selecting control decisions, control block 6 and a clock generator 7.

the i-th classification block (Fig. 3) contains the i-th element And 8 _i , the first 11 _i , second 9 _i and third 13 _i i-th memory blocks, i-th comparison unit 10 _i and i-th counter 12 _i addresses, as well as a group of information inputs 1 ₁ -1 _J and outputs 1 ₁ -1 _J , i-th counter input and i-th clock output.

The control unit (Fig. 4) contains the first group of N elements And 14 ₁ - 14 _N , the elements OR 15 ₁ -15 _N , the second group of elements And 16 ₁ - 16 _N and the elements "Prohibition" 17 ₁ - 17 _N , and also has input 1, clock groups of inputs 2 ₁ - 2 _N and 3 ₁ -3 _M and groups of outputs 1 ₁ - 1 _N and 2 ₁ - 2 _N.

The control decision selection block (Fig. 5) contains the first group of N-1 elements And 18 ₁ - 18 _N-1 at two inputs, the second group of N-2 elements And 19 ₁ - 19 _N-2 at three inputs, ..., The Mth group of NM elements AND 20 ₁ - 20 _NM on M + 1 inputs, M elements OR 21 ₁ - 21 _M on M inputs, and also has a group of inputs 1 ₁ - 1 _N and a group of outputs 1 ₁ - 1 _M.

We define the set S of all situations of the subject area on the basis of knowledge about the state of the control system, knowledge of control technology, as well as information about the structure of the control object and its functioning. In the general case, the set of complete situations S is a set that includes all fundamentally possible (current) situations S _t , S _t ∈ S about the control object and the control system itself (Pospelov D.A. Situational control. Theory and practice. M. : Nauka, 1988, p. 26; Yu.I. Klykov, Situational management of large systems (Moscow: Energia, 1974).

, которая образует покрытие множества S. Если существует хотя бы пара таких подмножеств S_i и S_j, что при i = j S_i

S_j ≠ ⌀ ,

S_j = S, то подмножества S_j называются классами толерантности ситуаций.Let a certain set of situations be given for representing a complex observation volume and a system of subsets {S ₁ , S ₂ , ... S _N }, S _j ∈ S,

which forms the cover of S. If there exists at least a pair of subsets S _i and S _j such that for i = j S _i

S _j ≠ ⌀,

S _j = S, then the subsets S _j are called situation tolerance classes.

The representation of tolerance classes S ^T in the form of characteristic (eigenvectors) vectors for the entire variety of described objects and phenomena is determined in the general case by the form of tolerance, i.e. the nature (feature) of the coverage of the original set S. The nature of the coverage of the set S depends on the type (class) of structures (tolerance spaces) used to describe and represent the subject area being studied.

 One of the most common basic structures of tolerance (spaces of tolerance) found in nature are the so-called fully connected structures. A practical application of the use of such structures, for example, in the field of information and computer networks, is used to describe fully connected structures on the principle of "each with each" (Bratukhin P.I. et al. Fundamentals of building large information and computer networks. Publishing house. Statistics, 1976).

For tolerance classes S ^T with a fully connected structure, which is schematically presented for the two-dimensional case in the form of FIG. 2, it seems appropriate to distinguish the following tolerance classes S ^t = {<S $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ >, <S $\genfrac{}{}{0ex}{}{\text{t}}{\text{j, j + 1}}$ >, ... <S _{1, ..., N} >}.

,
где S_t - двоичный вектор t-й текущей ситуации класса S $\genfrac{}{}{0ex}{}{\text{т}}{\text{j}}$ .The characteristic vectors of the class S _j are the pair of vectors h _i and q _j (respectively, direct and inverse) such that the relations

,
where S _t is the binary vector of the tth current situation of class S $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ .

,
где S_t - двоичный вектор t-й ситуации класса S $\genfrac{}{}{0ex}{}{\text{т}}{\text{j,j+1}}$ .Class S characteristic vectors $\genfrac{}{}{0ex}{}{\text{t}}{\text{j, j + 1}}$ called vectors h $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ h $\genfrac{}{}{0ex}{}{\text{t}}{\text{j + 1}}$ and q $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ q $\genfrac{}{}{0ex}{}{\text{t}}{\text{j + 1}}$ such that the relations are satisfied:

,
where S _t is the binary vector of the tth situation of class S $\genfrac{}{}{0ex}{}{\text{t}}{\text{j, j + 1}}$ .

,
где S_t - двоичный вектор t-й ситуации класса S $\genfrac{}{}{0ex}{}{\text{т}}{\text{1,...,N}}$ .Class S characteristic vectors $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{1, ..., N}}$ called vectors h $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{1}}$ , ..., h $\genfrac{}{}{0ex}{}{\text{t}}{\text{N}}$ and q $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{1}}$ , ..., q $\genfrac{}{}{0ex}{}{\text{t}}{\text{N}}$ such that the relations are satisfied:

,
where S _t is the binary vector of the tth situation of class S $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{1, ..., N}}$ .

.The condition that the situation S _t belongs to the corresponding tolerance class S ^T in order to identify the true state is generally described by the following logical expression:

.

 Condition (4), taking into account the proposed algorithm for searching the tolerance classes of current control situations for fully connected structures, can be represented as follows.

в том случае, если код ситуации S_t имеет единицы во всех разрядах, в которых единицы имеет h $\genfrac{}{}{0ex}{}{\text{т}}{\text{j}}$ и не имеет единиц во всех тех разрядах, в которых единицы имеет q $\genfrac{}{}{0ex}{}{\text{т}}{\text{j}}$ .1 option. The situation S _t belongs to the class

in the event that the situation code S _t has units in all digits in which units have h $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ and does not have units in all those categories in which units has q $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ .

Option 2. The situation S _t belongs to the class S $\genfrac{}{}{0ex}{}{\text{t}}{\text{j, j + 1}}$ in the event that the situation code S _t has units in all digits in which units have h $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ and H $\genfrac{}{}{0ex}{}{\text{t}}{\text{j + 1}}$ and does not have units in all those categories in which units has q $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ and q $\genfrac{}{}{0ex}{}{\text{t}}{\text{j + 1}}$ , i.e.

.

.

3 option. A situation belongs to the class S _{1, ..., N} if the situation code S _t has units in all digits in which units have h $\genfrac{}{}{0ex}{}{\text{t}}{\text{1}}$ h $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{2}}$ , ..., h $\genfrac{}{}{0ex}{}{\text{t}}{\text{N}}$ and does not have units in all those categories in which units has q $\genfrac{}{}{0ex}{}{\text{t}}{\text{1}}$ q $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{2}}$ , ..., q $\genfrac{}{}{0ex}{}{\text{t}}{\text{N}}$ , i.e.

.

.

получается, что любой элемент этого пересечения одновременно индуцирует два различных решения R_j и R_j+1.In the second and third options for presenting situations, despite the unambiguity of identifying tolerance classes, uncertainty arises in choosing the appropriate control solution, since, in accordance with the logic for representing tolerance classes

it turns out that any element of this intersection simultaneously induces two different solutions R _j and R _{j + 1} .

,
где знак _→ условно означает переход от одной альтернативы (множества ситуаций, класса, варианта решения, ...) к последующей, как правило, вложенной в предыдущую.To ensure certainty in the choice of control solutions on the set of different fully connected spaces of tolerance for the second version of the representation of situations (5), the following algorithm for choosing control solutions is proposed, which can be represented as:

,
where the sign _ → conditionally means the transition from one alternative (many situations, class, solution, ...) to the next, usually nested in the previous one.

.Similarly, generalizing the algorithm for choosing control solutions on the set of fully connected tolerance spaces for the third version of the representation of situations (6), we obtain:

.

 The implementation of algorithms (7) and (8) allows one to resolve the uncertainty by choosing from the group of analyzed solutions (alternatives) the minimum following index (number) of the follow-up (i.e., the first in the group) control solution.

.Resolving the uncertainty by choosing from the group of analyzed solutions the maximum control solution according to the index of succession, we propose the following algorithm:

.

 The meaning of the proposed approach to resolving uncertainty is that from the group of considered (admissible) alternatives defined on the set of fully connected tolerance spaces that are linear and admissible for a particular analyzed control situation (class of situations), we choose, taking into account a priori knowledge, the specifics of the subject area one of the extreme (extreme) alternatives.

The binary vector (situation code S _t ) from the control object, for example, from a group of binary sensors installed on the object, is fed to the information inputs of input register 1. At the end of the search for the previous class of the situation S ^T at the inputs 2 ₁ - 2 _N (or on one of them) of the control unit 5, a signal appears with the level of a logical unit from blocks 2 ₁ -2 _N (or one of them) of the classification, opening the AND elements 14 ₁ - 14 _N (or one of them) in the control unit. On the trailing edge of the next pulse from the generator 7, the code of the estimated (identified) situation is written from the blocks 2 ₁ - 2 _N (or one of them) to the output registers 3 ₁ - 3 _N (or one of them) and the code of the current situation S _t in input register 1. If the code class of the current situation coincides with the class of the code of the situation recorded on the previous measure, then from blocks 2 ₁ - 2 _N (or one of them) the signal with the level of a logical unit is still received and the process repeats until the class of the current situation changes. All this time, the registers 3 ₁ - 3 _N output (or one of them) retains the previous code of the evaluated situation.

When changing the code of the current situation that changes the class of the situation, the logical unit is removed from the inputs 2 ₁ - 2 _N (or one of them) of block 6, the elements AND 14 ₁ - 14 _N (or one of them) are locked, stopping the recording of information in register 1 input and registers 3 ₁ -3 _N output (or one of them), and on the trailing edge of the signal at the outputs 1 ₁ - 1 _N (or one of them) of block 6, formed by elements OR 15 ₁ - 15 _N and elements AND 16 ₁ - 16 _N (or one of them), the content of the counters 12 ₁ - 12 _N (or one of them) is incremented per unit. Further, on the trailing edge of the pulses of the generator 7, coming through the elements And 16 ₁ - 16 _N (or one of them) to the outputs 1 ₁ -1 _{N of} block 6, the contents of the counters 12 ₁ - 12 _N (or one of them) addresses continues to increase, providing a sequential selection of information from the first 11 ₁ -11 _N , second 9 ₁ - 9 _N and third 13 ₁ - 13 _N memory blocks (or some of them).

из первого, второго и третьего блоков 11_j, 9_j, 13_j памяти выбираются вектор h $\genfrac{}{}{0ex}{}{\text{т}}{\text{j}}$ , вектор

и код оцененной ситуации S $\genfrac{}{}{0ex}{}{\text{т}}{\text{j}}$ соответственно. Аналогично в случае ситуации класса S $\genfrac{}{}{0ex}{}{\text{т}}{\text{j,j+1}}$ из первых 11_j, 11_j+1, вторых 9j, 9_j+1 и третьих 13_j, 13_j+1 блоков памяти выбираются векторы h $\genfrac{}{}{0ex}{}{\text{т}}{\text{j}}$ ,h $\genfrac{}{}{0ex}{}{\text{т}}{\text{j+1}}$ , вектор

, вектор

и коды оцененной ситуации

соответственно. И, наконец, в случае ситуации класса S $\genfrac{}{}{0ex}{}{\text{т}}{\text{1,...,N}}$ из первых 11₁ -11_N, вторых 9₁ - 9_N и третьих 13₁ - 13_N блоков памяти выбираются векторы h $\genfrac{}{}{0ex}{}{\text{т}}{\text{1}}$ , ... , h $\genfrac{}{}{0ex}{}{\text{т}}{\text{N}}$ , векторы f $\genfrac{}{}{0ex}{}{\text{т}}{\text{1}}$ , ... , f $\genfrac{}{}{0ex}{}{\text{т}}{\text{N}}$ и коды оцененной ситуации

соответственно. Вектор f $\genfrac{}{}{0ex}{}{\text{т}}{\text{j}}$ (или f $\genfrac{}{}{0ex}{}{\text{т}}{\text{1}}$ ,f $\genfrac{}{}{0ex}{}{\text{т}}{\text{2}}$ , ... ) поразрядно умножается на вектор текущей ситуации в блоке 10 (или 10₁, 10₂,...) сравнения, где происходит сравнение полученного вектора с вектором h $\genfrac{}{}{0ex}{}{\text{т}}{\text{j}}$ (или h $\genfrac{}{}{0ex}{}{\text{т}}{\text{1}}$ ,h $\genfrac{}{}{0ex}{}{\text{т}}{\text{2}}$ , ...), т.е. определение (идентификация) класса ситуации в соответствии с выражением (3).Moreover, for the class situation

from the first, second, and third blocks 11 _j , 9 _j , 13 _{j of} memory, the vector h $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ , vector

and code of the estimated situation S $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ respectively. Similarly, in the case of a class S $\genfrac{}{}{0ex}{}{\text{t}}{\text{j, j + 1}}$ of the first 11 _j , 11 _{j + 1} , second 9j, 9 _{j + 1} and third 13 _j , 13 _{j + 1} memory blocks, vectors h $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ h $\genfrac{}{}{0ex}{}{\text{t}}{\text{j + 1}}$ , vector

, vector

and codes of the assessed situation

respectively. And finally, in the case of a class S situation $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{1, ..., N}}$ from the first 11 ₁ -11 _N , the second 9 ₁ - 9 _N and the third 13 ₁ - 13 _N memory blocks, the vectors h $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{1}}$ , ..., h $\genfrac{}{}{0ex}{}{\text{t}}{\text{N}}$ vectors f $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{1}}$ , ..., f $\genfrac{}{}{0ex}{}{\text{t}}{\text{N}}$ and codes of the assessed situation

respectively. Vector f $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ (or f $\genfrac{}{}{0ex}{}{\text{t}}{\text{1}}$ f $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{2}}$ , ...) is bitwise multiplied by the current situation vector in the block 10 (or 10 ₁ , 10 ₂ , ...) comparisons, where the obtained vector is compared with the vector h $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ (or h $\genfrac{}{}{0ex}{}{\text{t}}{\text{1}}$ h $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{2}}$ , ...), i.e. definition (identification) of the class of situation in accordance with expression (3).

с вектором h $\genfrac{}{}{0ex}{}{\text{т}}{\text{j}}$ на выходе блока 10_j сравнения формируется сигнал с уровнем логической единицы, который разрешает запись кода ситуации S_t в регистр 3_j вывода и запись кода новой ситуации S_t′ в регистр 1 ввода. После этого процесс повторяется.Counters 12 ₁ - 12 _N addresses work cyclically, providing sequential sampling of all vectors h $\genfrac{}{}{0ex}{}{\text{t}}{}$$\genfrac{}{}{0ex}{}{}{\text{1}}$ , ..., h $\genfrac{}{}{0ex}{}{\text{t}}{\text{N}}$ , vectors f $\genfrac{}{}{0ex}{}{\text{<figure-callout id="1" label="t" filenames="00000028.png,00000031.png" state="{{state}}">t</figure-callout>}}{\text{1}}$ , ..., f $\genfrac{}{}{0ex}{}{\text{t}}{\text{N}}$ and all situation codes S $\genfrac{}{}{0ex}{}{\text{<figure-callout id="1" label="t" filenames="00000028.png,00000031.png" state="{{state}}">t</figure-callout>}}{\text{1}}$ , ..., S $\genfrac{}{}{0ex}{}{\text{t}}{\text{N}}$ . When the vector matches

with vector h $\genfrac{}{}{0ex}{}{\text{t}}{\text{j}}$ at the output of the comparison unit 10 _j , a signal is generated with a logical unit level, which allows writing the situation code S _t into the output register 3 _j and writing the new situation code S _{t ′} into the input register 1. After that, the process is repeated.

 The choice of a control solution for the identified situation code is carried out in accordance with the algorithm (7) - (8) in blocks 5 and 6, the specific implementation of which for the case under consideration is shown in Figs. 4 and 5.

Таким образом, введением в устройство группы из N-1 регистров вывода, группы из N-1 блоков классификации, элемента ИЛИ и блока выбора управляющих решений, включающего M групп элементов И и группу из M элементов ИЛИ, и связей, а также путем изменения блока управления достигается существенное расширение области применения устройства за счет возможности осуществления автоматически выбора управляющих решений на множестве различных полносвязных пространств толерантности, сопряженных к линейной структуре.The proposed device is configured for a specific subject area of control by setting for each situation S _t encountered in the description of the control object its own code (identifier) of the situation and the corresponding code for the control solution. These codes are not written directly to memory, but are grouped into tolerance classes in accordance with the accepted classification scheme and choice of control decisions. For each group (class) of situations, characteristic vectors are calculated:

Thus, by introducing into the device a group of N-1 output registers, a group of N-1 classification blocks, an OR element, and a control decision selection block, including M groups of AND elements and a group of M OR elements, and relationships, as well as by changing the block The control achieves a substantial expansion of the scope of the device due to the possibility of automatically selecting control decisions on a variety of different fully connected spaces of tolerance associated with a linear structure.

Claims (3)

 1. A device for situational control, comprising an input register, a first output register, a control unit, a clock, a first classification unit that contains an AND element, three memory units, a comparison unit and an address counter, the counting input of which is the counting input of the classification unit, the outputs of the address counter are connected to the corresponding inputs of the memory blocks, the outputs of the first memory block are connected to the first group of inputs of the And element, the second group of inputs of which is the group of information inputs of the block assimilation, the group of outputs of the And element is connected to the first group of inputs of the comparison block, the output of which is the clock output of the classification block, the second group of inputs of the comparison block is connected to the outputs of the second memory block, the outputs of the third memory block are a group of information outputs of the classification block, and the input information of the input register is the input of the device, and the outputs are connected by the corresponding information inputs of the first classification block, the clock output of which is connected to the corresponding the clock input of the first group of inputs of the control unit, the synchronization input of which is connected to the output of the clock generator, the information outputs of the first classification block are connected respectively to the information inputs of the first output register, the outputs of which are the first outputs of the device, the counting input of the first classification block is connected to the corresponding output of the first group control unit, the outputs of the second group of which are connected to the corresponding clock inputs of the first output register, I distinguish which consists of a group of N 1 output registers, a group of N 1 classification blocks, an OR element, and a control decision selection block, the information inputs of the group classification blocks being connected to the corresponding outputs of the input register, the clock outputs of the group classification blocks are connected to the corresponding clock inputs of the first group of inputs of the control unit, the information outputs of the classification blocks of the group are connected respectively with the information inputs of the output registers of the group, the counting inputs of the blocks to group assignments are connected to the corresponding outputs of the first group of the control unit, the outputs of the second group of which are connected to the corresponding clock inputs of the group output registers, the inputs of the block of decisions of the controlled solutions are connected respectively to the clock outputs of the blocks of classification, the outputs of the block of the choice of control decisions are connected to the clock inputs of the second group of the control block , the outputs of the second group of which are connected to the inputs of the OR element, the output of which is connected to the clock input of the input register. 2. The device according to p. 1, characterized in that the control decision selection block contains M groups of elements AND, respectively, two, three, M inputs and a group of M elements OR at N-M inputs, with each i-th input of the block connected to i-th, (i 1) -th, (i 2) -th, [i - (М 1)] - th element And of the j-th group of elements, where

the outputs of the AND elements of each j-th group are connected respectively to the i-th inputs of the corresponding i-th OR element, the outputs of the OR elements are outputs of the control decision selection block. 3. The device according to p. 1, characterized in that the control unit contains a group of N elements OR, two groups of N elements AND and a group of N elements FORBID on M 1 inputs, and the synchronization input of the block is connected to the first inputs of the elements OR groups and elements of the first and second groups, and the clock inputs of the first group are connected respectively to the second inputs of the elements of the first group and OR elements, the outputs of the elements of the OR group are connected respectively to the second inputs of the elements of the second group, the outputs of which are the outputs of the first group Lok, and outputs elements of the first group are connected to the enabling input with inverted respective elements whose outputs are the outputs of the second block group, each i-th

the clocking input of the second group of the block is connected to the inhibitory inputs of each of the N elements of the PROHIBITION group, except for the same name.

Images