CN115875141B - Cylinder deactivation path determining method, device, equipment and storage medium - Google Patents
Cylinder deactivation path determining method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN115875141B CN115875141B CN202310153454.1A CN202310153454A CN115875141B CN 115875141 B CN115875141 B CN 115875141B CN 202310153454 A CN202310153454 A CN 202310153454A CN 115875141 B CN115875141 B CN 115875141B
- Authority
- CN
- China
- Prior art keywords
- cylinder deactivation
- matrix
- cyclic
- cyclic matrix
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/12—Improving ICE efficiencies
Landscapes
- Combined Controls Of Internal Combustion Engines (AREA)
Abstract
The invention discloses a cylinder deactivation path determining method, device, equipment and storage medium. The cylinder deactivation path determining method comprises the following steps: for two groups of alternative cylinder deactivation cyclic matrixes with different cylinder deactivation numbers, marking a set formed by the alternative cylinder deactivation cyclic matrixes with smaller cylinder deactivation numbers as a first cyclic matrix set, and marking a set formed by the alternative cylinder deactivation cyclic matrixes with larger cylinder deactivation numbers as a second cyclic matrix set; calculating the cost value of each first cyclic matrix in the first cyclic matrix set, switching each first cyclic matrix into each second cyclic matrix in the second cyclic matrix set, marking the cost value sets as first cost value sets, calculating the cost value of each second cyclic matrix, switching each second cyclic matrix into each first cyclic matrix, and marking the cost value sets as second cost value sets; and selecting an optimal cylinder deactivation cycle matrix under each cylinder deactivation number from the alternative cylinder deactivation cycle matrices according to the first generation value set and the second cost value set.
Description
Technical Field
The embodiment of the invention relates to an engine control technology, in particular to a cylinder deactivation path determining method, device and equipment and a storage medium.
Background
The cylinder deactivation technology (Cylinder deactivation, CDA) is a variable displacement technology of an engine, and if the cylinder deactivation technology is adopted to realize engine control, when the engine runs under partial load, the related mechanism cuts off the fuel supply, ignition, air intake and exhaust of partial cylinders and stops the work of the engine, so that the load rate of the residual working cylinders is increased, the combustion efficiency is improved, the fuel consumption is reduced, and the exhaust temperature is improved.
At present, a cylinder deactivation cycle matrix is generally used for representing an engine cylinder deactivation mode, namely, cylinder deactivation control of an engine is realized by referring to the cylinder deactivation cycle matrix, and the cylinder deactivation cycle matrix is reasonably selected, so that the cylinder deactivation cycle matrix is a necessary condition for improving the temperature discharge, oil consumption, NVH (Noise, vibration, harshness, noise, vibration and harshness) and reliability of the engine in low-load and variable-load operation, but a method for quickly and accurately determining a globally optimal cylinder deactivation cycle matrix under each cylinder deactivation number and an optimal entrance and exit when the cylinder deactivation cycle matrix is mutually switched is lacked in the prior art.
Disclosure of Invention
The invention provides a cylinder deactivation path determining method, device, equipment and storage medium, so as to achieve the purpose of rapidly and accurately determining a cylinder deactivation cycle matrix.
In a first aspect, an embodiment of the present invention provides a method for determining a cylinder deactivation path, including:
determining an alternative cylinder deactivation cycle matrix;
for two groups of alternative cylinder deactivation cyclic matrixes with different cylinder deactivation numbers, marking a set formed by the alternative cylinder deactivation cyclic matrixes with smaller cylinder deactivation numbers as a first cyclic matrix set, and marking a set formed by the alternative cylinder deactivation cyclic matrixes with larger cylinder deactivation numbers as a second cyclic matrix set;
calculating the cost value of each first cyclic matrix in the first cyclic matrix set, switching to each second cyclic matrix in the second cyclic matrix set, and recording the cost value sets as first cost value sets;
calculating the cost value of each second cyclic matrix switched to each first cyclic matrix, and recording a set of the cost values as a second cost value set;
determining a third generation value set according to the first generation value set and the second cost value set;
and selecting an optimal cylinder deactivation cycle matrix under each cylinder deactivation number from the alternative cylinder deactivation cycle matrices based on the third generation value set.
Optionally, determining a third generation value set according to the first generation value set and the second cost value set includes:
The cost value of switching one first cyclic matrix to one second cyclic matrix is marked as a first generation value, and the cost value of switching the same second cyclic matrix to the same first cyclic matrix is marked as a second generation value;
and the third generation value set comprises a third generation value corresponding to the same first cyclic matrix and the same second cyclic matrix, wherein the third generation value is the sum of the first generation value and the second generation value.
Optionally, based on the third generation value set, selecting an optimal cylinder deactivation cycle matrix under each cylinder deactivation number from the candidate cylinder deactivation cycle matrices includes:
and based on the third generation value set, determining an optimal switching path when sequentially switching from the minimum cylinder deactivation number to the maximum cylinder deactivation number by adopting a shortest path search algorithm, and taking the alternative cylinder deactivation cycle moment on the optimal switching path as the optimal cylinder deactivation cycle matrix.
Optionally, the alternate cylinder deactivation cycle matrix includes at least two row vectors, except that all engine cylinders fire and all engine cylinders do not fire;
the number of elements in the row vector is the same as the total number of cylinders of the engine.
Optionally, the elements in the row vector include a first element and a second element;
the first element indicates that the engine cylinder fires, and the second element indicates that the engine cylinder does not fire;
in the alternative cylinder deactivation cyclic matrix, the sum of the first element and the second element in each row vector is recorded as a first element sum, and the first element sums of different row vectors are corresponding to the same;
the sum of the first element and the second element in each column vector is noted as a second element sum, and the second element sums of different column vectors are correspondingly identical.
Optionally, each row vector of the first cyclic matrix is denoted as a first row vector, and each row vector of the second cyclic matrix is denoted as a second row vector;
calculating the dynamic response value of each first row vector switched to each second row vector, and recording the dynamic response value as a first dynamic response value set;
determining a first optimal dynamic response value in the first set of dynamic response values as a first generation value for the first cyclic matrix to switch to the second cyclic matrix;
calculating the dynamic response value of each second row vector switched to each first row vector, and recording the dynamic response value as a second dynamic response value set;
And determining a second optimal dynamic response value in the second dynamic response value set as a second cost value of switching the second cyclic matrix to the first cyclic matrix.
Optionally, the dynamic response value includes a crankshaft torsional stress amplitude and a crankshaft front end angular velocity fluctuation amount.
In a second aspect, an embodiment of the present invention further provides a cylinder deactivation path determining apparatus, including a cylinder deactivation path determining unit configured to:
determining an alternative cylinder deactivation cycle matrix;
for two groups of alternative cylinder deactivation cyclic matrixes with different cylinder deactivation numbers, marking a set formed by the alternative cylinder deactivation cyclic matrixes with smaller cylinder deactivation numbers as a first cyclic matrix set, and marking a set formed by the alternative cylinder deactivation cyclic matrixes with larger cylinder deactivation numbers as a second cyclic matrix set;
calculating the cost value of each first cyclic matrix in the first cyclic matrix set, switching to each second cyclic matrix in the second cyclic matrix set, and recording the cost value sets as first cost value sets;
calculating the cost value of each second cyclic matrix switched to each first cyclic matrix, and recording a set of the cost values as a second cost value set;
Determining a third generation value set according to the first generation value set and the second cost value set;
and selecting an optimal cylinder deactivation cycle matrix under each cylinder deactivation number from the alternative cylinder deactivation cycle matrices based on the third generation value set.
In a third aspect, an embodiment of the present invention further provides an electronic device, including at least one processor, and a memory communicatively connected to the at least one processor;
the memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor, so that the at least one processor can execute the cylinder deactivation path determining method according to the embodiment of the present invention.
In a fourth aspect, an embodiment of the present invention further provides a computer readable storage medium, where the computer readable storage medium stores computer instructions, where the computer instructions are configured to cause a processor to implement the cylinder deactivation path determining method according to the embodiment of the present invention when executed.
Compared with the prior art, the invention has the beneficial effects that: the invention provides a cylinder deactivation path determining method, which comprises the steps of marking each alternative cylinder deactivation cyclic matrix with smaller cylinder deactivation number as a first cyclic matrix, and marking each alternative cylinder deactivation cyclic matrix with larger cylinder deactivation number as a second cyclic matrix; calculating the cost value of each first cyclic matrix switched to each second cyclic matrix, marking the cost value as a first generation value set, and calculating the cost value of each second cyclic matrix switched to each first cyclic matrix, marking the cost value as a second cost value set; by determining cost values of the cylinder deactivation number in two directions from small to large and from large to small, all possible cost values of switching during cylinder deactivation mode switching can be determined, and further accuracy and effectiveness in the process of determining an optimal cylinder deactivation cycle matrix by means of the first generation value and the second cost value are guaranteed;
According to the method, the third generation value set is determined according to the first generation value set and the second cost value set, based on the third generation value set, one optimal cylinder deactivation cycle matrix under each cylinder deactivation number is selected from the alternative cylinder deactivation cycle matrices, the first generation value set and the second cost value set are combined to form the third generation value set, the switching directionality between the alternative cylinder deactivation cycle matrices can be eliminated, meanwhile, the cost characteristic in the switching according to the direction is reserved, and the optimal cylinder deactivation cycle matrix is determined based on the third generation value set, so that operation can be simplified, and accuracy and reliability of a result can be guaranteed.
Drawings
FIG. 1 is a flow chart of a cylinder deactivation path determination method in an embodiment;
FIG. 2 is a schematic diagram of an alternative cylinder deactivation cycle matrix in an embodiment;
FIG. 3 is a flow chart of an alternative cylinder deactivation cycle matrix determination method in an embodiment;
FIG. 4 is a directed graph model schematic diagram in an embodiment;
FIG. 5 is a schematic diagram of a diagram model in an embodiment;
FIG. 6 is a schematic diagram of yet another diagram model in an embodiment;
fig. 7 is a schematic diagram of the structure of an electronic device in the embodiment.
Detailed Description
The invention is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting thereof. It should be further noted that, for convenience of description, only some, but not all of the structures related to the present invention are shown in the drawings.
Example 1
FIG. 1 is a flowchart of a cylinder deactivation path determining method in an embodiment, referring to FIG. 1, the cylinder deactivation path determining method comprising:
s101, determining an alternative cylinder deactivation cycle matrix.
Illustratively, in this embodiment, the alternative cylinder deactivation cycle matrix includes at least one row vector, where the number of elements in the row vector is the same as the total number of cylinders of the engine;
the row vector is used for representing a cylinder deactivation control mode under the number of cylinder deactivation (for example, when the number of cylinder deactivation is 2, one cylinder deactivation control mode can be for controlling cylinder deactivation of No. 1 and No. 3, and the other cylinder deactivation control mode can be for controlling cylinder deactivation of No. 2 and No. 4);
in the same alternative cylinder deactivation cycle matrix, the cylinder deactivation numbers represented by different row vectors are the same, and the cylinder deactivation control modes can be the same or different.
Illustratively, in the present embodiment, the alternative cylinder deactivation cycle matrix includes a cylinder deactivation cycle matrix for all possible cylinder deactivation numbers, wherein the alternative cylinder deactivation cycle matrix for one cylinder deactivation number may include one or more cylinder deactivation cycle matrices;
for example, for the case of a number of cylinder deactivation of 3, 4, 5, 6, the number of corresponding alternative cylinder deactivation cycle matrices may be 10, 2, 6, 1, respectively.
For example, in this embodiment, for an alternative cylinder deactivation cycle matrix with a number of cylinders deactivated, the alternative cylinder deactivation cycle matrix includes an optimal cylinder deactivation cycle matrix, where the optimal cylinder deactivation cycle matrix is used to determine a cylinder deactivation control manner adopted during actual driving.
In this embodiment, the method for determining the alternative cylinder deactivation cycle matrix is not particularly limited, and the alternative cylinder deactivation cycle matrix may be obtained in any manner known in the art.
Illustratively, in the present embodiment, if the cylinder deactivation numbers are ordered by size, the two adjacent cylinder deactivation numbers differ by 1.
S102, aiming at two groups of alternative cylinder deactivation cyclic matrixes with different cylinder deactivation numbers, marking a set formed by the alternative cylinder deactivation cyclic matrixes with smaller cylinder deactivation numbers as a first cyclic matrix set, and marking a set formed by the alternative cylinder deactivation cyclic matrixes with larger cylinder deactivation numbers as a second cyclic matrix set.
S103, calculating the cost value of each first cyclic matrix in the first cyclic matrix set to each second cyclic matrix in the second cyclic matrix set, and recording the cost value sets as first cost value sets.
S104, calculating the cost value of each second cyclic matrix switched to each first cyclic matrix, and recording the collection of the cost values as a second cost value collection.
Taking two groups of alternative cylinder deactivation cycle matrixes with the cylinder deactivation numbers of 4 and 5 as an example to calculate a first generation value set and a second cost value set between the two groups of alternative cylinder deactivation cycle matrixes with the cylinder deactivation numbers different by one in combination with the steps S103 and S104;
Setting the number of the alternative cylinder deactivation cyclic matrixes with the cylinder deactivation number of 4 to be 2, namely correspondingly comprising 2 first cyclic matrixes;
the number of the alternative cylinder deactivation circulation matrixes with the cylinder deactivation number of 5 is 6, namely 6 second circulation matrixes are correspondingly included;
calculating cost values when each first cyclic matrix is respectively switched to 6 second cyclic matrices, and marking the generated first generation value sets as D45_1 and D45_2;
and calculating cost values when each second cyclic matrix is respectively switched to 2 first cyclic matrices, and recording the generated second cost value sets as D54_1-D54_6.
Illustratively, in the present embodiment, the expression of d45_i may be represented by the following formula:
D45_i={d45i_1、d45i_2…d45i_6}
wherein d45i_j represents a cost value when the ith first cycle matrix with the cylinder deactivation number of 4 is switched to the jth second cycle matrix with the cylinder deactivation number of 5;
the expression d54_i can be expressed by the following formula:
D54_i={d54i_1、d54i_2}
wherein d4i_j represents the cost value when the ith second cycle matrix with the number of cylinder deactivation being 5 is switched to the jth first cycle matrix with the number of cylinder deactivation being 4.
For example, in this embodiment, if the number of all cylinder deactivation is set to be 3, 4, 5, and 6, and the number of corresponding alternative cylinder deactivation cycle matrices is set to be 10, 2, 6, and 1, respectively, the first generation value set obtained after this step should include:
D34_1~ D34_10，D34_i={d34i_1、d34i_2}；
D45_1~D45_2，D45_i={d45i_1、d45i_2…d45i_6}；
D56_1~D56_6，D56_i={d56i_1}；
The second set of cost values should include:
D65_1，D65_1={d651_1、d651_2…d651_6}
D54_1~ D54_6，D54_i={d54i_1、d54i_2}；
D43_1~D43_2，D43_i={d43i_1、d43i_2…d43i_10}。
in this embodiment, the manner of determining the cost value is not specifically limited, for example, an engine dynamics parameter (for example, a torsional vibration stress amplitude of a crankshaft or a fluctuation amount of an angular velocity of a front end of the crankshaft) may be selected, and when it is determined through simulation calculation or test, a value or a variation amount of the engine dynamics parameter is determined when the cylinder deactivation control is switched from the cylinder deactivation control according to one alternative cylinder deactivation cycle matrix to the cylinder deactivation control according to another alternative cylinder deactivation cycle matrix, so as to determine the corresponding cost value.
S105, determining a third generation value set according to the first generation value set and the second cost value set.
In this embodiment, the determining the third generation value set according to the first generation value set and the second cost value set specifically includes:
the cost value of switching a first cyclic matrix to a second cyclic matrix is marked as a first generation value, and the cost value of switching the same second cyclic matrix to the same first cyclic matrix is marked as a second generation value;
the third generation value set comprises values of the first generation value and the second cost value calculated according to a preset rule, wherein the third generation value corresponds to the same first cyclic matrix and the same second cyclic matrix.
In this embodiment, the preset rule may be: and performing sum operation or selecting the maximum value in the sum operation and the maximum value, and adopting other reasonable preset rules according to the concerned indexes.
For example, on the basis of the contents of step S103 and step S104, when the total number of cylinder deactivation is 3, 4, 5, and 6, and the number of corresponding alternative cylinder deactivation cycle matrices is 10, 2, 6, and 1, respectively, the third generation value set should include:
e34 E34= { e34_1_1, e34_2_1 … e34_10_1, e34_1_2, e34_2_2 … e34_10_2}, wherein e34_i_j represents the third generation value when switching between the i-th cylinder deactivation cycle matrix of 3 and the j-th cylinder deactivation cycle matrix of 4;
e45 E45= { e45_1_1, e45_1_2 … e45_1_6, e45_2_1, e45_2_2 … e45_2_6}, wherein e45_i_j represents the third generation value when switching between the i-th cylinder deactivation cycle matrix of 4 and the j-th cylinder deactivation cycle matrix of 5;
e56 E56= { e56_1_1, e56_2_1 … e56_6_1}, wherein e56_i_j represents the third generation value when switching between the i-th cylinder deactivation number 5 candidate cylinder deactivation cycle matrix and the j-th cylinder deactivation number 6 candidate cylinder deactivation cycle matrix.
S106, selecting an optimal cylinder deactivation cycle matrix under each cylinder deactivation number from the alternative cylinder deactivation cycle matrices based on the third generation value set.
For two groups of alternative cylinder deactivation cycle matrices with a cylinder deactivation number difference of 1, the minimum third generation value may be determined from the corresponding third generation value set, and the two corresponding alternative cylinder deactivation cycle matrices are respectively used as an optimal cylinder deactivation cycle matrix.
The embodiment provides a cylinder deactivation path determining method, in the method, each alternative cylinder deactivation cyclic matrix with smaller cylinder deactivation number is marked as a first cyclic matrix, and each alternative cylinder deactivation cyclic matrix with larger cylinder deactivation number is marked as a second cyclic matrix; calculating the cost value of each first cyclic matrix switched to each second cyclic matrix, marking the cost value as a first generation value set, and calculating the cost value of each second cyclic matrix switched to each first cyclic matrix, marking the cost value as a second cost value set; by determining cost values of the cylinder deactivation number in two directions from small to large and from large to small, all possible cost values of switching during cylinder deactivation mode switching can be determined, and further accuracy and effectiveness in the process of determining an optimal cylinder deactivation cycle matrix by means of the first generation value and the second cost value are guaranteed;
According to the method, the third generation value set is determined according to the first generation value set and the second cost value set, based on the third generation value set, one optimal cylinder deactivation cycle matrix under each cylinder deactivation number is selected from the alternative cylinder deactivation cycle matrices, the first generation value set and the second cost value set are combined to form the third generation value set, directivity between the alternative cylinder deactivation cycle matrix switching can be eliminated, meanwhile, cost characteristics in the direction switching process are reserved, and the optimal cylinder deactivation cycle matrix is determined based on the third generation value set, so that operation can be simplified, and accuracy and reliability of results can be guaranteed.
As an implementation manner, on the basis of the scheme shown in fig. 1, determining the third generation value set according to the first generation value set and the second cost value set includes:
the cost value of switching a first cyclic matrix to a second cyclic matrix is marked as a first generation value, and the cost value of switching the same second cyclic matrix to the same first cyclic matrix is marked as a second generation value;
the third generation value set includes a sum of the first generation value and the second generation value corresponding to the same first cyclic matrix and the same second cyclic matrix.
As an alternative embodiment, based on the solution shown in fig. 1, selecting an optimal cylinder deactivation cycle matrix for each number of cylinder deactivation cycles from the candidate cylinder deactivation cycle matrices based on the third generation value set includes:
based on the third generation value set, determining an optimal switching path when sequentially (step by step) switching from the minimum cylinder deactivation number to the maximum cylinder deactivation number by adopting a shortest path search algorithm, and taking the alternative cylinder deactivation cycle moment on the optimal switching path as an optimal cylinder deactivation cycle matrix.
In this solution, the shortest path search algorithm may be implemented by using any global shortest path search algorithm in the prior art;
when the shortest path search algorithm is implemented, each alternative cylinder deactivation cyclic matrix can be used as a node, and the third generation value can be used as the distance between the two corresponding nodes.
Illustratively, in the present solution, the optimal switching path approaches an alternative cylinder deactivation cycle matrix under each cylinder deactivation number, and the alternative cylinder deactivation cycle moment located on the optimal switching path is used as the optimal cylinder deactivation cycle matrix under each cylinder deactivation number.
As an implementation manner, on the basis of the scheme shown in fig. 1, the alternative cylinder deactivation cycle matrix is set to include at least two row vectors, wherein the number of elements in the row vectors is the same as the total number of cylinders of the engine, except that all the engine cylinders are fired and all the engine cylinders are not fired.
Further, the elements in the set row vector include a first element and a second element, the first element being set to indicate that the engine cylinder fires and the second element indicating that the engine cylinder does not fire.
In the scheme, the sum of the first element and the second element in each row vector is recorded as first element sum, and the first element sum of different row vectors corresponds to the same;
the sum of the first element and the second element in each column vector is recorded as a second element sum, and the second element sums of different column vectors are correspondingly identical.
FIG. 2 is a schematic diagram of an alternative cylinder deactivation cycle matrix in an embodiment, in which the alternative cylinder deactivation cycle matrix may be in the form of the alternative cylinder deactivation cycle matrix shown in FIG. 2;
the alternative cylinder deactivation cycle matrix shown in FIG. 2 contains the following information: the number of cylinders of the engine is 6, the number of cylinder deactivation is 2, and 3 cylinder deactivation modes with the same number of cylinder deactivation are included;
wherein, the first element is set to be 1, the second element is set to be 0, 1 is set to be used for igniting the engine cylinder, and 0 is set to be used for not igniting the engine cylinder.
Fig. 3 is a flowchart of a method for determining an alternative cylinder deactivation cycle matrix in an embodiment, and referring to fig. 3, in this solution, the alternative cylinder deactivation cycle matrix may be determined by:
S1, acquiring the total number of cylinders of an engine and the number of ignition cylinders in one engine cycle.
Illustratively, in this scenario, for example, a four-stroke piston reciprocating engine, the crankshaft is set to correspond to one engine cycle per 720 degrees of rotation.
S2, determining the least common multiple of the total cylinder number and the ignition cylinder number of the engine, and determining the circulation number according to the least common multiple, the ignition cylinder number and the integer factor.
In the scheme, the cycle number (the row vector number of the alternative cylinder deactivation cycle matrix) is determined according to the following formula:
m=L/w×k
in the above formula, L is the least common multiple of the total number of cylinders of the engine n and the number of firing cylinders w, m is the number of cycles, and k is an integer factor.
S3, determining all firing modes in one cycle according to the total number of cylinders of the engine and the number of firing cylinders, and generating a unique firing code aiming at one firing mode.
S4, generating an initial code with the same number of digits as the cycle number, and replacing each digit of the initial code with a unique ignition code according to all the arrangement and combination modes of the unique ignition codes to generate a plurality of ignition mode codes.
In combination with step S1 to step S4, in this scheme, the firing pattern code is specifically m-bit multi-level firing pattern code, and when the number of levels is determined by n and w, the number of all firing patterns in each cycle is the same (i.e. when the firing patterns are represented by the arrangement modes of 1 and 0 in row vectors, the number of all the arrangements and combinations of 1 and 0 in row vectors is the same);
Meanwhile, a unique ignition code is a character for constituting a multilevel number, for example, if the multilevel number is 16, the unique ignition code includes 0 to 9 and a to F for constituting the 16-level number.
S5, cleaning data of all ignition mode codes, screening out ignition mode codes matched with the definition conditions of the equalization cyclic matrix, recording the ignition mode codes as alternative engine cylinder deactivation mode codes, and de-duplicating the alternative engine cylinder deactivation mode codes.
In the scheme, aiming at one ignition mode code, matrix row vectors corresponding to each unique ignition code are obtained, all matrix row vectors are adopted to generate a judgment matrix, and if the sum of 1 in each matrix row vector of the judgment matrix is equal, the corresponding ignition mode code is reserved.
In this scheme, coding the alternate engine cylinder deactivation mode for de-duplication includes:
and performing cyclic shift with the number of cycles of-1 for each alternative engine cylinder deactivation mode code, generating a plurality of equivalent cylinder deactivation mode codes, and removing the alternative engine cylinder deactivation mode codes which are the same as the equivalent cylinder deactivation mode codes.
S6, determining an alternative cylinder deactivation cycle matrix according to the alternative engine cylinder deactivation mode codes.
In the scheme, aiming at an alternative engine cylinder deactivation mode code, each unique ignition code contained in the alternative engine cylinder deactivation mode code is acquired, further, row vectors corresponding to each unique ignition code are determined, and all row vectors are adopted to generate a corresponding alternative cylinder deactivation cycle matrix.
In the scheme, under the condition that the total number of cylinders of the engine, the number of firing cylinders fired in one cycle and the number of cycles are determined, all possible alternative engine cylinder deactivation modes are encoded, a final feasible alternative cylinder deactivation cycle matrix is determined through screening processing of the encoding, and the alternative cylinder deactivation cycle matrix is determined through the encoding operation, so that related processing aiming at the firing mode encoding is easy to carry out by utilizing a parallel processing mode, and further when the number of the firing mode encodings is large, the execution efficiency of the computing equipment in the process of automatically determining the alternative cylinder deactivation cycle matrix can be greatly improved.
As one possible embodiment, when the alternate cylinder deactivation cycle matrix includes at least two row vectors in addition to firing all engine cylinders and non-firing all engine cylinders, determining the first and second sets of cost values includes:
each row vector of the first cyclic matrix is marked as a first row vector, and each row vector of the second cyclic matrix is marked as a second row vector;
calculating the dynamic response value of each first row vector switched to each second row vector, and recording the dynamic response value as a first dynamic response value set;
determining a first optimal dynamic response value in the first dynamic response value set as a first generation value of switching the first cyclic matrix to the second cyclic matrix;
Calculating the dynamic response value of each second row vector switched to each first row vector, and recording the dynamic response value as a second dynamic response value set;
and determining a second optimal dynamic response value in the second dynamic response value set as a second cost value of switching the second cyclic matrix to the first cyclic matrix.
Illustratively, the present solution specifically defines: a first cost value when a first cyclic matrix is switched to a second cyclic matrix and a second cost value when a second cyclic matrix is switched to a first cyclic matrix are determined.
For example, referring to fig. 2, the first cyclic matrix and/or the second cyclic matrix may include a plurality of row vectors, each row vector representing a cylinder deactivation mode;
when the engine works according to a cylinder-stopping circulation matrix, each small cycle of the engine works according to a cylinder-stopping mode of each row in the cylinder-stopping circulation matrix in turn, and the cycle is repeated (for example, referring to fig. 2, the number of cylinders of the engine is 2, the engine stops 4 and 6 in the first small cycle, stops 2 and 3 in the second small cycle, stops 1 and 5 in the third small cycle, and is the same as the first small cycle when the fourth small cycle is performed, the cylinders are stopped 4 and 6, the cylinder-stopping mode of the fifth small cycle is the same as the cylinder-stopping mode of the second small cycle, the cylinder-stopping mode of the sixth small cycle is the same as the cylinder-stopping mode of the third small cycle, the seventh small cycle is the same as the cylinder-stopping mode of the first small cycle, … …, and the cycle is sequentially repeated;
Taking a cylinder deactivation control mode corresponding to switching from the first circulation matrix to the second circulation matrix as an example when the cylinder deactivation number is changed, the actual switching mode is as follows: switching from a cylinder deactivation mode corresponding to one row vector in the first cyclic matrix to a cylinder deactivation mode corresponding to one row vector in the second cyclic matrix;
therefore, if the number of row vectors included in the first cyclic matrix is r1 and the number of row vectors included in the second cyclic matrix is r2, the number of cylinder deactivation control modes corresponding to switching from the first cyclic matrix to the second cyclic matrix is r1×r2;
in the scheme, dynamic response values corresponding to each switching mode in r1×r2 modes are determined, and the optimal dynamic response value is used as a first generation value, so that a first generation value set is generated.
For example, in this solution, if the second cyclic matrix is switched to the cylinder deactivation control mode corresponding to the first cyclic matrix, the actual switching mode is: switching from a cylinder deactivation mode corresponding to one row vector in the second cyclic matrix to a cylinder deactivation mode corresponding to one row vector in the first cyclic matrix;
therefore, if the number of row vectors included in the first cyclic matrix is r1 and the number of row vectors included in the second cyclic matrix is r2, the number of cylinder deactivation control modes corresponding to the switching from the second cyclic matrix to the first cyclic matrix is r2×r1;
In the scheme, dynamic response values corresponding to each switching mode in the r2×r1 modes are determined, and the optimal dynamic response value is used as a second cost value, so that a second cost value set is generated.
In this embodiment, the manner of determining the dynamic response value is not particularly limited, and for example, an engine dynamic parameter (for example, a torsional vibration stress amplitude of a crankshaft or a fluctuation amount of an angular velocity of a front end of the crankshaft) may be selected, and a value or a variation amount of the engine dynamic parameter when switching from one cylinder deactivation control mode to another cylinder deactivation control mode is determined as the dynamic response value through simulation calculation or experimental test.
On the basis of the beneficial effects of the scheme shown in fig. 1, in the scheme, the first and/or second cost values are determined according to the optimal dynamic response values when the two alternative cylinder deactivation cycle matrixes are switched, so that the problem that the dynamic response of switching between the final cylinder deactivation cycle matrixes is poor due to the randomness of switching when the alternative cylinder deactivation cycle matrixes comprise a plurality of row vectors is avoided.
In this embodiment, any of the above-described cylinder deactivation path determining methods may be freely arranged and combined, for example, in one embodiment, the cylinder deactivation path determining method may be:
S101, determining an alternative cylinder deactivation cycle matrix.
S102, aiming at two groups of alternative cylinder deactivation cyclic matrixes with different cylinder deactivation numbers, marking a set formed by the alternative cylinder deactivation cyclic matrixes with smaller cylinder deactivation numbers as a first cyclic matrix set, and marking a set formed by the alternative cylinder deactivation cyclic matrixes with larger cylinder deactivation numbers as a second cyclic matrix set.
In combination with steps S101-S102, in the scheme, elements in row vectors of the alternative cylinder deactivation cycle matrix are set to comprise a first element and a second element;
the first element indicates that the engine cylinder fires and the second element indicates that the engine cylinder does not fire;
in the alternative cylinder deactivation cyclic matrix, the sum of the first element and the second element in each row vector is recorded as a first element sum, and the first element sums of different row vectors are the same in correspondence;
the sum of the first element and the second element in each column vector is recorded as second element sum, and the second element sum of different column vectors corresponds to the same.
The mode of determining the alternative cylinder deactivation cycle matrix is as follows:
acquiring the total number of cylinders of an engine and the number of ignition cylinders in one engine cycle; determining the least common multiple of the total number of cylinders and the number of firing cylinders of the engine, and determining the circulation number according to the least common multiple, the number of the firing cylinders and an integer factor; determining all firing modes in one cycle according to the total number of cylinders of the engine and the number of firing cylinders, and generating a unique firing code for one firing mode; generating an initial code with the same number of digits as the number of cycles, and replacing each digit of the initial code with a unique ignition code according to all arrangement and combination modes of the unique ignition codes to generate a plurality of ignition mode codes; data cleaning is carried out on all ignition mode codes, ignition mode codes matched with the definition conditions of the equalization cyclic matrix are screened out, the ignition mode codes are recorded as alternative engine cylinder deactivation mode codes, and duplication is removed from the alternative engine cylinder deactivation mode codes; and determining an alternative cylinder deactivation cycle matrix according to the alternative engine cylinder deactivation mode codes.
S103, calculating the cost value of each first cyclic matrix in the first cyclic matrix set to each second cyclic matrix in the second cyclic matrix set, and recording the cost value sets as first cost value sets.
S104, calculating the cost value of each second cyclic matrix switched to each first cyclic matrix, and recording the collection of the cost values as a second cost value collection.
In combination with step S103 to step S104, in this solution, the manner of determining the first generation value set and the second cost value set is:
if the cylinder deactivation control mode corresponding to the first cyclic matrix is switched to the second cyclic matrix, setting the number of row vectors contained in the first cyclic matrix as r1, and the number of row vectors contained in the second cyclic matrix as r2, switching the first cyclic matrix to the cylinder deactivation control mode corresponding to the second cyclic matrix as r1×r2;
and determining dynamic response values corresponding to each switching mode in the r1×r2 modes, taking the optimal dynamic response values as first generation values, determining the first generation values corresponding to all the first cyclic matrixes to the second cyclic matrixes, and further generating a first generation value set.
If the second cyclic matrix is switched to the cylinder deactivation control mode corresponding to the first cyclic matrix, setting the number of row vectors contained in the first cyclic matrix as r1, and the number of row vectors contained in the second cyclic matrix as r2, switching the second cyclic matrix to the cylinder deactivation control mode corresponding to the first cyclic matrix as r2×r1;
And determining dynamic response values corresponding to each switching mode in the r2×r1 modes, taking the optimal dynamic response values as second cost values, determining that all second circulants are switched to the second cost values corresponding to the first circulants, and further generating a second cost value set.
In the scheme, the dynamic response value adopts the torsional vibration stress amplitude of the crankshaft and the fluctuation amount of the angular velocity of the front end of the crankshaft.
S105, determining a third generation value set according to the first generation value set and the second cost value set.
In the scheme, the cost value of switching a first cyclic matrix to a second cyclic matrix is a first cost value, and the cost value of switching the same second cyclic matrix to the same first cyclic matrix is a second cost value;
the third generation value set includes a sum of the first generation value and the second generation value corresponding to the same first cyclic matrix and the same second cyclic matrix.
S106, selecting an optimal cylinder deactivation cycle matrix under each cylinder deactivation number from the alternative cylinder deactivation cycle matrices based on the third generation value set.
In the scheme, based on a third generation value set, an optimal switching path is determined by adopting a shortest path search algorithm when the minimum cylinder deactivation number is sequentially switched to the maximum cylinder deactivation number, and the alternative cylinder deactivation cycle moment on the optimal switching path is used as an optimal cylinder deactivation cycle matrix.
For example, in the present approach, the alternative cylinder deactivation cycle matrices and the switching between them may be described using a directed graph model.
FIG. 4 is a schematic diagram of a directed graph model in an embodiment showing a directed graph of switching between alternative cylinder deactivation cycle matrices for different numbers of cylinder deactivation of a six-cylinder machine, wherein each black dot corresponds to an alternative cylinder deactivation cycle matrix, the numbers next to them represent the number of working cylinders of the corresponding alternative cylinder deactivation cycle matrix, each arrowed curve (all curves corresponding to a first set of values, a second set of cost values) represents an alternative cylinder deactivation cycle matrix switching from its head point to its tail point, the cost of this switching being represented by the color of the curve, the specific value corresponding to the color bar on the right side of the graph.
For example, in the present approach, the alternative cylinder deactivation cycle matrices and the switching between them may be described using an undirected graph model.
FIG. 5 is a schematic diagram of a graph model showing an undirected graph converted from the directed graph shown in FIG. 4, in which undirected edges connecting every two black dots correspond to a third generation value set.
By using the shortest path searching algorithm of the graph, a shortest path from the vertex with the working cylinder number of 0 to the vertex with the working cylinder number of 6 in fig. 5 can be obtained, and each alternative cylinder deactivation cycle matrix on the path is the optimal cylinder deactivation cycle matrix under each working cylinder number.
In practical applications, not all working cylinder numbers are necessarily involved, and a sub-graph of the corresponding working cylinder numbers may be taken from fig. 5.
FIG. 6 is a schematic diagram of yet another graphical model of an embodiment showing an undirected graph of working cylinder numbers from 3 to 6, with a shortest path from the vertex of 3 to the vertex of 6 for each working cylinder number, through which an optimal cylinder deactivation cycle matrix for each working cylinder number can be determined.
Example two
The present embodiment proposes a cylinder deactivation path determining apparatus including a cylinder deactivation path determining unit configured to:
determining an alternative cylinder deactivation cycle matrix;
for two groups of alternative cylinder deactivation cyclic matrixes with different cylinder deactivation numbers, marking a set formed by the alternative cylinder deactivation cyclic matrixes with smaller cylinder deactivation numbers as a first cyclic matrix set, and marking a set formed by the alternative cylinder deactivation cyclic matrixes with larger cylinder deactivation numbers as a second cyclic matrix set;
calculating the cost value of each first cyclic matrix in the first cyclic matrix set, switching to each second cyclic matrix in the second cyclic matrix set, and recording the cost value sets as first cost value sets;
Calculating the cost value of each second cyclic matrix switched to each first cyclic matrix, and recording the collection of the cost values as a second cost value collection;
determining a third generation value set according to the first generation value set and the second cost value set;
based on the third generation value set, one optimal cylinder deactivation cycle matrix under each cylinder deactivation number is selected from the alternative cylinder deactivation cycle matrices.
In this embodiment, the cylinder deactivation path determining unit may be specifically configured to implement any one of the cylinder deactivation path determining methods described in the first embodiment, and the specific implementation manner and the beneficial effects thereof are the same as those of the corresponding content described in the first embodiment, and are not described herein.
Example III
Fig. 7 shows a schematic diagram of the structure of an electronic device 10 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.
As shown in fig. 7, the electronic device 10 includes at least one processor 11, and a memory, such as a Read Only Memory (ROM) 12, a Random Access Memory (RAM) 13, etc., communicatively connected to the at least one processor 11, in which the memory stores a computer program executable by the at least one processor, and the processor 11 may perform various appropriate actions and processes according to the computer program stored in the Read Only Memory (ROM) 12 or the computer program loaded from the storage unit 18 into the Random Access Memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 may also be stored. The processor 11, the ROM 12 and the RAM 13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to bus 14.
Various components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, etc.; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.
The processor 11 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 11 performs the respective methods and processes described above, such as the cylinder deactivation path determining method.
In some embodiments, the cylinder deactivation path determination method may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM 12 and/or the communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the cylinder deactivation path determination method described above may be performed. Alternatively, in other embodiments, processor 11 may be configured to perform the cylinder deactivation path determination method in any other suitable manner (e.g., by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.
The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.
Note that the above is only a preferred embodiment of the present invention and the technical principle applied. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, while the invention has been described in connection with the above embodiments, the invention is not limited to the embodiments, but may be embodied in many other equivalent forms without departing from the spirit or scope of the invention, which is set forth in the following claims.
Claims (8)
1. A cylinder deactivation path determining method, comprising:
determining an alternative cylinder deactivation cycle matrix;
for two groups of alternative cylinder deactivation cyclic matrixes with different cylinder deactivation numbers, marking a set formed by the alternative cylinder deactivation cyclic matrixes with smaller cylinder deactivation numbers as a first cyclic matrix set, and marking a set formed by the alternative cylinder deactivation cyclic matrixes with larger cylinder deactivation numbers as a second cyclic matrix set;
calculating the cost value of each first cyclic matrix in the first cyclic matrix set, switching to each second cyclic matrix in the second cyclic matrix set, and recording the cost value sets as first cost value sets;
Calculating the cost value of each second cyclic matrix switched to each first cyclic matrix, and recording a set of the cost values as a second cost value set;
determining a third generation value set from the first generation value set and the second cost value set, including:
the cost value of switching one first cyclic matrix to one second cyclic matrix is marked as a first generation value, and the cost value of switching the same second cyclic matrix to the same first cyclic matrix is marked as a second generation value;
the third generation value set comprises a third generation value corresponding to the same first cyclic matrix and the same second cyclic matrix, wherein the third generation value is the sum of the first generation value and the second generation value;
selecting an optimal cylinder deactivation cycle matrix for each number of cylinder deactivation cycles from the candidate cylinder deactivation cycle matrices based on the third generation value set, comprising:
and based on the third generation value set, determining an optimal switching path when sequentially switching from the minimum cylinder deactivation number to the maximum cylinder deactivation number by adopting a shortest path search algorithm, and taking the alternative cylinder deactivation cycle moment on the optimal switching path as the optimal cylinder deactivation cycle matrix.
2. The cylinder deactivation path determination method according to claim 1 wherein said alternate cylinder deactivation cycle matrix includes at least two row vectors, except for all engine cylinders firing and all engine cylinders not firing;
the number of elements in the row vector is the same as the total number of cylinders of the engine.
3. The cylinder deactivation path determination method according to claim 2, wherein the elements in the row vector include a first element and a second element;
the first element indicates that the engine cylinder fires, and the second element indicates that the engine cylinder does not fire;
in the alternative cylinder deactivation cyclic matrix, the sum of the first element and the second element in each row vector is recorded as a first element sum, and the first element sums of different row vectors are corresponding to the same;
the sum of the first element and the second element in each column vector is noted as a second element sum, and the second element sums of different column vectors are correspondingly identical.
4. The cylinder deactivation path determination method according to claim 2, wherein each row vector of said first cyclic matrix is denoted as a first row vector, and each row vector of said second cyclic matrix is denoted as a second row vector;
Calculating the dynamic response value of each first row vector switched to each second row vector, and recording the dynamic response value as a first dynamic response value set;
determining a first optimal dynamic response value in the first set of dynamic response values as a first generation value for the first cyclic matrix to switch to the second cyclic matrix;
calculating the dynamic response value of each second row vector switched to each first row vector, and recording the dynamic response value as a second dynamic response value set;
and determining a second optimal dynamic response value in the second dynamic response value set as a second cost value of switching the second cyclic matrix to the first cyclic matrix.
5. The cylinder deactivation path determination method according to claim 4 wherein said dynamic response values include a crankshaft torsional stress amplitude and a crankshaft front end angular velocity fluctuation amount.
6. A cylinder deactivation path determining device characterized by comprising a cylinder deactivation path determining unit for:
determining an alternative cylinder deactivation cycle matrix;
for two groups of alternative cylinder deactivation cyclic matrixes with different cylinder deactivation numbers, marking a set formed by the alternative cylinder deactivation cyclic matrixes with smaller cylinder deactivation numbers as a first cyclic matrix set, and marking a set formed by the alternative cylinder deactivation cyclic matrixes with larger cylinder deactivation numbers as a second cyclic matrix set;
Calculating the cost value of each first cyclic matrix in the first cyclic matrix set, switching to each second cyclic matrix in the second cyclic matrix set, and recording the cost value sets as first cost value sets;
calculating the cost value of each second cyclic matrix switched to each first cyclic matrix, and recording a set of the cost values as a second cost value set;
determining a third generation value set from the first generation value set and the second cost value set, including:
the cost value of switching one first cyclic matrix to one second cyclic matrix is marked as a first generation value, and the cost value of switching the same second cyclic matrix to the same first cyclic matrix is marked as a second generation value;
the third generation value set comprises a third generation value corresponding to the same first cyclic matrix and the same second cyclic matrix, wherein the third generation value is the sum of the first generation value and the second generation value;
selecting an optimal cylinder deactivation cycle matrix for each number of cylinder deactivation cycles from the candidate cylinder deactivation cycle matrices based on the third generation value set, comprising:
and based on the third generation value set, determining an optimal switching path when sequentially switching from the minimum cylinder deactivation number to the maximum cylinder deactivation number by adopting a shortest path search algorithm, and taking the alternative cylinder deactivation cycle moment on the optimal switching path as the optimal cylinder deactivation cycle matrix.
7. An electronic device comprising at least one processor, and a memory communicatively coupled to the at least one processor;
the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the cylinder deactivation path determination method of any of claims 1-5.
8. A computer readable storage medium storing computer instructions for causing a processor to perform the cylinder deactivation path determination method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310153454.1A CN115875141B (en) | 2023-02-23 | 2023-02-23 | Cylinder deactivation path determining method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310153454.1A CN115875141B (en) | 2023-02-23 | 2023-02-23 | Cylinder deactivation path determining method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115875141A CN115875141A (en) | 2023-03-31 |
| CN115875141B true CN115875141B (en) | 2023-05-23 |
Family
ID=85761518
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310153454.1A Active CN115875141B (en) | 2023-02-23 | 2023-02-23 | Cylinder deactivation path determining method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115875141B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116163845B (en) * | 2023-04-20 | 2023-07-18 | 潍柴动力股份有限公司 | Cylinder deactivation control method and device for engine and engine |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101408135A (en) * | 2008-11-18 | 2009-04-15 | 上海汽车集团股份有限公司 | Accidental control policy of multi-cylinder engine part air cylinder stopping |
| CN107664070A (en) * | 2016-07-29 | 2018-02-06 | 长城汽车股份有限公司 | Control method, control system and the vehicle of cylinder deactivation of engine |
| CN114135403A (en) * | 2021-11-25 | 2022-03-04 | 中国第一汽车股份有限公司 | Control method and device for engine cylinder deactivation and engine |
| CN115614166A (en) * | 2021-07-13 | 2023-01-17 | 厦门雅迅网络股份有限公司 | Vehicle cylinder deactivation prediction control method, terminal device and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113661316B (en) * | 2019-04-04 | 2024-03-08 | 卡明斯公司 | Cyclical application of an internal combustion engine with cylinder deactivation control |
-
2023
- 2023-02-23 CN CN202310153454.1A patent/CN115875141B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101408135A (en) * | 2008-11-18 | 2009-04-15 | 上海汽车集团股份有限公司 | Accidental control policy of multi-cylinder engine part air cylinder stopping |
| CN107664070A (en) * | 2016-07-29 | 2018-02-06 | 长城汽车股份有限公司 | Control method, control system and the vehicle of cylinder deactivation of engine |
| CN115614166A (en) * | 2021-07-13 | 2023-01-17 | 厦门雅迅网络股份有限公司 | Vehicle cylinder deactivation prediction control method, terminal device and storage medium |
| CN114135403A (en) * | 2021-11-25 | 2022-03-04 | 中国第一汽车股份有限公司 | Control method and device for engine cylinder deactivation and engine |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115875141A (en) | 2023-03-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115875141B (en) | Cylinder deactivation path determining method, device, equipment and storage medium | |
| Stromatias et al. | Scalable energy-efficient, low-latency implementations of trained spiking deep belief networks on spinnaker | |
| US10644721B2 (en) | Processing core data compression and storage system | |
| CN107943938A (en) | A kind of large-scale image similar to search method and system quantified based on depth product | |
| Bulat et al. | Hierarchical binary CNNs for landmark localization with limited resources | |
| CN102184205B (en) | Based on the Multi-Pattern Matching method of easily extensible precision chaos Hash | |
| JP7461344B2 (en) | Convolution processing method, device, and storage medium for convolutional neural network | |
| CN111310050A (en) | Recommendation method based on multilayer attention | |
| US10339439B2 (en) | Efficient and scalable systems for calculating neural network connectivity in an event-driven way | |
| US10810235B1 (en) | Efficient region identification using hierarchical geocoded information | |
| CN110061870B (en) | Node and edge-based combined efficiency evaluation method in tactical internet | |
| CN114785696B (en) | Importance evaluation method and device for complex network node | |
| CN113516248B (en) | Quantum gate testing method and device and electronic equipment | |
| WO2016187706A1 (en) | Method and system for event-based neural networks | |
| CN113537449A (en) | Data processing method based on impulse neural network, computing core circuit and chip | |
| Joardar et al. | Learning to train CNNs on faulty ReRAM-based manycore accelerators | |
| CN106302374A (en) | A kind of for improving list item access bandwidth and the device and method of atomicity operation | |
| CN115807714B (en) | Alternative cylinder deactivation mode determining method, device, equipment and storage medium | |
| CN116800671A (en) | Data transmission method, apparatus, computer device, storage medium, and program product | |
| Chacón et al. | FM-index on GPU: A cooperative scheme to reduce memory footprint | |
| CN114897161B (en) | Mask-based graph classification backdoor attack defense method and system, electronic equipment and storage medium | |
| CN115881211B (en) | Protein sequence alignment method, protein sequence alignment device, computer equipment and storage medium | |
| CN114038513A (en) | Method, device and terminal for predicting mass concentration of hydrogen sulfide in coal-fired boiler | |
| CN114912622A (en) | Decentralized safe federal learning method and system | |
| CN114116696A (en) | Fault node data reconstruction method considering node selection mechanism in cloud storage system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |