The invention is particularly intended for the field of controlling industrial facilities notably driven by wired or programmed logic controllers.
However, although particularly intended for such applications, the invention may also be used in very many other fields where one seeks to link and classify variables of a cyclically-operating system according to subunits of said system.
Presently, the majority of industrial facilities are driven by controllers. The latter comprise an input module for monitoring the state of the variables corresponding to the sensors of the system of the driven industrial facility and an output module for controlling the actuators of said system. These input/output modules are connected on a peripheral bus connected to a central processing unit delivering commands for controlling said system.
Devices or interfaces are already known from notably Patent FR No 2,688,908, providing for communication with programmable controllers, these devices or interfaces include means for recording and dating the state of the variables of a system. This being the case, none of the known devices or interfaces allow the variables to be classified by group each corresponding to one or several subunits of the system.
Now the classification of variables into groups proves to be very useful notably for optimizing operation of the facility as it allows an analysis of the operations of each subunit and of the subunits together.
In practice, when it is necessary to group together the variables of a same subunit of the system, the recording of the states of the variables serves as a basis for the operator and from knowing or observing the system, he/she empirically manages to link up the sensors and their variables into subunits. This operation, for which there is no standard procedure, is all the longer since the complexity of the operating cycles of each subunit is higher or the number of variables is larger.
Moreover, in many cases, the system of the facility is partly or totally hidden which makes the task of the operator all the more complicated and may impose the disassembling of at least one portion of the facility.
The object of the present invention is to overcome the aforementioned drawbacks and to propose a method for classifying two-state variables of a cyclically-operating system including subunits wherein the classification of the variables into groups is automated.
Another object of the present invention is to propose a classification method with which the subunit(s) of the relevant group may be determined in the case of failure or malfunction of the system.
Another object of the present invention is to propose a classification method with which the beginning and the end of the operating cycle of each subunit may be determined.
Another object of the present invention is to propose a classification method with which the duration of working times and loading times of each subunit may be determined.
Another object of the present invention is to propose a classification device for implementing the method as an interface which may be connected or integrated to a controller.
Thus, the object of the invention is a method for classifying two-state variables of a cyclically operating system including subunits. According to the invention the following steps are achieved in said method:
The invention is further directed at a classification device for implementing the method, said device including:
Other features and advantages of the invention will become more apparent upon reading the description hereafter of a preferred exemplary embodiment, wherein the description is only given as a non-limiting example, and with reference to the appended drawings wherein:
The classification device and method are suitable for facilities including a complex system. This being the case, in order to facilitate the understanding of the different steps of the method, the exemplary embodiment, which is only provided as a non-limiting example, is based on a relatively basic facility.
Thus, with reference to
According to the example of
Referring to
According the example of
Referring this time to
With the classification method according to the invention the variables Mo, De, pp, h, m, b, pf, Av, Rec, a and r, may be classified in groups corresponding to two subunits, that of the drill 2 and that of the milling machine 3 from the sole dated states of the variables.
For this purpose, the method includes a recording step wherein the dated state changes of each of said variables are recorded during a determined time T. This time T depends on the operating cycle times of the subunits and should be sufficient to allow the recording of the variables for at least two operating cycles of each subunit. In practice, time T may allow the variables to be recorded for a significant number of operating cycles of each subunit.
This time diagram will subsequently be used in order to understand the operation of the method for classifying the variables, however, in practice, the data will be recorded by recording means in view of their being automatically processed, their display as a time diagram being optional.
The classification method further comprises a calculation step wherein from the dated state changes and for each of the variables, the different durations D1 between two consecutive passages to a first state (E1) on the one hand, and the different durations D2 between two consecutive passages to a second state (E2) on the other hand, are determined in order to create duration lists LD1 and LD2.
By again taking the example of the facility of
LD1.
Mo=(6, 11, 6, 16, 6)
De=(4, 13, 4, 18, 4, 16, 4)
pp=(17, 22, 20)
h=(8, 9, 8, 14, 8)
m=(4, 4, 9, 4, 4, 14, 4, 4, 12)
b=(17, 22, 20)
Av=(17, 20, 20, 24)
Rec=(17, 20, 20, 24)
a=(17, 20, 20, 24)
r=(15, 17, 25, 15, 24)
pf=(17, 20, 20, 24)
LD2
Mo=(8, 9, 8, 14, 8)
De=(6, 16, 6, 16, 6)
pp=(17, 22, 20)
h=(4, 13, 4, 18, 4, 16)
m=(4, 4, 9, 4, 4, 14, 4, 4, 12)
b=(17, 22, 20)
Av=(17, 20, 20, 24)
Rec=(17, 25, 15, 24)
a=(17, 20, 20, 24)
r=(p17, 20, 20, 24)
pf=(17, 25, 15, 24)
According to the invention, the classification method comprises a processing step wherein for each variable the different lists of durations LD1 and/or LD2 are compared to different lists of durations LD1 and/or LD2 of the other variables, and the number of occurrences thereof in order to classify said variables into groups each corresponding to at least one of the subunits of said system.
With reference to
Said processing step begins with an operation for creating at least one group of order n, each group including one or a set of variables with a close number of occurrences.
Each group is formed by counting the number of occurrences of each variable. When two variables have a number of occurrences more or less identical with a number X of occurrences, they are placed in the same group.
In the example of the facility 1 described above, by recording during a period corresponding to C operating cycles, a number of occurrences close to C will be obtained for b, pp, pf, Av, Rec, a and r, a number of occurrences close to 2C for Mo, De, h and a number of occurrences close to 3C for m.
It is considered that the number of reference cycles is the number of occurrences of the variables of the most significant group.
At this level, providing an operation for eliminating possible out-of-cycle variables may be contemplated. These may notably be variables reporting the activity of subsidiary elements such as indicator lights in an industrial facility. For this purpose, in a preferred embodiment, the set of variables for which the number of occurrences is larger than k times the number of reference cycles or less than k′ times this reference number may be eliminated.
When the groups are formed, it is considered that the group including the smallest number of occurrences is of order 1, an order n is then assigned to the other groups, such that the average number of occurrences of a group of order n is equal to n times the number of occurrences of the group of order 1.
If one or more groups are not multiples of the group of order 1, another group list is created and for each other group list, the same operations are performed as for the set of the groups of a same list.
In the example of the facility 1, three groups are found:
The processing step further comprises for each group an operation for creating at least one set in which the variables are linked.
A set is created by comparing in each group, the LD1 and/or LD2 terms of each variable, with the terms of the same row in the LD1 and/or LD2 of the other variables. A set is formed with the variables for which the lists are identical and it may consist of a single isolated variable.
It is considered that two lists of two variables are identical if the durations of the terms of each row are identical to within plus or minus ? or if the difference is ?, and then −? at the following row and again becomes identical to within plus or minus ?.
At this level, it is important to emphasize that in a preferred embodiment, the comparisons between two variables in order to create sets in a same group or sets of a same group together, or even sets of different groups, are performed by achieving with the processing means:
This being the case, in other embodiments, it is conceivable not to perform these three comparisons, and for example only to compare the list LD1 of one variable with the list LD2 of the other variable.
By again taking the example, in group G1, the list LD1 of one variable is compared with the list LD2 of another variable, and two sets are obtained.
The first set EN1 groups variables b and pp, the second EN2 groups variables pf, Av, Rec, a and r.
Example of identical lists:
LD1 (b)=17, 22, 20 and LD2 (pp)=17, 22, 20, therefore b and pp belong to the same set,
LD1 (a)=17, 20, 22, 24 and
LD2 (Rec)=17, 25(20+5), 15(20−5), 24 with ?=5, therefore a and Rec belong to the same set.
Next, the comparison between the lists LD1 of one variable and LD1 of the other variables and then LD2 of one variable and LD2 of another variable is performed, by which the sets may be confirmed and possibly two sets may be linked together.
Next, one proceeds in the same way for the other groups and a single set EN3 grouping variables h, De, and Mo is obtained for group G2 and a set EN4 is obtained for group G3 which only contains a single variable.
Said processing step further includes an operation for comparing each set in a same group and the union of the sets when two variables each belonging to one of the sets are linked.
The comparison between sets of a same group is performed by calculating lists LDd of shifted durations. These lists LDd are obtained by removing the first row term for example from a list LD1 and by shifting the other values by one row in order to obtain a list LD1d of durations shifted by one row. The maximum shift for a shifted list is a shift of n rows by removing the n first terms of the duration lists for a group of order n.
Thus, a variable from a set of a group is compared with a variable in each of the other sets of the same group, and in the case of identity, the sets including the variables having identical lists, and for example LD1d of one of the variables and LD2 of the second variable, are united.
The comparison between sets of a same group is also performed by calculating duration sum lists LSD in order to unite the sets together once again.
These lists are obtained by adding, for a group of order n, the first n terms of the duration lists, the value of which becomes that of the first term of the duration sum list LSD and then by continuing with the following n terms until there remains less than n terms in the duration list.
By taking as an example, the variable Mo which is found in a group of order 2 and with LD1 (Mo)=6, 11, 6, 16, 6, the duration sum list LSD1 is equal to 17, 22.
The comparison between sets of a same group is also performed by calculating shifted duration sum lists LSDd which are obtained from the duration sum lists in the same way as the shifted duration lists from the duration lists D1 and/or D2. The maximum shift for a shifted sum list is n rows by removing the first n terms of the duration lists for a group of order n.
Thus, one variable belonging to a set is compared with another variable for each other set of the same group by comparing:
The processing step also comprises an operation for comparing the sets of a group with the sets of each other group, and the union of the sets in a group when two variables each belonging to one of the sets, are linked.
For this purpose, one variable belonging to a set of a group is compared with another variable of each set of each other group by comparing:
By again taking the described example, this allows the sets EN1, EN3 and EN4 to be united into a group from comparisons of variables De and m.
Set EN1 belongs to a group of order 1 and LD2(b)=17, 22, 20.
Set EN3 belongs to a group of order 2 and LD1(De)=(4, 13, 4, 18, 4, 16, 4), a list LSD1d, a duration sum list D1 shifted by one row, equal to 17, 22, 20 is obtained for variable De.
Set EN4 belongs to a group of order 3 and LD2(m)=(4, 4, 9, 4, 4, 14, 4, 4, 12), a duration D1 sum list LSD1(m) equal to 17, 22, 20 is thereby obtained for variable m.
Therefore LD2(b) is identical with LSD1d(De) identical with LSD1(m).
A first group grouping sets EN1, EN3 and EN4, i.e., variables b, pp, h, De, Mo and m, and a second group consisting of set EN2 i.e., variables pf, Av, Rec, a and r, are therefore obtained.
Therefore two groups are obtained, each corresponding to at least one subunit of the system with the first group for the “drill” subunit and the second group for the “milling machine” subunit.
At this level, it should be reported that a group may contain variables corresponding to several subunits, the operations of which are linked. In order to discriminate these subunits, the method, in an alternative embodiment, comprises a step for stopping or changing the operation of one or more subunits so as to distinguish the variables of one subunit with respect to another subunit, the operating cycles of which are linked. Provision may also be made for discriminating the subunits by constantly monitoring the system in its operation, and by waiting for failures of the subunits of the latter.
The classification method further comprises a step for tracking the beginning and the end of the operating cycle of each group. Said tracking step may be performed in various ways, from the groups obtained from the earlier steps and the duration lists D1 and D2 of the different variables.
According to the method, tracking is performed for each group:
According to the example of
In the example of the facility 1, the order of appearance of the variables, for the first group, is the following: pp, De, m, Mo, h and b.
The method consists of then performing the selection of a given number of the most significant durations D1 or D2 of the group. Again taking the example of facility 1, the most significant durations D1 are 22, 20 and 17.
The method then consists of calculating time jumps between the appearance of each new variable of the set by examining the moment when the duration between two consecutive passages for the first variable which has appeared is one of the selected durations and by repeating the calculation for the set of selected durations. With reference to the time diagram of
The method then consists of recording the states (E1) or (E2) of each variable associated with the most significant time jumps calculated for each of the selected durations. In the facility 1 for the first group and for durations D1=22 and then 20 and 17, variables pp are again found in a state E2, Mo in a state E2 and h in a state E1 every time before the most significant duration jump.
After the most significant duration jump for each selected duration D1, the variables pp are again found in a state E1, De in a state E1 and h in a state E2.
The method then consists of selecting the most frequent case wherein the minimum number of variables is in a state (E1) or in a state (E2) in order to determine the beginning and the end of the group's cycle. In the case of facility 1, the minimum number of variables in state E1 will be selected.
Considering that, for the first group, the same result is obtained for the three selected durations D1, the cycle of this group begins when the variables pp are in a state E1, De in a state E1 and h in a state E2, and the cycle ends when the variables pp are in a state E2, Mo in a state E2 and h in a state E1.
It is important to note that, in the case when there is no most frequent case, it will be possible to inform the operator on the different cases obtained by the method for the beginnings and ends of cycle for each group with, in a preferred embodiment, the frequency percentages for each of these cases.
For the second group, by proceeding as for the first group, a most frequent case is also obtained with which a beginning of cycle may be inferred when the variables pf and Av are in an E1 state and variable r in an E2 state, and an end of cycle when the variables Rec and pf are in an E2 state and r in an E1 state.
From the data for the beginning and the end of cycle and from the different durations D1, it is further possible to calculate the durations of the operating and working cycles. The operating cycle duration according to a preferred embodiment is determined from a variable for the beginning of a cycle belonging to a group of order n and by calculating its n+1th appearance in the state in which it was found at the beginning of the cycle.
In the facility 1, variable h is taken for example, which belongs to a group of order 2 and which appears for the first time at the beginning of the cycle in a state E2. The duration between the appearance of this variable at the beginning of the cycle and its third appearance in the E2 state, is equal to the duration of the operating cycle.
The working cycle duration is itself determined, preferably from a variable of the beginning of the cycle belonging to a group of order n, and by calculating its nth appearance in the state opposite to the one in which it was found at the beginning of the cycle. The actual cycle time may also be determined for each subunit, the actual cycle time corresponding to the smallest D1 of a variable of the subunit larger than the working cycle duration.
By again taking variable h, the working cycle duration is the duration between the appearance of the state E2 of this variable at the beginning of the cycle, and its second appearance in the state E1.
The actual cycle time is the smallest operating cycle larger than the working cycle duration.
In this way, an operating cycle duration of 17 and a working cycle duration of 12 are obtained for the first group.
In the same way, an operating cycle duration of 17 and a working cycle duration of 12 are obtained for the second group.
With the classification method, it is thereby not only possible to classify variables in groups corresponding to at least one subunit of the system but it is further possible to determine for each group the beginnings and the ends of the operating cycle as well as the duration of the operating and working cycles.
It is important to note that with the classification method it is also possible to take into account numerical variables with more than two states in order to determine the subunits to which belong these variables. For this purpose, a step is performed wherein a given number of two-state variables is created from a numerical variable with more than two states, so as to classify said variables created in a group. As a non-limiting example, four two-state variables may be created for a numerical variable with more than two states, with the first variable switching for the numerical value passing through a maximum, a second variable switching for the numerical value passing through a minimum, a third variable switching for the numerical value passing through zero while increasing and a fourth variable switching for the numerical value passing through zero while decreasing.
Of course, other embodiments within the capacity of one skilled in the art might have been contemplated without however departing from the scope of the invention as defined in the claims hereafter.
Number | Date | Country | Kind |
---|---|---|---|
03/05793 | May 2003 | FR | national |
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/FR04/01148 | 5/11/2004 | WO | 1/20/2006 |