CN101256402B - Method, system and digital control equipment for determining digital control process course - Google Patents
Method, system and digital control equipment for determining digital control process course Download PDFInfo
- Publication number
- CN101256402B CN101256402B CN2007101249134A CN200710124913A CN101256402B CN 101256402 B CN101256402 B CN 101256402B CN 2007101249134 A CN2007101249134 A CN 2007101249134A CN 200710124913 A CN200710124913 A CN 200710124913A CN 101256402 B CN101256402 B CN 101256402B
- Authority
- CN
- China
- Prior art keywords
- point
- dot matrix
- loop
- pole span
- digital control
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Feedback Control In General (AREA)
Abstract
The invention provides a determination method, a system and a numerical control device for a numerical control machining route suitable to the field of industrial numerical control. The method comprises the following steps: acquiring coordinate data of moving dot matrices; arranging the moving dot matrices with the origin as a starting point; determining a smallest triangular loop based on the starting point; determining a new dot matrix numerical control machining route by selecting four dots to construct a new dot matrix loop, the selected fourth dot satisfying the condition that each total length is minimum when the fourth dot is placed in each edge of the triangular loop; inserting the residual dots into the loop according to the selected way of the fourth dot; inserting one by one the dots into different positions in the smallest triangular loop to form the numerical control machining route according to small distances between the moving dot matrices and the origin, from small to large, the positions satisfying the condition that the formed numerical control machining route is the smallest loop, thereby providing a more feasible and faster method for subsequent NC optimization programming.
Description
Technical field
The invention belongs to industrial numerical control field, relate in particular to a kind of definite method, system and numerical control device of digital control processing route.
Background technology
In industrial numerical control program (NC), a PCB is drilled through the hole of 1500 different coordinates, must comprise 1500 coordinate datas inequality so in the numerical control program, begin to go through from the machine initial point all over behind all coordinates at drill bit and return initial point, this has just constituted the moving line of a closed loop.But, in this large-scale dot matrix, drill bit move possible route number have 1500! More than, if obviously be difficult to realize by manually coming picture to get a shortest route of total distance.
At this problem, exist many algorithms to solve this type of problem, for example nearest neighbour method (nearest neighbor), simulated annealing (Recuit Algorithm), genetic algorithm and neural network algorithm etc., but this algorithm often causes practical programs flow process complexity, calculating scale to strengthen at double, brings very big obstacle for the travelling speed of final software.
Summary of the invention
The purpose of the embodiment of the invention is to provide a kind of definite method of digital control processing route, is intended to solve the shortest path of determining according to prior art and causes the actual slow problem of program complexity, travelling speed.
The embodiment of the invention is achieved in that a kind of definite method of digital control processing route, and described method comprises the steps:
Obtain the coordinate data of mobile dot matrix;
With the initial point is that starting point is arranged described mobile dot matrix;
According to described starting point, determine a smallest triangle loop;
According to described smallest triangle loop, choose the 4th point and carry out determining of new dot matrix digital control processing route, construct new dot matrix loop, wherein, described the 4th point of choosing satisfies the condition of this point being put into each bar limit calculating total loop length minimum separately in triangle loop;
According to the mode of choosing of described the 4th point, other left point in the dot matrix is all inserted the loop, need to satisfy the condition of other left points in the dot matrix being put into each bar limit calculating total loop length minimum separately in polygon loop;
In remaining mobile dot matrix according to from described starting point pole span from ascending rank order, the diverse location that inserts one by one in the smallest triangle loop forms the digital control processing route, the digital control processing route that formation can be satisfied in described position is a shortest cycle.
Another purpose of the embodiment of the invention is to provide a kind of digital control processing route fixed system really, and described system comprises:
The coordinate data acquisition module is used to obtain the coordinate data of mobile dot matrix;
The dot matrix order module, being used for the initial point is that starting point is arranged described mobile dot matrix;
Minimum triangle loop determination module is used for according to described starting point, determines a smallest triangle loop; And
Shortest cycle ordered series of numbers determination module, be used for according to described smallest triangle loop, choose the 4th point and carry out determining of new dot matrix digital control processing route, construct new dot matrix loop, wherein, described the 4th point of choosing satisfies the condition of this point being put into each bar limit calculating total loop length minimum separately in triangle loop; According to the mode of choosing of described the 4th point, other left point in the dot matrix is all inserted the loop, need to satisfy the condition of other left points in the dot matrix being put into each bar limit calculating total loop length minimum separately in triangle loop; And in remaining mobile dot matrix according to from described starting point pole span from ascending rank order, the diverse location that inserts one by one in the smallest triangle loop forms the digital control processing route, the digital control processing route that formation can be satisfied in described position is the shortest loop.
Another purpose of the embodiment of the invention is to provide a kind of numerical control device, comprises digital control processing route fixed system really, and described system comprises:
The coordinate data acquisition module is used to obtain the coordinate data of mobile dot matrix;
The dot matrix order module, being used for the initial point is that starting point is arranged described mobile dot matrix;
Minimum triangle loop determination module is used for according to described starting point, determines a smallest triangle loop; And
Shortest cycle ordered series of numbers generation module, be used for according to described smallest triangle loop, choose the 4th point and carry out determining of new dot matrix digital control processing route, construct new dot matrix loop, wherein, described the 4th point of choosing satisfies the condition of this point being put into each bar limit calculating total loop length minimum separately in triangle loop; According to the mode of choosing of described the 4th point, other left point in the dot matrix is all inserted the loop, need to satisfy the condition of other left points in the dot matrix being put into each bar limit calculating total loop length minimum separately in polygon loop; And in remaining mobile dot matrix according to from described starting point pole span from ascending rank order, the diverse location that inserts one by one in the smallest triangle loop forms the digital control processing route, the digital control processing route that formation can be satisfied in described position is the shortest loop.
In embodiments of the present invention, triangle loop (loop is unique in the dot matrix of three points) at first by building a minimum, and in remaining dot matrix according to from the starting point pole span from little to big rank order, sound out the diverse location that inserts in the loop one by one and construct new shortest cycle, insert the route ordering that iteration is had a few to finish by this continuous exploration to satisfy.Obtain shortest cycle by this mode, write the method that the NC optimizer provides more feasible, a faster victory for follow-up.
Description of drawings
Fig. 1 is the realization flow figure of definite method of the digital control processing route that provides of the embodiment of the invention;
What Fig. 2 was that the embodiment of the invention provides is the process flow diagram that starting point is arranged dot matrix with the initial point;
Fig. 3 is that 4 points of choosing that the embodiment of the invention provides carry out the realization flow figure that sorts in new dot matrix loop;
Fig. 4 is the digital control processing route that provides of an embodiment of the invention fixed system block diagram really.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer,, the present invention is further elaborated below in conjunction with drawings and Examples.Should be appreciated that specific embodiment described herein only in order to explanation the present invention, and be not used in qualification the present invention.
In embodiments of the present invention, suppose to have one figure g=(v, e), wherein v is a vertex set, and e is the limit collection, establishes the distance matrix that d=(dij) is made up of the distance between summit i and the summit j, traveling salesman problem (TSP) be exactly to obtain one by all summits and each summit the loop by once only with bee-line, if for dot matrix v={v1, v2, v3 ..., the access order of vn} is t=(t1, t2, t3 ... ti ..., tn), ti ∈ v (i=1,2,3 wherein,, n), and note tn+1=t1, then the mathematical model of this TSP problem is: min l=σ d (t (i), t (i+1)) wherein (i=1 ..., n).
In the numerical control program problem, the for example production and processing of PCB, machinery requirement operation NC program is gone through all over all coordinate dot matrix and is holed, and need go through to carry out components and parts all over porose coordinate and adorning, and split all coordinate dot matrix that comprised in the NC program, carry out route oriented targetedly.
In the embodiment of the invention, oriented at this route, propose one easy, effective algorithm, this embodiment selects to have the components and parts that generally use scale and is adorning NC program (about 200 are not waited the dot matrix coordinate) data as the analysis and research object, its thinking is the triangle loop (loop is unique in the dot matrix of three points) by building a minimum at first, and in remaining dot matrix according to from the starting point pole span from little to big rank order, sound out the diverse location that inserts in the loop one by one and construct new shortest cycle, insert the route ordering that iteration is had a few to finish by this continuous exploration to satisfy.
Fig. 1 shows the realization flow of definite method of the digital control processing route that the embodiment of the invention provides, and its detailed step is as described below:
In step S101, obtain the coordinate data of mobile dot matrix.
In step S102, (O O) arranges dot matrix for starting point with initial point.In numerical control program NC, must go through all over after all point coordinate elements from initial point, the initial point that resets again finishes, (O is O) as initial and end point so choose initial point.
In step S103, (O is O) as the initial smallest triangle loop of structure, summit with initial point.
In embodiments of the present invention, (O, closest approach O) and inferior closest approach construct a smallest triangle loop as two other summit of smallest triangle to select to close on initial point.
In step S104, smallest triangle loop according to this structure, choose the 4th point and carry out determining of new dot matrix digital control processing route, promptly construct new dot matrix loop, wherein the 4th point satisfies the condition of this point being put into each bar limit calculating total loop length minimum separately in triangle loop.
In step S105, according to the dot matrix loop sort method of step S104, other left point in this program dot matrix is all inserted the loop, need to satisfy the condition of this point being put into each bar limit calculating total loop length minimum separately in polygon loop equally.
In embodiments of the present invention, this sort method is in the limited computer capacity all the time, can calculate Vn dot matrix ordering number of times, insert according to visiting since the 4th point, for previous definite digital control processing route (shortest cycle) is triangle, and just V4 o'clock inserts number of times to the loop on three limits is 3 times; The 5th some V5 then needs to insert 4 times ..., n point then needs n-1 time, so total degree is (3+ (n-1)) * (n-3)/2.
In step S106, in remaining mobile dot matrix, according to from described starting point pole span from ascending rank order, the diverse location that inserts one by one in the shortest cycle forms the digital control processing route, it is up-to-date shortest cycle that the digital control processing route that forms can be satisfied in this position, and this shortest cycle ordered series of numbers is returned numerical control NC program again.
As one embodiment of the present of invention, what Fig. 2 showed that the embodiment of the invention provides is the flow process that starting point is arranged mobile dot matrix with the initial point, and its detailed step is as described below:
In step S201, read numerical control NC routine data, to obtain the coordinate data of mobile dot matrix.
In step S202, choose initial point (0,0) as initial and end point.
In step S203, with the pole span numerical value of first i pole span parameter m inL as minimum, this i point is for removing the point outside the initial point, i=1 wherein ..., n-1, this search procedure is the outer circulation process, wherein n is a dot matrix.
In step S204, search is searched other j is arranged, j=i+1 wherein ..., n, this search procedure is an inner cyclic process.
In step S205, whether the pole span L that judges this j less than this minimum pole span parameter m inL, is execution in step S206 then, otherwise execution in step S207.
In step S206, when the pole span L that judges this j＜minL, then the pole span L with this j is changed to minimum pole span parameter m inL, simultaneously i, the pairing data of j location point is exchanged mutually.
In step S207, when the pole span L that judges this j＞minL, continue search next point, i.e. j=j+1.
In step S208, according to this search, get access to the shortest apsis i, this process has realized once should interiorly circulating, and then this i is moved to first of ordered series of numbers, makes i=i+1, carries out outer circulation next time.
In embodiments of the present invention, realized the ordering of dot matrix according to circulation, outer circulation in this.
As an alternative embodiment of the invention, 4 points of choosing that Fig. 3 shows the embodiment of the invention to be provided carry out the realization flow that sorts in new dot matrix loop, and its detailed step is as described below:
In step S301, in remaining dot matrix, be about to the 4th point and be inserted in the loop, according to total distance of this route of digital control processing route calculation of default sort, be changed to current shortest cycle parameter value minD promptly according to the order of V1 → V2 → V3 → V4, and with this distance numerical value.
In step S302, the 4th point is inserted into the different highway sections of digital control processing route, construct new digital control processing route, calculate the distance numerical value D of each different route, i.e. calculated route V1 → V2 → V4 → V3, V1 → V4 → V2 → V3 distance numerical value separately.
In step S303, whether the distance numerical value D that calculates among the determining step S302 less than shortest cycle parameter value minD, is execution in step S304 then, otherwise execution in step S305.
In step S304, as the distance numerical value D that calculates during less than shortest cycle parameter value minD, then the arrangement position with this distance numerical value D correspondence is up-to-date shortest cycle, and promptly this up-to-date shortest cycle is definite digital control processing route, and this distance numerical value D is changed to shortest cycle parameter value minD.
In step S305, when the distance numerical value D that calculates is not less than shortest cycle parameter value minD, then keep at the 4th at the up-to-date shortest cycle of the pairing arrangement position of former minD, i.e. the digital control processing route of this up-to-date shortest cycle for determining for structure.
In embodiments of the present invention, there be n point in the dot matrix of this numerical control program, this process is the ordering implementation procedure of the shortest cycle dot matrix of the 4th point, be definite process of digital control processing route, other point (the 5th point, the 6th point, the ordering implementation procedure of shortest cycle dot matrix n point) is also similar, and it is shortest cycle that the point that promptly is inserted into the digital control processing route need satisfy this digital control processing route, repeats no more.
Fig. 4 shows digital control processing route that the embodiment of the invention the provides block diagram of fixed system really, for convenience of explanation, only show the part relevant with the embodiment of the invention among the figure, this digital control processing route fixed system really is built in software unit, hardware cell or the software and hardware combining unit of numerical control device.
This digital control processing route fixed system really comprises coordinate data acquisition module 11, dot matrix order module 12, minimum triangle loop determination module 13 and shortest cycle ordered series of numbers determination module 14, wherein, coordinate data acquisition module 11 obtains the coordinate data of mobile dot matrix, dot matrix order module 11 is that starting point is arranged dot matrix with the initial point, minimum triangle loop determination module 12 is according to this starting point, determine a smallest triangle loop, then, shortest cycle ordered series of numbers determination module 13 in remaining mobile dot matrix according to from described starting point pole span from ascending rank order, the diverse location that inserts one by one in the described smallest triangle loop forms the digital control processing route, and it is the shortest loop that the digital control processing route that forms can be satisfied in described position.
As one embodiment of the present of invention, this dot matrix order module 12 comprises that specifically minimum pole span parameter is provided with module 121, pole span judge module 122 and ordering processing module 123, wherein, the pole span numerical value that minimum pole span parameter is provided with module 121 first i is set to minimum pole span parameter m inL, i=1 wherein,, n-1; N is a dot matrix; Whether pole span judge module 122 judges the pole span L of other j less than minimum pole span parameter m inL, j=i+1 wherein ..., n; When the pole span L of judging point j＜minL, the pole span L that 123 of processing modules of ordering will be put j is changed to minimum pole span parameter m inL, simultaneously i, the pairing data of j location point is exchanged mutually.
As an alternative embodiment of the invention, shortest cycle ordered series of numbers determination module 14 specifically comprises configuration module 141, digital control processing route constructing module 142, distance numerical evaluation module 143, distance numerical value judge module 144 and shortest cycle processing module 145, wherein, configuration module 141 is in remaining dot matrix, to be changed to current shortest cycle parameter value according to the distance of the digital control processing route calculation of dot matrix default sort, wherein a battle array default sort be in remaining dot matrix according to from the starting point pole span from ascending order; The digital control processing route of the dot matrix that digital control processing route constructing module 142 structures are new; Distance numerical evaluation module 143 is calculated the distance numerical value of each different digital control processing route; Distance numerical value judge module 144 judges that whether the distance numerical value in this loop is less than the shortest cycle parameter value; The distance numerical value of judging the numerical control processing routes when this distance numerical value judge module 144 is during less than the shortest cycle parameter value, shortest cycle processing module 145 as up-to-date shortest cycle, and is changed to the shortest cycle parameter value with this distance numerical value with the digital control processing route of the arrangement position of distance numerical value correspondence.
In embodiments of the present invention, triangle loop (loop is unique in the dot matrix of three points) at first by building a minimum, and in remaining dot matrix according to from the starting point pole span from little to big rank order, sound out the diverse location that inserts in the loop one by one and construct new shortest cycle, insert the route ordering that iteration is had a few to finish by this continuous exploration to satisfy.Obtain shortest cycle by this mode, for the follow-up NC optimizer of writing provides more feasible a, method more efficiently.
The above only is preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (6)
1. definite method of a digital control processing route is characterized in that, described method comprises the steps:
Obtain the coordinate data of mobile dot matrix;
With the initial point is that starting point is arranged described mobile dot matrix;
According to described starting point, determine a smallest triangle loop;
According to described smallest triangle loop, choose the 4th point and carry out determining of new dot matrix digital control processing route, construct new dot matrix loop, wherein, described the 4th point of choosing satisfies the condition of this point being put into each bar limit calculating total loop length minimum separately in triangle loop;
According to the mode of choosing of described the 4th point, other left point in the dot matrix is all inserted the loop, need to satisfy the condition of other left points in the dot matrix being put into each bar limit calculating total loop length minimum separately in polygon loop;
In remaining mobile dot matrix according to from described starting point pole span from ascending rank order, the diverse location that inserts one by one in the smallest triangle loop forms the digital control processing route, the digital control processing route that formation can be satisfied in described position is a shortest cycle.
2. definite method of digital control processing route as claimed in claim 1 is characterized in that, the described step that with the initial point is starting point is arranged dot matrix specifically comprises the steps:
The pole span numerical value of first i is set to minimum pole span parameter m inL, and described some i is the point of removing outside the initial point, i=1 wherein ..., n-1; N is a n point in the dot matrix, and the process of searching for described some i is outer circulation;
Whether the pole span L that judge to remove puts other j the i less than described minimum pole span parameter m inL, j=i+1 wherein ..., n; The process of searching for described some j is interior circulation;
When the pole span L that judges described some j＜minL, then the pole span L with this j is changed to minimum pole span parameter m inL, simultaneously i, the pairing data of j location point is exchanged mutually;
This i is moved to first of ordered series of numbers, make i=i+1, carry out outer circulation next time.
3. digital control processing route fixed system really is characterized in that described system comprises:
The coordinate data acquisition module is used to obtain the coordinate data of mobile dot matrix;
The dot matrix order module, being used for the initial point is that starting point is arranged described mobile dot matrix;
Minimum triangle loop determination module is used for according to described starting point, determines a smallest triangle loop; And
Shortest cycle ordered series of numbers determination module, be used for according to described smallest triangle loop, choose the 4th point and carry out determining of new dot matrix digital control processing route, construct new dot matrix loop, wherein, described the 4th point of choosing satisfies the condition of this point being put into each bar limit calculating total loop length minimum separately in triangle loop; According to the mode of choosing of described the 4th point, other left point in the dot matrix is all inserted the loop, need to satisfy the condition of other left points in the dot matrix being put into each bar limit calculating total loop length minimum separately in polygon loop; And in remaining mobile dot matrix according to from described starting point pole span from ascending rank order, the diverse location that inserts one by one in the smallest triangle loop forms the digital control processing route, the digital control processing route that formation can be satisfied in described position is the shortest loop.
4. digital control processing route as claimed in claim 3 is fixed system really, it is characterized in that, described dot matrix order module specifically comprises:
Minimum pole span parameter is provided with module, and the pole span numerical value that is used for first i is set to minimum pole span parameter m inL, and described some i is the point of removing outside the initial point, i=1 wherein ..., n-1, n are n point in the dot matrix, the process of searching for described some i is outer circulation;
Whether pole span judge module, the pole span L that is used to judge other j except that some i less than described minimum pole span parameter m inL, j=i+1 wherein ..., n; The process of searching for described some j is interior circulation; And
The ordering processing module, when being used for the minimum pole span parameter m inL of pole span L＜described as described some j of described pole span judge module judgement, the pole span L that then will put j is changed to up-to-date minimum pole span parameter m inL, simultaneously i, the pairing data of j location point is exchanged mutually; This i is moved to first of ordered series of numbers, make i=i+1, carry out outer circulation next time.
5. a numerical control device is characterized in that, comprises digital control processing route fixed system really, and described system comprises:
The coordinate data acquisition module is used to obtain the coordinate data of mobile dot matrix;
The dot matrix order module, being used for the initial point is that starting point is arranged described mobile dot matrix;
Minimum triangle loop determination module is used for according to described starting point, determines a smallest triangle loop; And
Shortest cycle ordered series of numbers generation module, be used for according to described smallest triangle loop, choose the 4th point and carry out determining of new dot matrix digital control processing route, construct new dot matrix loop, wherein, described the 4th point of choosing satisfies the condition of this point being put into each bar limit calculating total loop length minimum separately in triangle loop; According to the mode of choosing of described the 4th point, other left point in the dot matrix is all inserted the loop, need to satisfy the condition of other left points in the dot matrix being put into each bar limit calculating total loop length minimum separately in polygon loop; And in remaining mobile dot matrix according to from described starting point pole span from ascending rank order, the diverse location that inserts one by one in the smallest triangle loop forms the digital control processing route, the digital control processing route that formation can be satisfied in described position is the shortest loop.
6. numerical control device as claimed in claim 5 is characterized in that, described dot matrix order module specifically comprises:
Minimum pole span parameter is provided with module, and the pole span numerical value that is used for first i is set to minimum pole span parameter m inL, and described some i is the point of removing outside the initial point, i=1 wherein ..., n-1, n are n point in the dot matrix, the process of searching for described some i is outer circulation;
Whether pole span judge module, the pole span L that is used to judge other j except that some i less than described minimum pole span parameter m inL, j=i+1 wherein ..., n; The process of searching for described some j is interior circulation; And
The ordering processing module, when being used for the minimum pole span parameter m inL of pole span L＜described as described some j of described pole span judge module judgement, the pole span L that then will put j is changed to up-to-date minimum pole span parameter m inL, simultaneously i, the pairing data of j location point is exchanged mutually; This i is moved to first of ordered series of numbers, make i=i+1, carry out outer circulation next time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101249134A CN101256402B (en) | 2007-12-07 | 2007-12-07 | Method, system and digital control equipment for determining digital control process course |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101249134A CN101256402B (en) | 2007-12-07 | 2007-12-07 | Method, system and digital control equipment for determining digital control process course |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101256402A CN101256402A (en) | 2008-09-03 |
| CN101256402B true CN101256402B (en) | 2011-04-06 |
Family
ID=39891279
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101249134A Expired - Fee Related CN101256402B (en) | 2007-12-07 | 2007-12-07 | Method, system and digital control equipment for determining digital control process course |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101256402B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105787137A (en) * | 2014-12-23 | 2016-07-20 | 重庆航凌电路板有限公司 | PCB (Printed Circuit Board) drilling path optimization algorithm |
| CN105549532B (en) * | 2016-02-29 | 2018-05-29 | 广东成德电子科技股份有限公司 | A kind of electron plate numerical control processing track method and device for planning |
-
2007
- 2007-12-07 CN CN2007101249134A patent/CN101256402B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN101256402A (en) | 2008-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104462190B (en) | A kind of online position predicting method excavated based on magnanimity space tracking | |
| Kala | Rapidly exploring random graphs: motion planning of multiple mobile robots | |
| Hu et al. | Minimising the energy consumption of tool change and tool path of machining by sequencing the features | |
| Song et al. | Efficient routing on large road networks using hierarchical communities | |
| CN103970960B (en) | The element-free Galerkin structural topological optimization method accelerated parallel based on GPU | |
| CN106714110A (en) | Auto building method and system of Wi-Fi position fingerprint map | |
| CN109668561B (en) | Indoor path planning method, terminal and readable storage medium | |
| CN103529843A (en) | Lambda path planning algorithm | |
| CN107092978B (en) | Shortest path layered planning method for virtual earth | |
| CN102393926B (en) | Intelligent decision-making method of safe route for underground emergent people evacuation | |
| CN110619187B (en) | Concrete dam construction scheme and resource conflict detection and adjustment method | |
| CN108827311A (en) | A kind of manufacturing shop unmanned handling system paths planning method | |
| CN102523155B (en) | Boost Graph library-based K shortest path searching method and system | |
| CN116050689B (en) | Intelligent searching method, system, terminal and medium for wide-area space railway line | |
| CN101256402B (en) | Method, system and digital control equipment for determining digital control process course | |
| CN114969234A (en) | Vector characterization method for full-quantity city road network | |
| CN105490830A (en) | Method and system for finding ring structure in network topological graph | |
| CN104376084A (en) | Method and device for calculating path similarity | |
| Sun et al. | Research on global path planning for AUV based on GA | |
| Kulkarni et al. | A genetic algorithm for layout problems in cellular manufacturing systems | |
| CN111323036B (en) | Method and system for intelligently optimizing path of stock yard, electronic equipment and storage medium | |
| US20220300002A1 (en) | Methods and systems for path planning in a known environment | |
| CN107564289B (en) | Road network preprocessing method for merging traffic nodes | |
| Majeed Ahmad AL-Hadad | Corridor Based Horizontal Highway Alignment Optimization Using GIS and Genetic Algorithms | |
| Liang et al. | An adaptive ant colony system for public bicycle scheduling problem |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110406 Termination date: 20191207 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |