CN112363455A - Tool path determination method and system based on dynamics constraint - Google Patents

Tool path determination method and system based on dynamics constraint Download PDF

Info

Publication number
CN112363455A
CN112363455A CN202011200917.8A CN202011200917A CN112363455A CN 112363455 A CN112363455 A CN 112363455A CN 202011200917 A CN202011200917 A CN 202011200917A CN 112363455 A CN112363455 A CN 112363455A
Authority
CN
China
Prior art keywords
boundary
determining
point
contour
curved surface
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
Application number
CN202011200917.8A
Other languages
Chinese (zh)
Other versions
CN112363455B (en
Inventor
袁春明
马鸿宇
高小山
张立先
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Academy of Mathematics and Systems Science of CAS
Original Assignee
Academy of Mathematics and Systems Science of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Academy of Mathematics and Systems Science of CAS filed Critical Academy of Mathematics and Systems Science of CAS
Priority to CN202011200917.8A priority Critical patent/CN112363455B/en
Publication of CN112363455A publication Critical patent/CN112363455A/en
Application granted granted Critical
Publication of CN112363455B publication Critical patent/CN112363455B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00Programme-control systems
    • G05B19/02Programme-control systems electric
    • G05B19/18Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form
    • G05B19/19Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form characterised by positioning or contouring control systems, e.g. to control position from one programmed point to another or to control movement along a programmed continuous path

Abstract

The invention relates to a tool path determining method and system based on dynamic constraint. The method comprises the steps of obtaining a triangular mesh curved surface with a boundary; extracting the boundary according to the triangular mesh curved surface with the boundary; based on residual height constraint, offsetting each point on the currently offset boundary according to the feeding direction, and determining a contour offset curve of the currently offset boundary; eliminating self-crossed profile curves in the profile bias curves based on residual height constraint; repeating the processing until all the boundary offsets in the triangular mesh curved surface with the boundary are finished; determining a Fermat spiral line in each sub-area of the triangular mesh curved surface with the boundary based on the dynamic constraint according to each contour bias curve; determining communicated Fermat helices by adopting a spiral-contourr tree according to the Fermat helices in all the sub-regions; and determining a tool path according to the communicated Fermat spiral. The invention considers the dynamic constraint when generating the path, thereby effectively improving the feeding rate during processing.

Description

Tool path determination method and system based on dynamics constraint
Technical Field
The invention relates to the field of tool path determination, in particular to a tool path determination method and system based on dynamics constraint.
Background
The high-precision numerical control machining technology occupies a larger and larger proportion in the manufacturing of complex workpieces. The main flow of numerical control machining includes Computer Aided Design (CAD), Computer Aided Manufacturing (CAM), post-processing, and machining. With the rapid development of numerical control machine tools, people put higher demands on the precision and efficiency of the CAM in practical numerical control machining. Tool path planning plays a very important role in the CAM because the tool must follow the path of the planned tool location. Therefore, the quality of the tool location locus determines the machining precision and the machining efficiency to a certain extent.
Studies on tool path planning can be broadly divided into two categories: parametric form based studies and topological form based studies. The traditional path planning method based on the parameter form mainly comprises an isoparametric method, an isoplanar method and an isoparametric height method. The traditional path planning method based on the topological form is mainly divided into a direction parallel trajectory planning method, a spiral trajectory planning method and a space filling curve planning method.
The isoparametric method is mainly applied to the parametric curved surface S (u, v). And when the path is planned, keeping any one of the u and v parameters unchanged, and mapping the isoparametric line on the parameter plane to the parameter curved surface in Euclidean space to further generate the tool path. However, this method may cause the local area processing tracks to be too dense, the residual height distribution to be uneven, and the surface processing quality and the overall processing efficiency to be affected. The iso-planar method uses the intersection of a cluster of parallel planes (drive surfaces) and a curved surface to be machined to create a tool path. The key to this type of process is how to select the drive faces. Quinsit et al select the drive face by maximizing the material removal rate. Hu et al construct a scalar field based on residual height constraints and dynamic constraints, and then use the scalar field to select the optimal drive surface. The path generated by the iso-planar method hardly satisfies the residual height constraint because the processing line pitch thereof is kept constant and the curved surface to be processed is complicated. And the equal residual height method is that after the cutter position point Pi, j on the ith path is given, the cutter position point Pi +1, j corresponding to the next path is calculated in the direction vertical to the current feeding direction by using the preset maximum residual height. For the equal residual height method, the selection of the initial path is very important. The good initial path can effectively improve the processing efficiency. Giri et al gives a way to choose the initial path by analyzing the curvature of the surface. Chiou et al first propose a potential field method using the principle of energy field, and then select an initial path according to the maximum material removal rate. Lee et al calculate the machining bandwidth by effectively cutting the ellipse, and then generate the constant residual height tool machining path. Min et al propose a new equal residual height method based on the similarity of adjacent paths, and have very high computational efficiency.
In the direction parallel trajectory planning method, all paths are parallel to a preset straight line. All the tracks are connected end to form a zigzag track. This method is widely used for rough machining because of its simplicity. The spiral trajectory planning method is based on the curved surface boundary contour construction, and each path is an offset curve of a curved surface boundary. The path generated by the method has better continuity, does not need to frequently lift, cut and transfer, and is widely applied to cavity processing. However, for the space filling curve planning method, although the generated path has good continuity, the path is not commonly used because the calculation is complicated and the feeding direction changes frequently.
With the rapid development of CAD/CAM technology in recent years, triangular mesh models are widely applied in the fields of discrete geometric modeling, CNC (computerized numerical control) machining programming, graphics, images and the like. Due to its simple and mature characteristics, the triangular mesh model has become a common free curved surface representation form in computer graphics and numerical control processing. Therefore, the tool path planning research aiming at the triangular mesh model has important practical significance.
However, existing parametric form-based methods cannot be directly applied to triangular mesh models. On the triangular mesh model, there are several different tool path planning methods. Lee uses the profile offset curve under residual height constraint to generate a spiral curve tool path. Zhu et al generated a spiral tool path through a pre-set guideline and presented a method of finding a bias curve based on residual height error. Sun et al focus on numerical control machining of non-zero deficiency triangular mesh curved surfaces and propose a smooth tool path generation method for five-axis machining. However, these methods may result in the generated path not satisfying the residual height constraint when the self-crossing is eliminated.
However, the conventional topological-based method usually generates a tool path only on a simple single-valued curved surface. Therefore, an algorithm for generating a tool path on a free-form surface represented by a triangular mesh model is of interest.
Aiming at a two-dimensional plane and a three-dimensional space grid, Zhao et al realize a new tool path generation method on a triangular grid model: connected Fermat Spirals (CFS). The method uses a thermal approach to generate a shape-aware scalar field, and then concatenates these contours into a CFS. This type of tool path has several advantages: the whole cutter path only comprises a terminal point and a starting point, so that frequent cutter lifting and cutting-in are not needed; the whole curved surface to be processed can be completely covered by the CFS; the start and end points of a single fermat spiral can be chosen arbitrarily on the boundary, thus favouring the continuity of the path. However, Zhao et al primarily considers the generation of tool path trajectories from a geometric perspective, rather than numerical control machining. After the tool path is optimized, the tool path generated by Zhao et al has too many inflection points, and the dynamics constraint is not considered when the Fermat spiral is generated, so that the feeding rate in processing is reduced.
Disclosure of Invention
The invention aims to provide a tool path determining method and system based on dynamic constraint, which take the dynamic constraint into consideration when generating a path, thereby effectively improving the feeding rate during processing.
In order to achieve the purpose, the invention provides the following scheme:
a tool path determination method based on dynamic constraints comprises the following steps:
acquiring a triangular mesh curved surface with a boundary;
extracting the boundary of the triangular mesh curved surface with the boundary; each of said boundaries is represented by a sequence of points;
based on residual height constraint, offsetting each point on the currently offset boundary according to the feeding direction, and determining a contour offset curve of the currently offset boundary;
eliminating self-crossed profile curves in the profile bias curves based on residual height constraint; replacing the currently biased boundary with a next biased boundary, returning to the residual height constraint, biasing each point on the currently biased boundary according to the feeding direction, and determining a contour bias curve of the currently biased boundary until all the boundary biases in the triangular mesh curved surface with the boundary are finished;
determining a Fermat spiral in each sub-region of the triangular mesh curve with the boundary based on the dynamic constraint according to each contour bias curve;
determining communicated Fermat spiral lines by adopting a spiral-contourr tree according to Fermat spiral lines in all sub-areas; the spiral-contour tree is used for representing the adjacency relation of the Fermat spiral among each sub-area;
and determining a cutter path according to the communicated Fermat spiral.
Optionally, the determining, based on the residual height constraint, a contour bias curve of the currently biased boundary by biasing each point on the currently biased boundary according to the feeding direction further includes:
and calculating the path interval and the path interval direction according to the residual height constraint.
Optionally, the determining, based on the residual height constraint, a contour bias curve of the currently biased boundary by biasing each point on the currently biased boundary according to the feeding direction specifically includes:
acquiring the position and the feeding direction of the ith point on the current offset boundary;
determining a defined plane according to the position of the ith point and the feeding direction; the definition plane is intersected with the triangular mesh curved surface with the boundary;
determining a bias point corresponding to the ith point according to a line segment of the defined plane, which is intersected with the triangular mesh curved surface with the boundary, and the path interval direction corresponding to the ith point;
and determining a profile offset curve of the currently offset boundary according to all offset points of the currently offset boundary.
Optionally, the determining, by each of the profile bias curves, a fermat spiral in each sub-region of the triangular mesh surface with the boundary based on the dynamic constraint specifically includes:
acquiring a point with the maximum curvature on the contour offset curve;
and taking the point with the maximum curvature as a transfer point, increasing the angle corresponding to the point with the maximum curvature based on the dynamic constraint, and determining the Fermat spiral line in each sub-area of the triangular mesh surface with the boundary.
Optionally, the determining, according to the fermat spirals in all the sub-regions, a connected fermat spiral by using a spiral-contour tree further includes:
and smoothing the communicated Fermat spiral line by adopting a high-speed piecewise interpolation algorithm.
A tool path determination system based on kinematic constraints, comprising:
the triangular mesh curved surface acquisition module with the boundary is used for acquiring a triangular mesh curved surface with the boundary;
the boundary extraction module is used for extracting the boundary of the triangular mesh curved surface with the boundary; each of said boundaries is represented by a sequence of points;
the contour bias curve determining module is used for biasing each point on the currently biased boundary according to the feeding direction based on residual height constraint and determining a contour bias curve of the currently biased boundary;
the contour bias curve optimization module is used for eliminating self-crossed contour curves in the contour bias curves based on residual height constraint; replacing the currently biased boundary with a next biased boundary, returning to the residual height constraint, biasing each point on the currently biased boundary according to the feeding direction, and determining a contour bias curve of the currently biased boundary until all the boundaries in the triangular mesh curved surface with the boundary are biased;
the Fermat spiral determining module is used for determining the Fermat spiral in each sub-area of the triangular mesh curved surface with the boundary based on the dynamic constraint according to each contour bias curve;
the connected Fermat spiral determining module is used for determining the connected Fermat spiral by adopting a spiral-contourr tree according to the Fermat spirals in all the sub-areas; the spiral-contour tree is used for representing the adjacency relation of the Fermat spiral among each sub-area;
and the cutter path determining module is used for determining a cutter path according to the communicated Fermat spiral.
Optionally, the method further includes:
and the path interval and path interval direction determining module is used for calculating the path interval and the path interval direction according to the residual height constraint.
Optionally, the contour bias curve determining module specifically includes:
an ith point position and feed direction acquiring unit for acquiring a position and feed direction of an ith point on the currently biased boundary;
a defined plane determining unit for determining a defined plane according to the position of the ith point and the feeding direction; the definition plane is intersected with the triangular mesh curved surface with the boundary;
a bias point determining unit corresponding to the ith point, configured to determine a bias point corresponding to the ith point according to a line segment where the defined plane intersects the triangular mesh curved surface with the boundary and a path interval direction corresponding to the ith point;
and the contour bias curve determining unit is used for determining the contour bias curve of the currently biased boundary according to all the bias points of the currently biased boundary.
Optionally, the fermat spiral determining module specifically includes:
a point with the maximum curvature and a point with the minimum curvature acquiring unit, which are used for acquiring the point with the maximum curvature on the contour bias curve;
and the Fermat spiral determining unit is used for taking the point with the maximum curvature as a transfer point, increasing the corresponding angle with the maximum curvature based on the dynamic constraint and determining the Fermat spiral in each sub-area of the triangular mesh curve with the boundary.
Optionally, the method further includes:
and the path smoothing processing module is used for smoothing the communicated Fermat spiral by adopting a high-speed piecewise interpolation algorithm.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the invention provides a tool path determining method and system based on dynamics constraint, which are characterized in that the boundary of a triangular mesh curved surface with a boundary is extracted, each point on the current biased boundary is biased according to the feeding direction based on residual height constraint, the contour bias curve of the current biased boundary is determined, the determination of the contour bias curve of the boundary is repeated, the space filling of the triangular mesh curved surface with the boundary is further realized, the Fermat spiral line in each sub-area of the triangular mesh curved surface with the boundary is determined based on the dynamics constraint according to each contour bias curve, and the connected Fermat spiral line is determined by adopting a spiral-contourr tree according to the Fermat spiral lines in all sub-areas. Namely, a continuous cutter path communicated with the Fermat spiral line is generated, and the dynamic constraint is considered when the path is generated, so that the feeding speed in processing is effectively improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive labor.
FIG. 1 is a flow chart of a tool path determination method based on dynamic constraints according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a boundary of a triangular mesh surface with a boundary and a contour bias curve of the boundary;
FIG. 3 is a schematic diagram of a profile offset curve after elimination of the self-crossed profile curve;
FIG. 4 is a schematic diagram of a Fermat spiral determination process;
FIG. 5 is a schematic view of a connected Fermat spiral;
FIG. 6 is a schematic diagram of a tool path determination system based on dynamic constraints according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention aims to provide a tool path determining method and system based on dynamic constraint, which take the dynamic constraint into consideration when generating a path, thereby effectively improving the feeding rate during processing.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
Fig. 1 is a flow chart showing a method for determining a tool path based on dynamic constraints, as shown in fig. 1, the method for determining a tool path based on dynamic constraints, provided by the present invention, includes:
s101, acquiring a triangular mesh curved surface with a boundary.
S102, extracting the boundary of the triangular mesh curved surface with the boundary; each of the boundaries is represented by a sequence of points.
S103, based on residual height constraint, offsetting each point on the currently offset boundary according to the feeding direction, and determining a contour offset curve of the currently offset boundary. And the contour bias curve of the boundary of the current bias is an equivalent bias curve with equal residual height.
Before S103, further comprising:
and calculating the path interval and the path interval direction according to the residual height constraint.
Residual height may occur on the work surface as the tool moves along the tool path trajectory. The distance between the path traces is the knife contact path spacing. The calculation of the path pitch is related to the relief of the surface. A ball nose cutter is used to machine the curved surface. The path pitch depends on the local radius of curvature R of the curved surface, the feed direction, the tool radius R and the height h remaining on the curved surface. The maximum residual height h that is usually constrained is much smaller than the tool radius r, so the calculation of the path pitch can be simplified. Tool path spacing in plane when machining with ball nose toolfTool path spacing on convex surface lconvexTool path spacing on concave surface lconcaveCan be approximated by the following equation:
Figure BDA0002755121480000081
where e is the bow error (chord error) for tool path smoothing. To ensure that the path spacing is strictly greater than 0, e should be less than
Figure BDA0002755121480000082
Thus, the smoothed tool path can strictly satisfy the residual height constraint.
S103 specifically comprises the following steps:
acquiring the position of the ith point on the boundary of the current offset and the feeding direction.
The specific calculation process of the feeding direction of each point is as follows:
suppose there is a point P on the boundary0,iThe direction of feed at that point
Figure BDA0002755121480000083
Can be calculated by the following formula:
Figure BDA0002755121480000084
in the formula, P0,i-1And P0,i+1Are respectively of the same type as P0,iTwo adjacent dots.
Passing through point P0,iAnd the direction of feed
Figure BDA0002755121480000085
Determining a definition plane F0,i
Figure BDA0002755121480000086
Define plane F0,iAnd intersecting with the triangular mesh model to obtain a series of intersection line segments. These line segments can be regarded as points P0,iCorresponding bias point P1,iApproximation of geodesic lines therebetween. And the total length of these segments should be equal to the path spacing under the residual height constraint. But there may be two sets of such line segments. The direction of the path interval needs to be calculated
Figure BDA0002755121480000087
Make the bias point P1,iIn the correct orientation. Direction of path interval
Figure BDA0002755121480000088
Can be composed of
Figure BDA0002755121480000089
And point P0,iNormal vector of treatment
Figure BDA00027551214800000810
Is calculated by cross multiplication.
Determining a defined plane according to the position of the ith point and the feeding direction; the definition plane intersects with the triangular mesh surface with the boundary.
And determining a bias point corresponding to the ith point according to a line segment of the defined plane, which is intersected with the triangular mesh curved surface with the boundary, and the path interval direction corresponding to the ith point. The offset distance of the offset points should be equal to the tool path spacing.
And determining a profile offset curve of the currently offset boundary according to all offset points of the currently offset boundary.
A point P on the contour bias curve of the boundaryj,iFrom this point along the path interval direction, the corresponding offset point P is searched forwardj+1,iUp to the fold line Pj,iPj+1,iIs equal to the tool path spacing based on the residual height constraint.
Moving along the inter-path direction to the farthest point on the existing triangular patch. If the length of the broken line segment Pj,iBeta is greater than path interval lj,iOffset point Pj+1,iJust above this triangle. If not, the correct triangular patch is selected and the operation is repeated until the appropriate bias point P is foundj+1,i
As a specific example, a scalar d represents a polyline segment Pj,iThe cumulative length of β, this length is used to fit the geodesic distance. Equation of
Figure BDA0002755121480000091
Indicating that the point beta should be in the feed direction
Figure BDA0002755121480000092
On the determined plane. Equation of
Figure BDA0002755121480000093
Ensuring that the bias is always in the correct direction.
According to the above formula, two problems are considered.
The first problem is how to calculate the point β such that the point β satisfies the equation set, and | | | β - α | | is maximum.
The second problem is how to obtain a triangular patch f satisfying the following condition when the point β reaches the vertex1: f1Contains a vertex beta;
Figure BDA0002755121480000094
dough sheet f1The included angle between the path and the spacing direction is an acute angle.
For the first problem, β is at the triangular patch f1So that this problem can be translated to a flat surface. Will be in the direction of feed
Figure BDA0002755121480000095
Mapping to f1To use
Figure BDA0002755121480000096
And (4) showing.
Then go through f1Each strip is not in the same direction as
Figure BDA0002755121480000097
A vertical edge. Suppose that edge V is selected2V3Any point on the edge can be expressed as: (1-u) V2+uV3. The coefficient u may be calculated to determine that the condition β ∈ V is satisfied2V3
Figure BDA0002755121480000098
Point β of (d). The coefficient u can be calculated by:
Figure BDA0002755121480000099
if the point β determined by u satisfies the condition: u is 0. ltoreq. u.ltoreq.1 and
Figure BDA00027551214800000910
that point is the point to be found. If not, the next edge is selected until a suitable point is found.
For the second problem, the goal is to select the correct triangular patch f for the next iteration1. First find the 1-domain F of the vertex beta1. Each patch is then considered one by one until the correct triangular patch is found. Under the condition that: f. of1Including vertices beta and
Figure BDA00027551214800000911
meaning at patch f1The upper presence point q satisfies the following system of equations:
Figure BDA0002755121480000101
wherein
Figure BDA0002755121480000102
Is a patch f1The normal vector of (2). By simplifying the above equation, it can be obtained:
Figure RE-GDA0002882619470000104
if the above-mentioned ratio u/v is a positive number, f is indicated1The first two conditions are met. It is possible to obtain two patches f satisfying the first two conditions simultaneously1And f2. So that the third condition (f) needs to be used1Acute angle with respect to the direction of separation of the paths) to select the correct plane, which may be expressed as
Figure RE-GDA0002882619470000105
Wherein
Figure RE-GDA00028826194700001010
Is the normal vector of the beta point.
After the offset points are obtained according to the feeding direction, the boundary of the curved surface can be offset to obtain a profile offset curve, and the profile offset curve is shown in fig. 2.
S104, eliminating self-bred contour curves in the contour bias curves based on residual height constraint; and replacing the currently biased boundary with a next biased boundary, returning to the residual height constraint, biasing each point on the currently biased boundary according to the feeding direction, and determining the contour bias curve of the currently biased boundary until all the boundary biases in the triangular mesh curved surface with the boundary are finished.
As shown in fig. 3, point P is dividedtTowards PiPoint stretching allows processing to the entire area. PtThe distance to the adjacent profile curve is Hausdorf distance, so P needs to be consideredtMaximum distance to the profile curveSatisfies the residual height constraint, i.e. PtNeeds to be stretched to the point PMAnd P isMA distance to B of
Figure BDA0002755121480000106
Wherein l is PiThe path spacing at the points based on the residual height constraint.
After that, points B and B are obtained1And the new path is from point PMCan be calculated from the following equation:
Figure BDA0002755121480000107
wherein theta is the angle at which the curve self-crosses,
Figure BDA0002755121480000108
Is PiUnit vector of point angular bisector, S1And S2Is B1To the drop foot point corresponding to the original path as shown in fig. 3. Finally, P is addedMAre respectively reacted with S1And S2Are connected.
And S105, determining the Fermat spiral line in each sub-area of the triangular mesh surface with the boundary based on the dynamic constraint according to each contour bias curve.
S105 specifically comprises the following steps:
and acquiring a point with the maximum curvature on the profile offset curve.
The specific calculation of the normal curvature and the normal vector on the triangular mesh comprises the following steps:
and calculating normal vectors and normal curvatures on the vertexes of the triangular mesh. Vertex ViNormal vector of (1)
Figure BDA0002755121480000111
Can be calculated according to the following formula:
Figure BDA0002755121480000112
in the formula, FiIs vertex Vi1-field of; f. ofkIs FiMiddle triangular patch, gammakIs fkAt vertex ViInternal angle of (A)kIs a triangular patch fkThe area of (d);
Figure BDA0002755121480000113
is fkThe normal vector of (2).
Setting point P on triangular patch f1By using f1Calculates the normal and normal curvatures at point P, which can be located precisely by three vertices: p ═ V (1-u-V) V1+uV3+vV2. The coefficients u and v are calculated as follows:
Figure BDA0002755121480000114
in the formula (I), the compound is shown in the specification,
Figure BDA0002755121480000115
is a triangular patch f1The normal vector of (2).
Then, the normal vector of the point P is calculated by the information of the three vertexes and the position of the point P
Figure BDA0002755121480000116
Sum of normal curvature kp
Figure BDA0002755121480000117
kp=(1-u-v)k1+uk3+vk2In the formula, kiAnd
Figure BDA0002755121480000118
i is 1, 2, 3 is respectively the vertex ViAnd i is the normal curvature and normal vector of 1, 2, 3. Up to now, the normal vector and normal curvature of any point on the grid can be calculated.
And taking the point with the maximum curvature as a transfer point, increasing the angle corresponding to the point with the maximum curvature based on the dynamic constraint, and determining the Fermat spiral line in each sub-area of the triangular mesh surface with the boundary.
The switching connection is locally approximate to concentric circular arc connection, so that the number of inflection points in the cutter path is only half, and the path is smoother.
These two curves are projected onto a plane perpendicular to the normal vector of the transfer point and then the intersection of the tangent line with the adjacent profile curve can be tested.
The above steps are used to create a spiral path, which is then connected into a Fermat spiral. As shown in FIG. 4, taking concentric circles as an example, a transfer point P is selected on the second profile curve2Then the intersection point P is determined by the above steps1. At P1The first profile curve is broken at the point and the fiima spiral end point E is formed. Then P is added1Point and P2The dots are connected. Then determining the sum of P and P on the fourth contour curve2Corresponding transfer point P4And determining the intersection point P3. Will P3Is connected to P4And the above process is repeated until the fermat spiral line is formed.
S106, determining connected Fermat helices by adopting a spiral-contourr tree according to the Fermat helices in all the sub-regions, as shown in FIG. 5; the spiral-contourr tree is used for representing the adjacency relation of the Fermat spiral lines between each sub-area.
After S106, further comprising:
and smoothing the communicated Fermat spiral line by adopting a high-speed piecewise interpolation algorithm.
And S107, determining a cutter path according to the communicated Fermat spiral. Two adjacent profile curves may be disconnected and connected to create a continuous path. Repeating this step forms a spiral path. And this spiral path can be converted into a fermat spiral.
Fig. 6 is a schematic structural diagram of a tool path determining system based on dynamic constraints, and as shown in fig. 6, the tool path determining system based on dynamic constraints, provided by the present invention, includes:
a triangular mesh curved surface with boundary obtaining module 601, configured to obtain a triangular mesh curved surface with boundary;
a boundary extraction module 602, configured to extract a boundary of the triangular mesh surface with a boundary; each of the boundaries is represented by a sequence of points.
A contour bias curve determining module 603, configured to bias each point on the currently biased boundary according to the feeding direction based on the residual height constraint, and determine a contour bias curve of the currently biased boundary.
A contour bias curve optimization module 604, configured to eliminate self-intersected contour curves in the contour bias curves based on residual height constraints; and replacing the currently biased boundary with a next biased boundary, returning to the residual height constraint, biasing each point on the currently biased boundary according to the feeding direction, and determining a contour bias curve of the currently biased boundary until all the boundary biases in the triangular mesh curved surface with the boundary are finished.
A fermat spiral determining module 605, configured to determine a fermat spiral in each sub-region of the triangular mesh surface with boundaries based on the dynamic constraints according to each of the contour bias curves.
A connected fermat spiral determining module 606, configured to determine, according to the fermat spirals in all the sub-regions, connected fermat spirals by using a spiral-contour tree; the spiral-contourr tree is used to represent the adjacency of the fermat spiral between each sub-region.
And a tool path determining module 607 for determining a tool path according to the communicated fermat spiral.
The invention provides a tool path determining system based on dynamic constraint, which further comprises:
and the path interval and path interval direction determining module is used for calculating the path interval and the path interval direction according to the residual height constraint.
The contour bias curve determining module specifically comprises:
and the position and feeding direction acquiring unit is used for acquiring the position and feeding direction of the ith point on the current offset boundary.
A defined plane determining unit for determining a defined plane according to the position of the ith point and the feeding direction; the definition plane intersects with the triangular mesh surface with the boundary.
And the bias point determining unit corresponding to the ith point is used for determining the bias point corresponding to the ith point according to a line segment of the defined plane, which is intersected with the triangular mesh curved surface with the boundary, and the path interval direction corresponding to the ith point.
And the contour bias curve determining unit is used for determining the contour bias curve of the currently biased boundary according to all the bias points of the currently biased boundary.
The Fermat spiral determining module specifically comprises:
and the point acquisition unit is used for acquiring the point with the maximum curvature on the profile offset curve.
And the Fermat spiral determining unit is used for taking the point with the maximum curvature as a transfer point, increasing the corresponding angle with the maximum curvature based on the dynamic constraint and determining the Fermat spiral in each sub-area of the triangular mesh curve with the boundary.
The invention provides a tool path determining system based on dynamic constraint, which further comprises:
and the path smoothing processing module is used for smoothing the communicated Fermat spiral by adopting a high-speed piecewise interpolation algorithm.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system disclosed by the embodiment, the description is relatively simple because the system corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description.
The principles and embodiments of the present invention have been described herein using specific examples, which are provided only to help understand the method and the core concept of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed. In view of the above, the present disclosure should not be construed as limiting the invention.

Claims (10)

1. A tool path determination method based on dynamic constraints is characterized by comprising the following steps:
acquiring a triangular mesh curved surface with a boundary;
extracting the boundary of the triangular mesh curved surface with the boundary; each of said boundaries is represented by a sequence of points;
based on residual height constraint, offsetting each point on the currently offset boundary according to the feeding direction, and determining a contour offset curve of the currently offset boundary;
eliminating self-crossed profile curves in the profile bias curves based on residual height constraint; replacing the currently biased boundary with a next biased boundary, returning to the residual height constraint, biasing each point on the currently biased boundary according to the feeding direction, and determining a contour bias curve of the currently biased boundary until all the boundary biases in the triangular mesh curved surface with the boundary are finished;
determining a Fermat spiral line in each sub-region of the triangular mesh curved surface with the boundary based on dynamic constraints according to each contour bias curve;
determining communicated Fermat helices by adopting a spiral-contourr tree according to the Fermat helices in all the sub-regions; the spiral-contour tree is used for representing the adjacency relation of the Fermat spiral among each sub-area;
and determining a cutter path according to the communicated Fermat spiral.
2. The method of claim 1, wherein the determining the contour offset curve of the currently offset boundary by offsetting each point on the currently offset boundary according to the feeding direction based on the residual height constraint further comprises:
and calculating the path interval and the path interval direction according to the residual height constraint.
3. The method for determining a tool path based on dynamical constraints as claimed in claim 2, wherein the determining a contour bias curve of the currently biased boundary by biasing each point on the currently biased boundary according to the feeding direction based on residual height constraints specifically comprises:
acquiring the position and the feeding direction of the ith point on the current offset boundary;
determining a defined plane according to the position of the ith point and the feeding direction; the definition plane is intersected with the triangular mesh curved surface with the boundary;
determining a bias point corresponding to the ith point according to a line segment of the defined plane, which is intersected with the triangular mesh curved surface with the boundary, and the path interval direction corresponding to the ith point;
and determining a contour bias curve of the currently biased boundary according to all bias points of the currently biased boundary.
4. The tool path determining method based on dynamic constraints as claimed in claim 1, wherein the determining of the fimbrian spiral in each sub-region of the triangular mesh surface with the boundary based on the dynamic constraints for each contour bias curve specifically comprises:
acquiring a point with the maximum curvature on the contour offset curve;
and taking the point with the maximum curvature as a transfer point, increasing the corresponding angle of the point with the maximum curvature based on the dynamic constraint, and determining the Fermat spiral line in each sub-area of the triangular mesh curved surface with the boundary.
5. The tool path determining method based on dynamic constraints as claimed in claim 1, wherein the determining the connected fermat spiral by using a spiral-contourr tree according to the fermat spirals in all sub-regions further comprises:
and smoothing the communicated Fermat spiral line by adopting a high-speed piecewise interpolation algorithm.
6. A tool path determination system based on kinematic constraints, comprising:
the triangular mesh curved surface acquisition module with the boundary is used for acquiring a triangular mesh curved surface with the boundary;
the boundary extraction module is used for extracting the boundary of the triangular mesh curved surface with the boundary; each of said boundaries is represented by a sequence of points;
the contour bias curve determining module is used for biasing each point on the currently biased boundary according to the feeding direction based on residual height constraint and determining a contour bias curve of the currently biased boundary;
the contour bias curve optimization module is used for eliminating self-crossed contour curves in the contour bias curves based on residual height constraint; replacing the currently biased boundary with a next biased boundary, returning to the residual height constraint, biasing each point on the currently biased boundary according to the feeding direction, and determining a contour bias curve of the currently biased boundary until all the boundary biases in the triangular mesh curved surface with the boundary are finished;
the Fermat spiral determining module is used for determining the Fermat spiral in each sub-area of the triangular mesh curved surface with the boundary based on the dynamic constraint according to each contour bias curve;
the connected Fermat spiral determining module is used for determining the connected Fermat spiral by adopting a spiral-contourr tree according to the Fermat spirals in all the sub-areas; the spiral-contour tree is used for representing the adjacency relation of the Fermat spiral among each sub-area;
and the cutter path determining module is used for determining a cutter path according to the communicated Fermat spiral.
7. The tool path determination system based on dynamic constraints as claimed in claim 6, further comprising:
and the path interval and path interval direction determining module is used for calculating the path interval and the path interval direction according to the residual height constraint.
8. The tool path determining system based on dynamic constraints as claimed in claim 7, wherein the profile offset curve determining module specifically comprises:
an ith point position and feed direction acquiring unit for acquiring a position and feed direction of an ith point on the currently biased boundary;
a defined plane determining unit for determining a defined plane according to the position of the ith point and the feeding direction; the definition plane is intersected with the triangular mesh curved surface with the boundary;
a bias point determining unit corresponding to the ith point, configured to determine, according to a line segment where the defined plane intersects the triangular mesh curved surface with the boundary and a path interval direction corresponding to the ith point, a bias point corresponding to the ith point;
and the contour bias curve determining unit is used for determining the contour bias curve of the currently biased boundary according to all the bias points of the currently biased boundary.
9. The tool path determining system based on the dynamical constraint of claim 5, wherein the Fermat spiral determining module specifically comprises:
a point with the maximum curvature and a point with the minimum curvature acquiring unit, which are used for acquiring the point with the maximum curvature on the contour bias curve;
and the Fermat spiral determining unit is used for taking the point with the maximum curvature as a transfer point, increasing the corresponding angle of the point with the maximum curvature based on dynamic constraint and determining the Fermat spiral in each sub-area of the triangular mesh curved surface with the boundary.
10. The tool path determination system based on dynamic constraints as claimed in claim 5, further comprising:
and the path smoothing processing module is used for smoothing the communicated Fermat spiral by adopting a high-speed piecewise interpolation algorithm.
CN202011200917.8A 2020-11-02 2020-11-02 Tool path determination method and system based on dynamics constraint Active CN112363455B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011200917.8A CN112363455B (en) 2020-11-02 2020-11-02 Tool path determination method and system based on dynamics constraint

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011200917.8A CN112363455B (en) 2020-11-02 2020-11-02 Tool path determination method and system based on dynamics constraint

Publications (2)

Publication Number Publication Date
CN112363455A true CN112363455A (en) 2021-02-12
CN112363455B CN112363455B (en) 2021-09-24

Family

ID=74512525

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011200917.8A Active CN112363455B (en) 2020-11-02 2020-11-02 Tool path determination method and system based on dynamics constraint

Country Status (1)

Country Link
CN (1) CN112363455B (en)

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101615022A (en) * 2009-07-21 2009-12-30 中国科学院数学与系统科学研究院 Radius compensation method based on the three axis numerically controlled machine cutter of surface reconstruction
CN202838443U (en) * 2012-01-09 2013-03-27 北京电子科技学院 System for drawing curved surface by calculating all real roots and multiple numbers of zero-dimensional trigonometric polynomial system
CN103513607A (en) * 2013-09-22 2014-01-15 沈阳飞机工业(集团)有限公司 2.5-axis ring cutting knife track generating method based on mathematical morphology
CN104570928A (en) * 2013-10-29 2015-04-29 中国科学院沈阳自动化研究所 Method for numerical control machining and path planning on mesh surface based on conformal parameterization
CN108319224A (en) * 2018-03-13 2018-07-24 大连理工大学 A kind of multiaxis NC maching spiral path generation method based on diametral curve interpolation
CN108594764A (en) * 2018-03-19 2018-09-28 华侨大学 A kind of constant scallop-height cutter-contact point trace generation method of triangle grid model
CN108628247A (en) * 2018-02-01 2018-10-09 大连理工大学 Curved surface subregion Toolpath Generation method based on the residual high constraint in boundary
CN108803481A (en) * 2018-07-30 2018-11-13 山东大学 Free form surface ball-end mill paths planning method and system based on Fermat helix
CN108919827A (en) * 2018-06-27 2018-11-30 中国科学院数学与系统科学研究院 A kind of double suboptimization fast distribution methods of thrust vectoring flying vehicles control
KR101928502B1 (en) * 2016-08-31 2018-12-12 한온시스템 주식회사 Exhaust gas cooler and method for inserting cooling fins in an exhaust gas cooler
CN109116804A (en) * 2018-08-27 2019-01-01 武汉大学 A kind of residual high slotting milling cutter paths planning method of cavity lateral etc. based on the optimization of lateral step pitch
CN111474899A (en) * 2020-04-29 2020-07-31 大连理工大学 Triangular-based complex cavity high-speed numerical control milling spiral path generation method

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101615022A (en) * 2009-07-21 2009-12-30 中国科学院数学与系统科学研究院 Radius compensation method based on the three axis numerically controlled machine cutter of surface reconstruction
CN202838443U (en) * 2012-01-09 2013-03-27 北京电子科技学院 System for drawing curved surface by calculating all real roots and multiple numbers of zero-dimensional trigonometric polynomial system
CN103513607A (en) * 2013-09-22 2014-01-15 沈阳飞机工业(集团)有限公司 2.5-axis ring cutting knife track generating method based on mathematical morphology
CN104570928A (en) * 2013-10-29 2015-04-29 中国科学院沈阳自动化研究所 Method for numerical control machining and path planning on mesh surface based on conformal parameterization
KR101928502B1 (en) * 2016-08-31 2018-12-12 한온시스템 주식회사 Exhaust gas cooler and method for inserting cooling fins in an exhaust gas cooler
CN108628247A (en) * 2018-02-01 2018-10-09 大连理工大学 Curved surface subregion Toolpath Generation method based on the residual high constraint in boundary
CN108319224A (en) * 2018-03-13 2018-07-24 大连理工大学 A kind of multiaxis NC maching spiral path generation method based on diametral curve interpolation
CN108594764A (en) * 2018-03-19 2018-09-28 华侨大学 A kind of constant scallop-height cutter-contact point trace generation method of triangle grid model
CN108919827A (en) * 2018-06-27 2018-11-30 中国科学院数学与系统科学研究院 A kind of double suboptimization fast distribution methods of thrust vectoring flying vehicles control
CN108803481A (en) * 2018-07-30 2018-11-13 山东大学 Free form surface ball-end mill paths planning method and system based on Fermat helix
CN109116804A (en) * 2018-08-27 2019-01-01 武汉大学 A kind of residual high slotting milling cutter paths planning method of cavity lateral etc. based on the optimization of lateral step pitch
CN111474899A (en) * 2020-04-29 2020-07-31 大连理工大学 Triangular-based complex cavity high-speed numerical control milling spiral path generation method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
EUNGKI LEE: "Contour offset approach to spiral toolpath generation with constant scallop height", 《COMPUTER AIDED DESIGN LONDON BUTTERWORTH THE ELSEVIER》 *
刘聪: "自由曲面五轴加工刀轨生成与优化研究", 《中国优秀硕士学位论文全文数据库 工程科技II辑》 *
韩丽等: "离散曲率约束的三角网格模型拓扑分割算法", 《计算机辅助设计与图形学学报》 *

Also Published As

Publication number Publication date
CN112363455B (en) 2021-09-24

Similar Documents

Publication Publication Date Title
CN101907876B (en) Command point shaping, compressing and interpolating method suitable for numerical control device
CN105739432B (en) Grid free form surface annular cutter method for planning track based on improved B utterfly subdivisions
CN104907617B (en) Zoning cutting-based five-axis milling method of centrifugal compressor impeller
CN109343468B (en) Projection offset-based blade multi-axis track generation method
CN104570928A (en) Method for numerical control machining and path planning on mesh surface based on conformal parameterization
CN108549325A (en) A kind of free form surface arc length parameters Curve Machining orbit generation method
CN105739436A (en) Adaptive rapid interpolation method for numerical control machine tool spline curve
CN109214032B (en) A kind of adaptive machining method of hollow blade
CN111770829A (en) Method and system for additive manufacturing
CN107037779B (en) Free form surface NC process tool track optimizing method under non-homogeneous tolerance
CN108594764B (en) Equal-residual-height tool contact point track generation method for triangular mesh model
CN112518433A (en) Automatic generation method for tool path for complex curved surface polishing
Anotaipaiboon et al. Curvilinear space-filling curves for five-axis machining
Dhanda et al. Adaptive tool path planning strategy for freeform surface machining using point cloud
CN112363455B (en) Tool path determination method and system based on dynamics constraint
CN111474899B (en) Triangular-based complex cavity high-speed numerical control milling spiral path generation method
CN111610751B (en) Interpolation error multi-subdivision iterative calculation method for cross point set NURBS interpolation curve
CN113504764A (en) Continuous line segment numerical control machining path smoothing method based on position vector weighted integral
CN109991921B (en) Smooth B spline track direct generation method
CN117162492A (en) Curved surface 3D printing path planning method based on mechanical arm
CN116484635A (en) Sinusoidal arc fitting local fairing method based on improved arc fitting algorithm
CN103903304B (en) The arbitrary quadrilateral curved surface axis processed for product three-dimensional data generates method
CN109116804B (en) Cavity side wall equal-residual-height plunge milling cutter path planning method based on lateral step optimization
CN106981095B (en) A kind of improved smooth free-form deformation
CN113742835B (en) Novel optimization design method of hyperboloid curtain wall

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