CN117556548B - Automatic calculation method applicable to paddle load foundation points of arbitrary grid surface - Google Patents
Automatic calculation method applicable to paddle load foundation points of arbitrary grid surface Download PDFInfo
- Publication number
- CN117556548B CN117556548B CN202410005027.3A CN202410005027A CN117556548B CN 117556548 B CN117556548 B CN 117556548B CN 202410005027 A CN202410005027 A CN 202410005027A CN 117556548 B CN117556548 B CN 117556548B
- Authority
- CN
- China
- Prior art keywords
- plane
- intersection
- paddle
- point
- blade
- 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
- 238000004364 calculation method Methods 0.000 title claims abstract description 16
- 238000000034 method Methods 0.000 claims abstract description 27
- 238000010367 cloning Methods 0.000 claims abstract description 9
- 238000013519 translation Methods 0.000 claims abstract description 9
- 230000000593 degrading effect Effects 0.000 claims abstract description 4
- 230000000149 penetrating effect Effects 0.000 claims abstract description 4
- 239000013598 vector Substances 0.000 claims description 66
- 238000004904 shortening Methods 0.000 claims description 3
- 238000013461 design Methods 0.000 abstract description 9
- 238000004088 simulation Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 239000011159 matrix material Substances 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000009826 distribution Methods 0.000 description 2
- 230000005012 migration Effects 0.000 description 2
- 238000013508 migration Methods 0.000 description 2
- 238000003860 storage Methods 0.000 description 2
- 230000004888 barrier function Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005520 cutting process Methods 0.000 description 1
- 230000007850 degeneration Effects 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/15—Vehicle, aircraft or watercraft design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/17—Mechanical parametric or variational design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/10—Numerical modelling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2119/00—Details relating to the type or aim of the analysis or the optimisation
- G06F2119/14—Force analysis or force optimisation, e.g. static or dynamic forces
-
- 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
- Y02T90/00—Enabling technologies or technologies with a potential or indirect contribution to GHG emissions mitigation
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Geometry (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Evolutionary Computation (AREA)
- Computer Hardware Design (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Aviation & Aerospace Engineering (AREA)
- Automation & Control Theory (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for automatically solving a load foundation point of a paddle disc applicable to any grid surface, which comprises the following steps: step S1: degrading the grid object plane discrete units into line segments, and storing; step S2: performing intersection operation on the grid object plane and the plane, searching a line segment set penetrating through the plane, and solving an intersection point coordinate set of the line segments and the plane; step S3: taking the intersection point coordinate set as a paddle load basic point to form a cross section intersection line; based on the cross section intersecting line, all cross section intersecting lines on the whole paddle are obtained through equidistant translation and rotation cloning; step S4: and (3) carrying out rotation solving on all cross section intersecting lines of each blade to obtain all blade load basic points on the whole blade. The invention can obviously improve the calculation efficiency of the load of the paddle disc in the pneumatic design of the rotating part and provides powerful support for the pneumatic iterative design of the rotating part, the numerical simulation of the flow field and the like.
Description
Technical Field
The invention relates to the field of solving of load parameters of a propeller disc, in particular to an automatic solving method of a load base point of the propeller disc, which is applicable to any grid surface.
Background
The statements in this section merely provide background information related to the present disclosure and may not constitute prior art.
The rotor disk load parameter is one of the important overall parameters in the aerodynamic design of rotating parts such as helicopter rotors, propellers and the like, and has a very important role in the initial stage of the design of the rotating parts. The paddle load is the ratio of the total force required by the rotating part to the paddle area, and the larger the paddle load is, the smaller the diameter and the structural outline dimension of the rotating part are, so that the empty weight of the rotating part can be reduced, and the load index of the rotating part can be met.
The numerical simulation method is one of the important means of pneumatic design, and plays an irreplaceable role in the pneumatic design process. The numerical calculation of the load of the propeller disc firstly needs to cut a series of numerous cross section intersecting lines which are arranged at equal intervals on the wall surface of each blade of the whole propeller disc, the number of the cross section intersecting lines is up to hundreds, and each intersecting line is composed of a series of discrete points and is in the shape of a two-dimensional airfoil. The pressure load value at one point can be obtained by integrating the pressure value components perpendicular to the paddle plate plane on each intersection line, and the pressure load distribution in the whole paddle plate is formed by a plurality of discrete point pressure load values, so that the paddle plate load distribution of a pair of rotating parts is obtained. It is important to pre-construct the fundamental point of the disk load in this process, i.e. the discrete point of the cross-sectional intersection of all the blades.
At present, most of the generation modes of the base points of the blade load are to manually generate the series of cross section intersections by using tools such as Gridgen and the like by using third-party grid software, and the efficiency is generally not high enough. If the research object is a common multi-paddle object, the time cost for manual generation is higher. The method can be suitable for automatic section cutting of any type of grid surface and calculate intersection discrete points, can remarkably improve the calculation efficiency of the load of the paddle disc in pneumatic design of the rotating component, and provides powerful support for pneumatic iterative design of the rotating component, flow field numerical simulation and the like.
Disclosure of Invention
The invention aims at: aiming at the problems existing in the prior art, the automatic solving method for the load foundation points of the propeller disc suitable for any grid surface is provided, and the specific technical scheme is as follows:
a method for automatically solving a load foundation point of a paddle tray suitable for any grid surface comprises the following steps:
step S1: degrading the grid object plane discrete units into line segments, and storing;
Step S2: performing intersection operation on the grid object plane and the plane, searching a line segment set penetrating through the plane, and solving an intersection point coordinate set of the line segments and the plane;
Step S3: taking the intersection point coordinate set as a paddle load basic point to form a cross section intersection line; the load basic point of each paddle is stored with a force value perpendicular to the plane of the paddle; based on the cross section intersecting line, all cross section intersecting lines on the whole paddle are obtained through equidistant translation and rotation cloning;
step S4: and (3) carrying out rotation solving on all cross section intersecting lines of each blade to obtain all blade load basic points on the whole blade.
Further, the step S1 includes:
now, assuming that n vertices are provided, m line segments are generated, and information to be stored is as follows:
Wherein:
representing triangle element vertices/> Coordinates of/>Represents the/>The strip line segment is formed by grid surface nodes/>And grid face node/>The composition is formed.
Further, the step S2 includes:
step S21: two vertexes of any line segment respectively form a vertical line vector to the plane, a vector starting point is a vertex, and a finishing point is a foot; adding information of a line of perpendicular vectors into the stored information;
step S22: detecting whether the directions of the vertical line vector pairs corresponding to each line segment are opposite or not, and finding out the line segment with the vertical line vector pair with opposite directions;
Step S23: and carrying out intersection calculation with the plane to obtain a set of intersection points.
Further, the information of adding a line of perpendicular vectors is as follows:
Wherein:
The expression number is/> Perpendicular vector formed by perpendicular to the plane of the section, where the plane of the section is the first initial section of the blade root.
Further, the step S23 includes:
Carrying out intersection calculation on the point A and the plane to obtain the coordinate of an intersection point Q;
Based on the coordinates of the intersection point Q, searching in a mode of locking the distance range in advance to obtain a set of intersection points.
Further, the coordinate formula of the intersection point Q is as follows:
Wherein:
Line segment vector ，/>For/>A perpendicular vector of the point;
Is the coordinates of the end point a of the arbitrary line segment AB in space.
Further, the equidistant translation comprises:
Perpendicular vector Overall growth or shortening of an interval vector/>Vector/>Along the direction of blade spanwise and perpendicular to the plane of the cross section, a new set of perpendicular vectors/>, is obtained; Detecting whether the vertical line vector pair of each line segment is opposite in direction or not again, and if so, calculating the intersection point of the line segment and the plane; by repeating this, a series of cross-sectional intersections can be obtained.
Further, the vectorThe mould length is selected according to the number of foundation points required for each blade.
Further, the rotary cloning includes:
For other paddles in a set of paddles, the paddle may be rotated to the first paddle position, instead of the first paddle position, to perform an intersection solution.
Compared with the prior art, the invention has the beneficial effects that:
The automatic calculation method of the load base points of the propeller disc, which is applicable to any grid surface, can remarkably improve the calculation efficiency of the load of the propeller disc in the pneumatic design of the rotating component and provides powerful support for the pneumatic iterative design of the rotating component, the numerical simulation of a flow field and the like.
Drawings
FIG. 1 is a flow chart of a method for automatically solving a base point of a load of a propeller disc applicable to any grid surface;
FIG. 2 is a schematic diagram illustrating the degeneration of a triangle unit into a line segment;
fig. 3 shows a line segment AB intersecting at point P (left) through the plane α, and a line segment CD away from the plane α (right);
FIG. 4 is a schematic diagram of equidistant translation of intersecting lines;
FIG. 5 is a schematic diagram of a rotating blade generating other blade intersections;
FIG. 6 is a cross-sectional intersection discrete point auto-generated result for a single blade;
FIG. 7 is a cross-sectional intersection discrete point auto-generated result for a single blade;
FIG. 8 is a graph of the results of automatic generation of discrete points of cross-section intersection of a single-disk multi-blade;
FIG. 9 is a graph of automated generation of discrete points of blade cross-section intersection for multiple paddles.
Detailed Description
It is noted that relational terms such as "first" and "second", and the like, are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The features and capabilities of the present invention are described in further detail below in connection with examples.
Example 1
Referring to fig. 1, a method for automatically obtaining a paddle load base point applicable to any grid surface includes:
step S1: degrading the grid object plane discrete units into line segments, and storing;
Step S2: performing intersection operation on the grid object plane and the plane, searching a line segment set penetrating through the plane, and solving an intersection point coordinate set of the line segments and the plane;
Step S3: taking the intersection point coordinate set as a paddle load basic point to form a cross section intersection line; the load basic point of each paddle is stored with a force value perpendicular to the plane of the paddle; based on the cross section intersecting line, all cross section intersecting lines on the whole paddle are obtained through equidistant translation and rotation cloning;
step S4: and (3) carrying out rotation solving on all cross section intersecting lines of each blade to obtain all blade load basic points on the whole blade.
In this embodiment, specifically, the step S1 includes:
the discrete units are degenerated into line segments, so that inconvenience in storage can be avoided, the barriers brought by the original block dividing mechanism of the structural grid and the like can be broken, and the position relation among blocks can be avoided;
now, assuming that n vertices are provided, m line segments are generated, and information to be stored is as follows:
（1）
Wherein:
Wherein the method comprises the steps of Representing triangle element vertices/>Is used for the purpose of determining the coordinates of (a),Represents the/>Line segment is defined by grid surface node/>And grid face node/>Constructing;
That is, the computing grid manufactured in advance of the CFD has a plurality of forms on the blade wall surface, such as quadrilateral units of a structural grid, triangular units of an unstructured grid and the like, and any discrete unit can be degraded into the polygons which are stored in the form of each side, so that the subsequent storage and computation are facilitated. For example, a triangular cell schematic is shown in fig. 2 below.
In this embodiment, specifically, the core of the calculation of the intersection between the mesh object plane and the plane is to determine the relationship between the line segment and the plane, and the relationship between them is two, the first is far away, and the second is that the line segment passes through the plane, i.e. intersects. The intersection calculation of the grid surface and the plane is to find a line segment set passing through the plane and calculate an intersection coordinate set of the line segments and the plane;
The step S2 includes:
step S21: two vertexes of any line segment respectively form a vertical line vector to the plane, a vector starting point is a vertex, and a finishing point is a foot; adding information of a line of perpendicular vectors into the stored information;
step S22: detecting a pair of perpendicular vectors corresponding to each line segment If the directions of the vertical vector pairs are opposite, finding out line segments with the vertical vector pairs with opposite directions; the two vectors are parallel because they are perpendicular to the same plane, and if they are in the same direction, it means that the line segment is far from the plane, and if they are opposite, it means that the line segment passes through the plane (if the line segment intersects the plane, its two vertices are necessarily located on both sides of the plane). Thus, the intersection of the plane and the line segment can be judged, and the intersection of the plane and the edge of the discrete unit of the grid surface can be judged. Schematic diagrams of the intersection and the separation are shown in fig. 3;
Step S23: carrying out intersection calculation with the plane to obtain a set of intersection points; the intersection points are connected in sequence to form the intersection line of the cross section of the grid surface and the plane of the blade.
In this embodiment, specifically, the information of adding a line of perpendicular vectors is as follows:
（2）
Wherein:
The expression number is/> Perpendicular vector formed by perpendicular to the plane of the cross section, wherein the plane of the cross section is the first initial cross section of the blade root; the number of perpendicular vectors required here is, though/>However, only one of the vertical vectors needs to be solved, and the other vectors are moved to the node requiring the solution by utilizing the characteristic that the vertical vectors are parallel.
In this embodiment, specifically, the step S23 includes:
carrying out intersection calculation on the point A and the plane to obtain the coordinate of an intersection point Q; intersection point in left diagram of FIG. 3 The coordinate formula is shown in the following formula (3).
（3）
Line segment vector，/>For/>A perpendicular vector of the point;
Is the coordinates of the end point a of the arbitrary line segment AB in space.
Searching by adopting a mode of locking a distance range in advance based on the coordinates of the intersection point Q to obtain a set of intersection points;
The coordinate information of the intersection point is not required to be always stored in the actual calculation of the load of the paddle, and only the physical quantity at the intersection point is required to be definitely contributed by the corresponding physical quantity of the grid nodes around the intersection point and the contribution duty ratio;
if a distance weighted interpolation mode is adopted, the distance between all grid nodes and the intersection point needs to be traversed, and a plurality of nodes closest to each other are found out, so that the searching and the distance calculating in the mode consume more time.
The invention adopts a mode of locking the distance range in advance to search, thereby reducing the times of searching and calculating the distance; the method comprises the following steps:
Set the specified distance range at the intersection point Is the radius of the circle center is/>In the ball, then first at/>Finding out that the module length is smaller thanThen calculates the distance between the starting point and the intersection point of the perpendicular vectors, and selects the distance less than/>And minimum front/>Individual node/>As intersection/>Contribution points of/>Physical quantity at point/>Can pass through the perimeter this/>Vector/>, of identical physical quantity composition of individual nodesAnd weighting coefficient vector/>The matrix multiplication is performed, and the result is represented by the following formula (4). The above parameters/>And/>Can be specified according to actual computing needs.
(4)
Wherein the method comprises the steps of
In this embodiment, more cross-section intersecting lines are required on the same blade, each intersecting line is finally summed to form a base point, and a series of intersecting lines finally form a line segment, the line segment is formed by a plurality of base points, and a force value perpendicular to the plane of the blade is stored on each base point.
When the first intersection line is obtained, the intersection lines of all positions are cloned by equidistant translation along the spanwise direction of the blade.
Meanwhile, each paddle disc is provided with a plurality of paddles, when all basic points on one paddle are automatically generated, the paddle needs to be rotated, intersecting lines on other paddles are cloned, and all paddle disc load basic points on the whole paddle disc can be obtained through equidistant translation and rotation cloning. Equidistant translational and rotational cloning schemes are shown in figure 4.
If all the base points use the above-mentioned intersection operation, it will be very time-consuming, and the present invention proposes to use a cloning method to generate other intersections on the blade and those on other blades. Namely, the perpendicular bisector vector of formula (2)Overall growth or shortening of an interval vector/>Vector/>The mode length is selected according to the number of basic points required by each blade, and the vector/>Along the direction of blade span and perpendicular to the plane of the cross section, a new set of perpendicular vectors is obtained. And detecting whether the vertical vector pair of each line segment is opposite in direction or not, and if so, calculating the intersection point of the line segment and the plane. By repeating this, a series of cross-sectional intersections can be obtained. Suppose that/>, is translated in the spanwise direction of the bladeNext, formula (2) becomes formula (5):
(5)
Wherein the method comprises the steps of Is a positive integer. If it is translated/>All perpendicular vectors are the same for all directions after the time, the plane is separated from the grid surface of the blade and is not intersected any more, and the/> can be obtained on the bladeI.e./>Intersecting lines;
For other paddles in a set of paddles, the paddle can be rotated to the first paddle position to perform intersection solving instead of the first paddle position. Because the first blade is generally positioned at the 0 phase angle of the X positive axis, the complexity of the intersection solving process can be reduced, the computing efficiency can be improved, and the intersection solving module can be reused, and the schematic diagram is shown in fig. 5.
At this time, by rotating the other blade to the first blade position, the rotation angle being the phase angle between the two bladesThe rotation axis is the unit vector/>, perpendicular to the paddle discThe direction of rotation is counter-clockwise rotation looking down on the plane of the paddle. If the center coordinate of the paddle disc is/>Then the matrix/>, is rotated at this timeIs represented by the following formula (6).
(6)
Wherein the matrixThe internal elements are calculated as follows:
at this time, the first The coordinates of the blade are subjected to rotation matrix/>And the new blade coordinates after transformation are shown as a formula (7).
（7）
Wherein,，/>。/>Is the rotation center,/>For/>The number of nodes of the blade,The number of paddles owned by the paddle tray.
First, theAfter the blade rotates, the formula (5) is compared, and only the node coordinates and line segment end point pairing information of the blade are needed to be given, and the perpendicular vector information of the blade is needed to be given. The perpendicular vector information of the previous blade can be migrated to the current blade, and the calculated amount is reduced. Since all perpendicular vectors on each blade are parallel, only the coordinates/>, of any one node on the previous blade need be selectedFor obtaining the migration vector of each node of the current bladeAs shown in equation (8).
，/>（8）
First, thePerpendicular vector of 1 blade/>The projection of the migration vector in the perpendicular vector direction is superimposed to become the/>Perpendicular vector of blade/blade ]As shown in equation (9).
，/>（9）
Because the plane of the section is continuously used, i.e. when the last section of the last blade is positioned at the blade tip, the section of the current blade is translated from the blade tip to the blade root one by one, and the vertical line vector is shortened each time. If the last section of the last blade is positioned at the heel, the current blade starts to intercept a line from the root, and the perpendicular vector grows/>And (3) sequentially and circularly reciprocating until the cross section intersection lines of all the paddles are solved.
To this end, the solution of the cross-sectional intersection of each blade is completed, and then all the base points for generating the disk loads of a pair of disks have been automatically generated.
Example two
The embodiment uses Fortran language to compile an automatic generation calculation program based on the method, uses one blade, one paddle disc four blades and four paddle disc 16 blades to perform verification, and inputs parameters and the like as shown in the following table 1, wherein R is the radius of the paddle disc. The results are shown in fig. 6 to 9.
TABLE 1 automatic section Generation input parameters
The above examples merely illustrate specific embodiments of the application, which are described in more detail and are not to be construed as limiting the scope of the application. It should be noted that it is possible for a person skilled in the art to make several variants and modifications without departing from the technical idea of the application, which fall within the scope of protection of the application.
This background section is provided to generally present the context of the present invention and the work of the presently named inventors, to the extent it is described in this background section, as well as the description of the present section as not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present invention.
Claims (5)
1. The automatic obtaining method of the load foundation points of the propeller disc suitable for any grid surface is characterized by comprising the following steps:
step S1: degrading the grid object plane discrete units into line segments, and storing;
Step S2: performing intersection operation on the grid object plane and the plane, searching a line segment set penetrating through the plane, and solving an intersection point coordinate set of the line segments and the plane;
Step S3: taking the intersection point coordinate set as a paddle load basic point to form a cross section intersection line; the load basic point of each paddle is stored with a force value perpendicular to the plane of the paddle; based on the cross section intersecting line, all cross section intersecting lines on the whole paddle are obtained through equidistant translation and rotation cloning;
step S4: carrying out rotation solving on all cross section intersecting lines of each blade to obtain all blade load basic points on the whole blade disc;
The step S2 includes:
step S21: two vertexes of any line segment respectively form a vertical line vector to the plane, a vector starting point is a vertex, and a finishing point is a foot; adding information of a line of perpendicular vectors into the stored information;
step S22: detecting whether the directions of the vertical line vector pairs corresponding to each line segment are opposite or not, and finding out the line segment with the vertical line vector pair with opposite directions;
step S23: carrying out intersection calculation with the plane to obtain a set of intersection points;
The step S23 includes:
Carrying out intersection calculation on the point A and the plane to obtain the coordinate of an intersection point Q;
Searching by adopting a mode of locking a distance range in advance based on the coordinates of the intersection point Q to obtain a set of intersection points;
The equidistant translation comprises:
Perpendicular vector Overall growth or shortening of an interval vector/>Vector/>Along the direction of blade spanwise and perpendicular to the plane of the cross section, a new set of perpendicular vectors/>, is obtained; Detecting whether the vertical line vector pair of each line segment is opposite in direction or not again, and if so, calculating the intersection point of the line segment and the plane; by repeating the steps, a series of cross section intersecting lines can be obtained;
The rotary cloning comprises:
For other paddles in a set of paddles, the paddle may be rotated to the first paddle position, instead of the first paddle position, to perform an intersection solution.
2. The method for automatically obtaining the base point of the load of the paddle tray applicable to any grid surface according to claim 1, wherein the step S1 comprises:
now, assuming that n vertices are provided, m line segments are generated, and information to be stored is as follows:
Wherein:
representing triangle element vertices/> Coordinates of/>Represents the/>The strip line segment is formed by grid surface nodes/>And grid face node/>The composition is formed.
3. The automatic obtaining method of the base point of the load of the propeller disc applicable to any grid surface according to claim 1, wherein the information of adding a line of perpendicular vectors is as follows:
Wherein:
The expression number is/> Perpendicular vector formed by perpendicular to the plane of the section, where the plane of the section is the first initial section of the blade root.
4. The automatic obtaining method of the base point of the load of the propeller disc applicable to any grid surface according to claim 1, wherein the coordinate formula of the intersection point Q is as follows:
Wherein:
Line segment vector ，/>For/>A perpendicular vector of the point;
Is the coordinates of the end point a of the arbitrary line segment AB in space.
5. The method for automatically obtaining the fundamental point of the load of the propeller disc applicable to any grid surface according to claim 1, wherein the vector isThe mould length is selected according to the number of foundation points required for each blade.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410005027.3A CN117556548B (en) | 2024-01-03 | 2024-01-03 | Automatic calculation method applicable to paddle load foundation points of arbitrary grid surface |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410005027.3A CN117556548B (en) | 2024-01-03 | 2024-01-03 | Automatic calculation method applicable to paddle load foundation points of arbitrary grid surface |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117556548A CN117556548A (en) | 2024-02-13 |
| CN117556548B true CN117556548B (en) | 2024-05-14 |
Family
ID=89818765
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410005027.3A Active CN117556548B (en) | 2024-01-03 | 2024-01-03 | Automatic calculation method applicable to paddle load foundation points of arbitrary grid surface |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117556548B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111783222A (en) * | 2020-06-15 | 2020-10-16 | 南京航空航天大学 | Grid encryption method suitable for high-precision simulation of forward-flying rotor blade tip vortex |
| CN112199782A (en) * | 2020-11-02 | 2021-01-08 | 西北工业大学太仓长三角研究院 | Method for quickly designing contra-rotating propeller by considering mutual interference |
| CN113221478A (en) * | 2021-05-07 | 2021-08-06 | 南京航空航天大学 | Numerical analysis method and system for actively controlling rotor wing |
| WO2021208464A1 (en) * | 2020-04-17 | 2021-10-21 | 深圳市大疆创新科技有限公司 | Propeller, power assembly, and aerial vehicle |
| CN114036638A (en) * | 2021-11-05 | 2022-02-11 | 南京航空航天大学 | Helicopter rotor blade-vortex interference flow field and noise high-precision simulation method |
| CN115048874A (en) * | 2022-08-16 | 2022-09-13 | 北京航空航天大学 | Aircraft design parameter estimation method based on machine learning |
| CN115758575A (en) * | 2022-11-17 | 2023-03-07 | 中国直升机设计研究所 | Helicopter horizontal tail design method for reducing aerodynamic interference influence |
| CN115774903A (en) * | 2023-02-13 | 2023-03-10 | 中国空气动力研究与发展中心计算空气动力研究所 | Helicopter rotor disc load real-time generation method, device, equipment and medium |
| CN116628856A (en) * | 2023-06-05 | 2023-08-22 | 西北工业大学 | Efficient high-precision propeller slip flow numerical simulation method |
| CN116719981A (en) * | 2023-08-08 | 2023-09-08 | 东莘电磁科技(成都)有限公司 | Fine line grid flow field visualization method based on electromagnetic field |
| CN116740174A (en) * | 2023-08-08 | 2023-09-12 | 苏州工业园区测绘地理信息有限公司 | Method and device for positioning tunnel defect in three-dimensional live-action model and storage medium |
| CN117131608A (en) * | 2023-10-23 | 2023-11-28 | 南京航空航天大学 | Excitation disk method based on optimal annular quantity distribution |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11526814B2 (en) * | 2020-02-12 | 2022-12-13 | Wipro Limited | System and method for building ensemble models using competitive reinforcement learning |
-
2024
- 2024-01-03 CN CN202410005027.3A patent/CN117556548B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021208464A1 (en) * | 2020-04-17 | 2021-10-21 | 深圳市大疆创新科技有限公司 | Propeller, power assembly, and aerial vehicle |
| CN111783222A (en) * | 2020-06-15 | 2020-10-16 | 南京航空航天大学 | Grid encryption method suitable for high-precision simulation of forward-flying rotor blade tip vortex |
| CN112199782A (en) * | 2020-11-02 | 2021-01-08 | 西北工业大学太仓长三角研究院 | Method for quickly designing contra-rotating propeller by considering mutual interference |
| CN113221478A (en) * | 2021-05-07 | 2021-08-06 | 南京航空航天大学 | Numerical analysis method and system for actively controlling rotor wing |
| CN114036638A (en) * | 2021-11-05 | 2022-02-11 | 南京航空航天大学 | Helicopter rotor blade-vortex interference flow field and noise high-precision simulation method |
| CN115048874A (en) * | 2022-08-16 | 2022-09-13 | 北京航空航天大学 | Aircraft design parameter estimation method based on machine learning |
| CN115758575A (en) * | 2022-11-17 | 2023-03-07 | 中国直升机设计研究所 | Helicopter horizontal tail design method for reducing aerodynamic interference influence |
| CN115774903A (en) * | 2023-02-13 | 2023-03-10 | 中国空气动力研究与发展中心计算空气动力研究所 | Helicopter rotor disc load real-time generation method, device, equipment and medium |
| CN116628856A (en) * | 2023-06-05 | 2023-08-22 | 西北工业大学 | Efficient high-precision propeller slip flow numerical simulation method |
| CN116719981A (en) * | 2023-08-08 | 2023-09-08 | 东莘电磁科技(成都)有限公司 | Fine line grid flow field visualization method based on electromagnetic field |
| CN116740174A (en) * | 2023-08-08 | 2023-09-12 | 苏州工业园区测绘地理信息有限公司 | Method and device for positioning tunnel defect in three-dimensional live-action model and storage medium |
| CN117131608A (en) * | 2023-10-23 | 2023-11-28 | 南京航空航天大学 | Excitation disk method based on optimal annular quantity distribution |
Non-Patent Citations (3)
| Title |
|---|
| 旋翼流动的块结构化网格自适应方法;肖中云等;空气动力学学报;20221031;第40卷(第5期);158-165 * |
| 类X-47B无人机菱形编队气动干扰数值模拟;崔兴达等;航空动力学报;20220831;第37卷(第8期);1692-1702 * |
| 高鲁棒性的螺旋桨片条理论非线性修正方法;范中允等;航空学报;20180825;第39卷(第8期);1-14 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117556548A (en) | 2024-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sommese et al. | Introduction to numerical algebraic geometry | |
| CN110851929A (en) | Two-dimensional leaf-type optimization design method and device based on self-adaptive grid | |
| CN112966454B (en) | Wind power plant fan wake dynamic coupling simulation method | |
| Derakhshan et al. | Optimization of GAMM Francis turbine runner | |
| CN112115558A (en) | Steam turbine blade grid profile parameterization reconstruction method based on crowd search algorithm | |
| CN115774903B (en) | Helicopter rotor disk load real-time generation method, device, equipment and medium | |
| CN112270139B (en) | Pneumatic optimization design method for centrifugal compressor of fuel cell based on mother type library | |
| CN110322038B (en) | Method and equipment for automatically arranging fans based on mesoscale data | |
| CN117556548B (en) | Automatic calculation method applicable to paddle load foundation points of arbitrary grid surface | |
| CN116484702B (en) | Unstructured nested grid computing method suitable for any unit type | |
| CN104504758B (en) | Artificial tooth is preced with surface curve generation method | |
| Yi et al. | Design optimization of transonic compressor rotor using CFD and genetic algorithm | |
| CN112487570A (en) | Centrifugal compressor shunting blade shape optimization method based on free deformation technology | |
| CN115270363B (en) | Centrifugal compressor blade optimization design method and device based on multi-agent model | |
| CN116467810A (en) | Blade structure parameter determination method, device, equipment and readable storage medium | |
| CN114841091B (en) | Pneumatic optimization design method of centrifugal ventilator based on agent model technology | |
| CN115859524A (en) | Cylinder Boolean difference calculation method based on STL model | |
| CN110349265B (en) | Tetrahedral topological mesh generation method and electronic equipment | |
| Jiang et al. | Advanced axial compressor airfoils design and optimization | |
| Li et al. | Multiobjective optimization approach to turbomachinery blades design | |
| CN117473655B (en) | Aircraft simulation driving design method and device based on edge collapse grid optimization | |
| Lotz | Aerodynamic Optimization Process for Turbocharger Compressor Impellers | |
| CN116361516B (en) | Searching method based on unit to which multistage rectangular block query target point belongs | |
| O¨ ksu¨ z et al. | Axial turbine blade aerodynamic optimization using a novel multi-level genetic algorithm | |
| CN115238613B (en) | Fan blade shape optimization method and system, storage medium and equipment |
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 |