CN104504282A - Blade grouping algorithm based on minimum aggregation - Google Patents
Blade grouping algorithm based on minimum aggregation Download PDFInfo
- Publication number
- CN104504282A CN104504282A CN201410854765.1A CN201410854765A CN104504282A CN 104504282 A CN104504282 A CN 104504282A CN 201410854765 A CN201410854765 A CN 201410854765A CN 104504282 A CN104504282 A CN 104504282A
- Authority
- CN
- China
- Prior art keywords
- blade
- grouping
- circle
- minimum
- algorithm
- 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.)
- Granted
Links
Abstract
The invention provides a blade grouping algorithm based on minimum aggregation. N blades are divided into a group by the algorithm, and the algorithm is applicable to grouping selection of mass fan blades. Blade grouping selection computing complexity can be reduced, the blades are automatically selected in grouping, and the labor intensity of manually selecting the blades in grouping is relieved.
Description
Technical field
The present invention relates to a kind of grouping algorithm of blade, the grouping being applicable to fan blade in enormous quantities is selected.
Background technology
After fan blade is produced, before being installed to blower fan, all to measure through weight detecting, barycenter distance, then according to quality requirements and barycenter distance restrictive condition, three fan blades are divided into one group, and this grouping will make statical moment, the requirement of quality packet conforms of fan blade.
In former production, it is all hand picking that a lot of blade grouping is selected, so not only bothersome effort, and very easily produces mistake.
Summary of the invention
The technical problem to be solved in the present invention is the Auto-grouping realizing fan blade.
In order to solve the problems of the technologies described above, technical scheme of the present invention there is provided a kind of blade grouping algorithm based on minimum polymerization, by this algorithm, n sheet blade is divided into one group, n >=3, it is characterized in that, comprise the following steps:
The first step, give unique mark for every sheet blade, measure quality and the barycenter distance of every sheet blade;
Second step, record quality corresponding to each mark and barycenter distance;
3rd step, by all blades by quality-ordered;
4th step, first blade is defined as current vane;
5th step, from lower a slice blade of current vane, from remaining all blades, pick out all blades with current vane within the scope of mass deviation, composition set φ;
6th step, process set φ
1) if the quantity of the blade in set φ is less than n-1, then current vane can not match, and enters the 7th step;
2) if the quantity of the blade in set φ equals n-1, then this set φ is defined as a grouping;
3) if the quantity of the blade in set φ is greater than n-1, then calculate the minimum circle-cover of any n-1 sheet blade in current vane and set φ respectively, therefrom find out the combination of current vane corresponding to the minimum circle-cover minimum with radius and n-1 sheet blade, this combination is defined as a grouping;
7th step, lower a slice blade of current vane is defined as new current vane, if new current vane is last a slice blade, then obtains m grouping, enter the 8th step, otherwise, return the 5th step;
8th step, from m grouping, pick out final grouping, judge that whether any one grouping is the method for final grouping and is:
Judge whether the n sheet blade in current group belongs to identified existing final grouping, and if so, then current group is null packets, otherwise, current group is defined as final grouping;
9th step, judge whether finally to divide into groups to generate, if nothing, then terminated this algorithm, if have, then judge whether all final groupings contain all blades, if, then terminating this algorithm, if not, then will not being included in the blade in finally dividing into groups by returning the 4th step after quality-ordered.
Preferably, in described 6th step, if the quantity of the blade in set φ equals n-1, then this set φ is defined as minimum circle-cover one grouping, then calculates vaned minimum vertex-covering radius of circle in this grouping;
In described 8th step, by all m grouping according to the descending or ascending sequence of the size of minimum vertex-covering radius of circle, then pick out final grouping successively from first grouping.
Preferably, i-th grouping, 1≤i≤m, the computing method of interior vaned minimum vertex-covering radius of circle are:
Step 1, two of planimetric coordinates axles are defined as respectively quality and the barycenter distance of blade, then the blade in i-th grouping on planimetric coordinates respectively with A
i-1(MA
i-1, LA
i-1), A
i-2(MA
i-2, LA
i-2) ..., A
i-n(MA
i-n, LA
i-n) corresponding, MA
i-1, MA
i-2..., MA
i-nbe respectively the quality of each blade, LA
i-1, LA
i-2..., LA
i-nbe respectively the barycenter distance of each blade;
If step 2 A
i-1, A
i-2..., A
i-npoint-blank, then minimum vertex-covering radius of circle is the half growing longest distance between 3 most;
If A
i-1, A
i-2..., A
i-ncomposition oxygon or right-angle triangle, then the external radius of a circle of this oxygon or right-angle triangle is minimum vertex-covering radius of circle;
If A
i-1, A
i-2..., A
i-ncomposition obtuse triangle, then with the longest edge of this obtuse triangle radius of a circle that is diameter for minimum vertex-covering radius of circle.
The invention provides the algorithm of a blade grouping, this algorithm can reduce the computational complexity that blade divides into groups to select, and realizes automatically selecting blade grouping, alleviates the labour intensity of hand picking blade grouping.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of a kind of blade grouping algorithm based on minimum polymerization provided by the invention.
Embodiment
For making the present invention become apparent, hereby with preferred embodiment, and accompanying drawing is coordinated to be described in detail below.
As shown in Figure 1, present embodiment discloses a kind of blade grouping algorithm based on minimum polymerization, by this algorithm, 3 blades be divided into one group, comprise the following steps:
The first step, give a blade numbering ID for every sheet blade, measure the mass M of every sheet blade and barycenter apart from L;
Second step, record mass M corresponding to each blade numbering ID and barycenter apart from L;
3rd step, by all by quality-ordered, obtain blade A
1, A
2... A
k;
4th step, by first blade A
1be defined as current vane;
5th step, from lower a slice blade of current vane, from remaining all blades, pick out all blades with current vane within the scope of mass deviation, composition set φ.For first blade A
1, namely from second blade A
2start, from blade A
2... A
kin pick out and first blade A
1all blade composition set φ within the scope of mass deviation
1.
6th step, process set φ
1) if set φ be empty set or set φ in only have 1 blade, then current vane can not match, and enters the 7th step;
2) if the quantity of the blade in set φ equals 2, then this set φ is defined as a grouping, calculates vaned minimum vertex-covering radius of circle in this grouping, for first blade A
1, its correspondence be grouped into R (A
1);
3) if the quantity of the blade in set φ is greater than 2, then calculate the minimum circle-cover of any 2 blades in current vane and set φ respectively, therefrom find out the combination of current vane corresponding to the minimum circle-cover minimum with radius and 2 blades, this combination is defined as a grouping;
7th step, lower a slice blade of current vane is defined as new current vane, if new current vane is last a slice blade, then obtains m grouping, enter the 8th step, otherwise, return the 5th step;
In above-mentioned steps, i-th grouping, 1≤i≤m, interior all blade A
i-1, A
i-2, A
i-3the computing method of minimum vertex-covering radius of circle be:
Step 1, two of planimetric coordinates axles are defined as respectively quality and the barycenter distance of blade, then the blade in i-th grouping on planimetric coordinates respectively with A
i-1(MA
i-1, LA
i-1), A
i-2(MA
i-2, LA
i-2), A
i-3(MA
i-3, LA
i-3) corresponding, MA
i-1, MA
i-2, MA
i-3be respectively the quality of each blade, LA
i-1, LA
i-2, LA
i-3be respectively the barycenter distance of each blade;
If step 2 A
i-1, A
i-2, A
i-3point-blank, then minimum vertex-covering radius of circle is the half growing longest distance between 3 most;
If A
i-1, A
i-2, A
i-3composition oxygon or right-angle triangle, then the external radius of a circle of this oxygon or right-angle triangle is minimum vertex-covering radius of circle;
If A
i-1, A
i-2, A
i-3composition obtuse triangle, then with the longest edge of this obtuse triangle radius of a circle that is diameter for minimum vertex-covering radius of circle.
8th step, m grouping to be arranged successively from small to large according to minimum vertex-covering radius of circle, dividing into groups most from first, judge whether 2 blades in current group belong to identified existing final grouping, if, then current group is null packets, otherwise, current group is defined as final grouping;
9th step, judge whether finally to divide into groups to generate, if nothing, then terminated this algorithm, if have, then judge whether all final groupings contain all blades, if, then terminating this algorithm, if not, then will not being included in the blade in finally dividing into groups by returning the 4th step after quality-ordered.
Claims (3)
1., based on a blade grouping algorithm for minimum polymerization, by this algorithm, n sheet blade is divided into one group, n >=3, it is characterized in that, comprise the following steps:
The first step, give unique mark for every sheet blade, measure quality and the barycenter distance of every sheet blade;
Second step, record quality corresponding to each mark and barycenter distance;
3rd step, by all blades by quality-ordered;
4th step, first blade is defined as current vane;
5th step, from lower a slice blade of current vane, from remaining all blades, pick out all blades with current vane within the scope of mass deviation, composition set φ;
6th step, process set φ
1) if the quantity of the blade in set φ is less than n-1, then current vane can not match, and enters the 7th step;
2) if the quantity of the blade in set φ equals n-1, then this set φ is defined as a grouping;
3) if the quantity of the blade in set φ is greater than n-1, then calculate the minimum circle-cover of any n-1 sheet blade in current vane and set φ respectively, therefrom find out the combination of current vane corresponding to the minimum circle-cover minimum with radius and n-1 sheet blade, this combination is defined as a grouping;
7th step, lower a slice blade of current vane is defined as new current vane, if new current vane is last a slice blade, then obtains m grouping, enter the 8th step, otherwise, return the 5th step;
8th step, from m grouping, pick out final grouping, judge that whether any one grouping is the method for final grouping and is:
Judge whether the n sheet blade in current group belongs to identified existing final grouping, and if so, then current group is null packets, otherwise, current group is defined as final grouping;
9th step, judge whether finally to divide into groups to generate, if nothing, then terminated this algorithm, if have, then judge whether all final groupings contain all blades, if, then terminating this algorithm, if not, then will not being included in the blade in finally dividing into groups by returning the 4th step after quality-ordered.
2. a kind of blade grouping algorithm based on minimum polymerization as claimed in claim 1, it is characterized in that, in described 6th step, if the quantity of the blade in set φ equals n-1, then this set φ is defined as minimum circle-cover one grouping, then calculates vaned minimum vertex-covering radius of circle in this grouping;
In described 8th step, by all m grouping according to the descending or ascending sequence of the size of minimum vertex-covering radius of circle, then pick out final grouping successively from first grouping.
3. a kind of blade grouping algorithm based on minimum polymerization as claimed in claim 1 or 2, is characterized in that, i-th grouping, 1≤i≤m, and the computing method of interior vaned minimum vertex-covering radius of circle are:
Step 1, two of planimetric coordinates axles are defined as respectively quality and the barycenter distance of blade, then the blade in i-th grouping on planimetric coordinates respectively with A
i-1(MA
i-1, LA
i-1), A
i-2(MA
i-2, LA
i-2) ..., A
i-n(MA
i-n, LA
i-n) corresponding, MA
i-1, MA
i-2..., MA
i-nbe respectively the quality of each blade, LA
i-1, LA
i-2..., LA
i-nbe respectively the barycenter distance of each blade;
If step 2 A
i-1, A
i-2..., A
i-npoint-blank, then minimum vertex-covering radius of circle is the half growing longest distance between 3 most;
If A
i-1, A
i-2..., A
i-ncomposition oxygon or right-angle triangle, then the external radius of a circle of this oxygon or right-angle triangle is minimum vertex-covering radius of circle;
If A
i-1, A
i-2..., A
i-ncomposition obtuse triangle, then with the longest edge of this obtuse triangle radius of a circle that is diameter for minimum vertex-covering radius of circle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410854765.1A CN104504282B (en) | 2014-12-31 | 2014-12-31 | A kind of blade grouping algorithm based on minimum polymerization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410854765.1A CN104504282B (en) | 2014-12-31 | 2014-12-31 | A kind of blade grouping algorithm based on minimum polymerization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104504282A true CN104504282A (en) | 2015-04-08 |
| CN104504282B CN104504282B (en) | 2017-09-12 |
Family
ID=52945679
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410854765.1A Active CN104504282B (en) | 2014-12-31 | 2014-12-31 | A kind of blade grouping algorithm based on minimum polymerization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104504282B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107977733A (en) * | 2017-11-10 | 2018-05-01 | 南京汽轮电机(集团)有限责任公司 | A kind of turbine bucket sort method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101344422A (en) * | 2008-07-24 | 2009-01-14 | 东方电气集团东方汽轮机有限公司 | Blade weight counterbalance test system of aerogenerator |
| US20100242598A1 (en) * | 2009-03-25 | 2010-09-30 | David Stien Pedersen | Arrangement to Determine a Static Moment of a Blade |
| US20120269641A1 (en) * | 2011-04-22 | 2012-10-25 | Anthony Chessick | Wind Turbine Rotor Blades Sharing Blade Roots for Advantageous Blades and Hubs |
| CN103335059A (en) * | 2013-06-09 | 2013-10-02 | 余科洋 | Grouping counterweight system for wind turbine blades |
-
2014
- 2014-12-31 CN CN201410854765.1A patent/CN104504282B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101344422A (en) * | 2008-07-24 | 2009-01-14 | 东方电气集团东方汽轮机有限公司 | Blade weight counterbalance test system of aerogenerator |
| US20100242598A1 (en) * | 2009-03-25 | 2010-09-30 | David Stien Pedersen | Arrangement to Determine a Static Moment of a Blade |
| US20120269641A1 (en) * | 2011-04-22 | 2012-10-25 | Anthony Chessick | Wind Turbine Rotor Blades Sharing Blade Roots for Advantageous Blades and Hubs |
| CN103335059A (en) * | 2013-06-09 | 2013-10-02 | 余科洋 | Grouping counterweight system for wind turbine blades |
Non-Patent Citations (5)
| Title |
|---|
| 方淑芬等: ""对零件分组方法的研究——介绍一种新的简单可行的零件分组方法"", 《成组技术与生产现代化》 * |
| 王健: ""分组选配法在旋叶式汽车空调压缩机制造中的应用"", 《制冷与空调》 * |
| 覃斌等: ""基于下料特征的大规模零件分组优化方法"", 《计算机辅助设计与图形学学报》 * |
| 魏绍凯: ""汽轮机叶片加工与成组技术"", 《动力工程》 * |
| 龚毅光等: ""一种零件分组方法的研究"", 《哈尔滨工业大学学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107977733A (en) * | 2017-11-10 | 2018-05-01 | 南京汽轮电机(集团)有限责任公司 | A kind of turbine bucket sort method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104504282B (en) | 2017-09-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105373852A (en) | BIM-based personnel evacuation prompting system and method | |
| CN104573879B (en) | Photovoltaic plant based on optimal similar day collection goes out force prediction method | |
| CN103198494B (en) | A kind of elevation of building extracting method based on building outer contour and laser point cloud | |
| CN102073014B (en) | Method for identifying synchronous generator parameters | |
| CN107451364B (en) | Method for identifying equivalent parameters of DFIG wind power plant | |
| CN104036073B (en) | Double-fed wind power plant dynamic equivalence modeling method suitable for active power characteristic analysis | |
| CN106499581B (en) | A kind of adaptive method for controlling torque of wind energy conversion system considering variation turbulent flow wind regime | |
| CN105101406A (en) | Wireless intensity based indoor positioning method and system | |
| CN107100795B (en) | A kind of low wind speed apparatus for lower wind generating set MPPT self-adaptation control method | |
| CN103219725A (en) | Wind power plant equivalent modeling method based on real-time operation data | |
| CN106684905A (en) | Wind power plant dynamic equivalence method with wind power forecast uncertainty considered | |
| CN104112062B (en) | The acquisition methods of wind-resources distribution based on interpolation method | |
| CN103106344A (en) | Method for establishing electrical power system clustering load model | |
| CN104112167A (en) | Method for obtaining distribution of wind resources capable of power generation | |
| CN103324888A (en) | Method and system for automatically extracting virus characteristics based on family samples | |
| CN104504282A (en) | Blade grouping algorithm based on minimum aggregation | |
| CN104410508B (en) | power line network topology perception method and device based on power line communication | |
| CN102999876B (en) | A kind of construction method of electric system the whole network load model storehouse | |
| CN104200001B (en) | The choosing method of mark post blower fan | |
| CN111766642B (en) | Login tropical cyclone precipitation forecasting system | |
| CN103870883A (en) | Production line scheduling control system and method | |
| CN105631920B (en) | A kind of sample compressing method of radial basis function supporting point | |
| CN103091551B (en) | The wind power plant generated energy computational methods of unimodal Non-Gaussian Distribution | |
| CN106203474A (en) | A kind of flow data clustering method dynamically changed based on density value | |
| CN105868189B (en) | A kind of electronic map spatial index method for building up and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |