CN110503203A - A kind of application method of design knowledge solving system based on CAD and system - Google Patents
A kind of application method of design knowledge solving system based on CAD and system Download PDFInfo
- Publication number
- CN110503203A CN110503203A CN201910767369.8A CN201910767369A CN110503203A CN 110503203 A CN110503203 A CN 110503203A CN 201910767369 A CN201910767369 A CN 201910767369A CN 110503203 A CN110503203 A CN 110503203A
- Authority
- CN
- China
- Prior art keywords
- bound term
- bound
- term
- module
- digraph
- 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.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/02—Knowledge representation; Symbolic representation
- G06N5/022—Knowledge engineering; Knowledge acquisition
- G06N5/025—Extracting rules from data
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Computational Linguistics (AREA)
- Computing Systems (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- General Factory Administration (AREA)
Abstract
The invention discloses a kind of design knowledge solving system based on CAD includes that bound term definition module, knowledge definition file, digraph parsing module, bound term solve module and bound term application module；Bound term definition module is for defining different types of bound term in product design process；Knowledge definition file allows digraph parsing module to be read out for recording bound term；Digraph parsing module is ranked up the solution of all bound terms；Bound term solves module and carries out calculating parsing to bound term according to Structure matrix；Bound term application module is updated threedimensional model according to parsing result.System of the invention increases various forms of knowledge constraints into component by way of increasing increment, also pass through addition objects association simultaneously, define dimension constraint, define morpheme constraint etc., due to the use of CAD system integrated functionality, computer can calculate, parse various constraint rules, and then realize man-machine rational division of work, improve working efficiency.
Description
Technical field
The present invention relates to computer aided technique field more particularly to a kind of design knowledge solving system based on CAD and
The application method of system.
Background technique
With the rapid development of manufacturing, the R&D cycle of product just constantly shortens.At the same time, current people are to production
The requirement of quality is also continuously improved.So how the different expression form during designing and manufacturing will be lain in the past
The form that knowledge can be identified and be handled with computer indicates, realize the reuse of knowledge, and realizes Knowledge driving with this
The Automation Design becomes highly important research direction.
The product-design knowledge form of expression can be formula, equation group, rule, external data base, chart, design example
Deng, these various forms of knowledge constraints constitute the knowledge base in CAD System of Intelligent, in product design process by pair
Knowledge-based reasoning and parsing obtain satisfactory result.
However at this stage, due in the knowledge Modeling technology of product, reasoning solution technique, expressing for knowledge and utilizing
The deficiency of key technology, such as complete domain knowledge base and integrated large-scale knowledge processing environment be difficult to construct, common sense
Property or implicit knowledge can not be described with current knowledge representation method, and for the working mechanism of human brain, people can't
It is simulated well, and in innovation ability and complicated design process, the mechanism such as tissue, coordination, management, control can not
The harmony between man-machine is realized by effective means, and Knowledge based engineering CAD system can't meet above-mentioned requirements and mesh well
's.
But in CAD system at this stage, only the product-design knowledge of formula form can be processed, and it is a large amount of its
Its knowledge form is then beyond expression of words and handles.Now, there are also CAD system trials, and knowing for components is generated using script
Know model.Such as the Knowledge Fusion module in NX, the method that its knowledge Modeling uses is scripting language programming, i.e. skill
Art personnel express his design idea by writing shell script, define the inference rule of product and generate desired by oneself
Geometrical model.This mode requires user to must be familiar with the programming grammar of script, while being come using scripting language's program
It is complicated, difficult more many than modeling under interactive environment to create complicated threedimensional model, the volume of knowledge is carried out using scripting language
Writing with maintenance also will be heavy, difficult work, while also will limit the creative thinking of project planner, obtain it
Less than preferably playing.
Therefore, a kind of mechanism is created, technical staff is allowed more multi-form knowledge other than formula to be added to zero
In components designing, such as to control the design cycle of product, external data file is accessed, nonlinear equation in design
The calculating etc. of (group), realizes the reuse of design knowledge, when newly being designed, by these knowledge constraints and CAD components interior
Expression formula carries out analytical Calculation together, is very valuable in actual operation.
Summary of the invention
Goal of the invention: in CAD system at this stage, only the product-design knowledge of formula form can be located
Reason, and the problem of other knowledge form is beyond expression of words and processing, the present invention proposes that a kind of design knowledge based on CAD solves system
The application method of system and system.
Technical solution: to achieve the purpose of the present invention, the technical scheme adopted by the invention is that:
A kind of design knowledge solving system based on CAD, the system comprises have bound term definition module, knowledge definition text
Part, digraph parsing module, bound term solve module and bound term application module；
The bound term definition module is for defining different types of bound term in product design process, and by the constraint
Item is transmitted in knowledge definition file；
The knowledge definition file allows described oriented for recording the bound term that bound term definition module transmits
Figure parsing module is read out；
The digraph parsing module is used to read bound term all in knowledge definition file, and to all constraints
The solution of item is ranked up, while the Structure matrix is transmitted to bound term and is solved in module；
The bound term solves module and carries out calculating parsing to each bound term according to transmitting Structure matrix, and by institute
Parsing result is stated to be transmitted in bound term application module；
The bound term application module is updated the threedimensional model in CAD system according to parsing result.
A kind of application method of design knowledge solving system, the application method specifically comprise the following steps:
S1: all bound terms occurred in product design process are inputted in the bound term definition module, while institute
It states digraph parsing module and all bound term is read out by knowledge definition file；
S2: the digraph parsing module is according to dependence, bound term and the CAD system between all bound terms
Dependence in middle workpiece between expression formula constructs digraph, according to the digraph to the solutions of all bound terms into
Row sequence, and the Structure matrix is transmitted to bound term and is solved in module；
S3: the bound term solves module and is judged one by one according to type of the Structure matrix to all bound terms, passes through
The type of the bound term carries out calculating parsing to bound term, while the bound term application module is modified by parsing result
The expression formula that threedimensional model is parameterized in CAD system, is updated the threedimensional model.
Further speaking, dependence between all bound terms, workpiece in bound term and CAD system are determined
Dependence between middle expression formula, specific as follows:
SA2.1: being read out bound term all in the knowledge definition file, obtains the name of each bound term
Title and corresponding constraint rule, wherein the constraint rule is indicated by character string forms；
SA2.2: the title of all expression formulas and the corresponding value of each expression formula in workpiece are obtained in the CAD system
Character string, described value character string can describe the calculating process of expression formula；
SA2.3: selecting any one of bound term or expression formula, traversal in addition to the bound term chosen other are all
The constraint rule of bound term therefrom selects the constraint rule comprising selectable bound term title or expression formula title, then described
The corresponding bound term of constraint rule depends on the bound term or expression formula of selection.
Further speaking, in the step S2, work in the vertex representation bound term and CAD system in the digraph figure
Make the expression formula in component, the directed arc had no right in figure indicates dependence, bound term and the CAD between all bound terms
Dependence in system in workpiece between expression formula.
Further speaking, in the step S2, the solution of all bound terms is ranked up according to the digraph, is had
Body is as follows:
SB2.1: detecting to whether there is in the digraph using Depth Priority Algorithm has loop, and if it exists, then straight
End operation is connect, if it does not exist, is then performed the next step rapid；
SB2.2: establishing an ordered set P, while arbitrarily selecting from the digraph node of a not no forerunner,
And the node is stored in ordered set P, while deleting in the digraph node and all using the node as tail
Arc；
SB2.3: repeating step SB2.2, until all nodes in the digraph are exported, wherein the ordered set P
In node sequencing be all bound terms of digraph Structure matrix.
Further speaking, in the step S3, calculating parsing is carried out to bound term by the type of the bound term, had
Body are as follows:
S3.1: the type of the bound term is when checking, to be calculated according to check results the bound term；
S3.2: when the type of the bound term is table, by the screening formula in bound term to data set in bound term
Data selected；
S3.3: when the type of the bound term is rounding, solution knot of the mode according to specified in bound term to bound term
Fruit is standardized；
S3.4: when the type of the bound term is production rule, according to the solving result of the part IF in bound term and
The solving result of the part THEN solves the bound term；
S3.5: when the type of the bound term is formula or examines, directly the bound term is calculated.
Further speaking, in the step S3.1, bound term is calculated according to the check results, specifically such as
Under:
S3.1.1: when the check results pass through, the feedback formula in the bound term is solved；
S3.1.2: when the check results do not pass through, the constraint for needing to adjust is determined in the ordered set P
, and the step-length according to specified in the bound term is adjusted the value for the bound term that needs adjust；
S3.1.3: in the ordered set P, bound term in the adjustment is selected to the unsanctioned constraint of check results
All bound term between, and solution is re-started to the value of the bound term selected；
S3.1.4: repeating step S3.1.1- step S3.1.3, until the check results of the bound term pass through.
Further speaking, in the step S3.4, according to the solving result of the part IF in the bound term and the portion THEN
The solving result divided solves bound term, specifically:
The part IF in the bound term is solved, and the solving result of the part IF is judged, as the IF
When partial solving result is true, the part THEN in the bound term is solved, and export the solution knot of the part THEN
Fruit；
When the part IF solving result be fictitious time, then terminate the solution of the bound term.
The utility model has the advantages that compared with prior art, technical solution of the present invention has following advantageous effects:
(1) design knowledge solving system of the invention can be under the interactive mode of system, by way of increasing increment
Increase various forms of knowledge constraints in whereabouts component, at the same can also by adding objects association, define dimension constraint,
Morpheme constraint etc. is defined, due to the use of CAD system integrated functionality, computer can calculate, parse various constraint rules, in turn
It realizes man-machine rational division of work, improves working efficiency；
(2) application method of design knowledge solving system of the invention allows staff to express in a manner of usability of program fragments
Knowledge constraints in Machine Components and Parts Design, according to the dependence between bound term, between bound term and CAD component expression formula
Construct bound term digraph, then to digraph carry out topological sorting, then according to collating sequence successively to it is different types of about
Beam item is solved, and is finally updated using solving result driving parametrization threedimensional model, so that the group of design knowledge
It knits, reuse strategy and become more flexible.
Detailed description of the invention
Fig. 1 is the frame construction drawing of design knowledge solving system of the invention；
Fig. 2 is the flow diagram of System Utilization Procedure of the invention；
Fig. 3 is bound term classification of type figure of the invention.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described.Wherein, described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Therefore, below to the embodiment of the present invention provided in the accompanying drawings
Detailed description be not intended to limit the range of claimed invention, but be merely representative of selected embodiment of the invention.
Embodiment 1
With reference to Fig. 1, a kind of design knowledge solving system based on CAD is present embodiments provided, which solves system
System includes bound term definition module, knowledge definition file, digraph parsing module, bound term solution module and bound term application
Module.
In the present embodiment, bound term definition module is used to define different types of bound term in product design process, and
All bound term is transmitted in knowledge definition file.
Knowledge definition file allows oriented diagram for recording all bound terms that bound term definition module transmits
Analysis module is read out wherein all bound term.
In particular, staff can both be defined by bound term during using design knowledge solving system
Module carries out edit-modify or addition bound term to bound term, can also directly carry out to the bound term in knowledge definition file
Edit-modify, or directly bound term is added in knowledge definition file.
Digraph parsing module is for reading bound term all in knowledge definition file, due to the number mistake of bound term
It is more, so needing for all bound term to be ranked up in a certain order before calculating bound term.Oriented diagram
Analysis module can be ranked up the solution of all bound terms, and Structure matrix is transmitted to bound term and is solved in module.
Bound term solution module can receive digraph parsing module and transmit Structure matrix, and according to Structure matrix to institute
There is bound term successively to carry out calculating parsing in order, and parsing result is transmitted in bound term application module.
Bound term application module receives the parsing result of all bound terms, and according to parsing result to three in CAD system
Dimension module is updated.
With reference to Fig. 2, the present embodiment additionally provides a kind of application method of design knowledge solving system, specifically includes following step
It is rapid:
Step S1: staff is by the equal input constraint item definition module of all bound terms occurred in product design process
In, knowledge definition file records bound term all in bound term definition module, while digraph parsing module is to knowing
Know all bound terms for defining and recording in file to be read out.
Step S2: when the various bound term quantity on the threedimensional model being applied in CAD system are more, bound term with
Constitute complicated adduction relationship in CAD system in workpiece between expression formula, thus digraph parsing module according to
Dependence in dependence, bound term between all bound terms and CAD system in workpiece between expression formula
Construct digraph.In digraph, expression formula in the vertex representation bound term and CAD system in figure in workpiece, in figure
The directed arc had no right indicates dependence between all bound terms, expresses in workpiece in bound term and CAD system
Dependence between formula.
In the present embodiment, in the dependence between all bound terms, bound term and CAD system in workpiece
The determination of dependence between expression formula, specific as follows:
Step SA2.1: bound term all in knowledge definition file is read out, the name of each bound term is acquired
Title and corresponding constraint rule, wherein constraint rule is indicated by character string forms.In particular, title is for marking
Know bound term, constraint rule is then used to describe the part of specific design knowledge.
Step SA2.2: the title and the corresponding value of each expression formula of all expression formulas in workpiece in CAD system are obtained
Character string, intermediate value character string can describe the calculating process of expression formula.
Step SA2.3: arbitrarily selection one bound term or expression formula, traversal in addition to the bound term chosen other are all
The constraint rule of bound term is therefrom selected the constraint rule comprising selectable bound term title or expression formula title, is then constrained
The corresponding bound term of rule depends on the bound term or expression formula of selection.To must first determine the bound term or expression formula of selection
Value, the corresponding bound term of the constraint rule selected can be solved.
Digraph parsing module is ranked up the solution of all bound terms according to digraph later, and Structure matrix is passed
Bound term is transported to solve in module.
In the present embodiment, digraph parsing module is ranked up the solution of all bound terms according to digraph, specifically
It is as follows:
Step SB2.1: there is loop using whether there is in Depth Priority Algorithm detection digraph, and if it exists, then straight
End operation is connect, if it does not exist, is then performed the next step rapid.
Step SB2.2: establishing an ordered set P, while arbitrarily selecting from digraph the node of a not no forerunner,
And the node selected is stored in ordered set P, while deleting in digraph the node and all using the node as the arc of tail.
It is worth noting that, will directly there is ordered set when the node in digraph is the expression formula in CAD system in workpiece
It closes in P, and deletes in digraph the node and all using the node as the arc of tail.
Step SB2.3: repeating step SB2.2, until all nodes in output digraph, wherein in ordered set P
Node sequencing is the Structure matrix of all bound terms of digraph.
Step S3: bound term solve module according to the node sequencing in ordered set P to the types of all bound terms one by one
Judged, and calculating parsing is carried out to bound term by the type of bound term.With reference to Fig. 3, about by these in the present embodiment
The type of beam item is summarized as formula, production rule, inspection, table, rounding, checks adjustment.Wherein, formula is most common,
To indicate general calculating process；Production rule refers to the constraint shaped like IF-THEN structure, with premise and conclusion
；Examine whether type constraint item meets specified requirement to certain variables during test design；In form types
It include data set and selection formula two parts in bound term, the discretized values of the multiple groups comprising multiple variables, each in data set
Class value represents a kind of option, and selection formula therein is used for the option that garbled data is concentrated；Rounding indicates a series of of variable
Defined discrete value；It include check and adjustment two parts in the bound term for checking adjustment type, first, in accordance with calculation formulas
Design result is checked, if check result is not pass through, by gradually adjusted design parameter, is wanted until meeting design
It asks, such as when the intensity of axis is unsatisfactory for requiring, increases the diameter of axis by specified step-length, until finding the value met the requirements.
Calculating parsing is carried out to bound term by the type of bound term, specifically:
Step S3.1: when the type of bound term is to check, bound term is calculated according to check results, specifically such as
Under:
Step S3.1.1: when check results be shown as by when, only the feedback formula in bound term need to be solved.
Step S3.1.2: it when check results are shown as not passing through, needs first to determine to need to adjust in ordered set P
Bound term, the value of bound term adjusted further according to step-length specified in bound term to needs is adjusted.
Step S3.1.3: after being adjusted to the value for the bound term that needs adjust, in ordered set P, to the pact of adjustment
All bound term, re-starts solution between the unsanctioned bound term of Shu Xiangzhi check results.
Step S3.1.4: repeating step S3.1.1- step S3.1.3, until the check results of bound term pass through.
Step S3.2: when the type of bound term is table, by the screening formula in bound term to data set in bound term
Data selected.
Step S3.3: when the type of bound term is rounding, solution of the mode according to specified in bound term to bound term
As a result it is standardized.
Step S3.4: when the type of bound term is production rule, according to the solving result of the part IF in bound term and
The solving result of the part THEN solves bound term, specifically:
The part IF in bound term is solved, and the solving result of the part IF is judged, when asking for the part IF
When solution result is true, the part THEN in bound term is solved, and export the solving result of the part THEN.
When the part IF solving result be fictitious time, then directly terminate the solution of the bound term.
Step S3.5: when the type of bound term is formula or examines, directly bound term is calculated.
It solves module by bound term the parsing result of bound term is transmitted in bound term application module, while bound term
Application module by parsing result in CAD system parameterize threedimensional model expression formula modify, and to threedimensional model into
Row updates.
Schematically the present invention and embodiments thereof are described above, description is not limiting, institute in attached drawing
What is shown is also one of embodiments of the present invention, and actual structures and methods are not limited thereto.So if this field
Those of ordinary skill is enlightened by it, without departing from the spirit of the invention, is not inventively designed and the skill
The similar frame mode of art scheme and embodiment, all belong to the scope of protection of the present invention.
Claims (8)
1. a kind of design knowledge solving system based on CAD, which is characterized in that the system comprises have bound term definition module,
Knowledge definition file, digraph parsing module, bound term solve module and bound term application module；
The bound term definition module passes the bound term for defining different types of bound term in product design process
It transports in knowledge definition file；
The knowledge definition file allows the oriented diagram for recording the bound term that bound term definition module transmits
Analysis module is read out；
The digraph parsing module is used to read bound term all in knowledge definition file, and to all bound terms
Solution is ranked up, while the Structure matrix is transmitted to bound term and is solved in module；
The bound term solves module and carries out calculating parsing to each bound term according to transmitting Structure matrix, and by the solution
Analysis result is transmitted in bound term application module；
The bound term application module is updated the threedimensional model in CAD system according to parsing result.
2. a kind of application method of design knowledge solving system according to claim 1, which is characterized in that the user
Method specifically comprises the following steps:
S1: all bound terms occurred in product design process are inputted in the bound term definition module, while described being had
All bound term is read out by knowledge definition file to figure parsing module；
S2: the digraph parsing module is according to the dependence between all bound terms, work in bound term and CAD system
Make the dependence building digraph in component between expression formula, the solution of all bound terms is arranged according to the digraph
Sequence, and the Structure matrix is transmitted to bound term and is solved in module；
S3: the bound term solves module and is judged one by one according to type of the Structure matrix to all bound terms, by described
The type of bound term carries out calculating parsing to bound term, while the bound term application module modifies CAD system by parsing result
The expression formula that threedimensional model is parameterized in system, is updated the threedimensional model.
3. a kind of application method of design knowledge solving system according to claim 2, which is characterized in that in the step
In S2, dependence between all bound terms is determined, in bound term and CAD system in workpiece between expression formula
Dependence, specific as follows:
SA2.1: being read out bound term all in the knowledge definition file, obtain each bound term title and
Corresponding constraint rule, wherein the constraint rule is indicated by character string forms；
SA2.2: the title of all expression formulas and the corresponding value character of each expression formula in workpiece are obtained in the CAD system
String, described value character string can describe the calculating process of expression formula；
SA2.3: selecting any one of bound term or expression formula, traverses other all constraints in addition to the bound term chosen
The constraint rule of item, therefrom selects the constraint rule comprising selectable bound term title or expression formula title, the then constraint
The corresponding bound term of rule depends on the bound term or expression formula of selection.
4. a kind of application method of design knowledge solving system according to claim 2, which is characterized in that in the step
In S2, expression formula in the vertex representation bound term and CAD system in the digraph figure in workpiece, what is had no right in figure has
To arc indicate all bound terms between dependence, in bound term and CAD system in workpiece between expression formula
Dependence.
5. a kind of application method of design knowledge solving system according to claim 3 or 4, which is characterized in that described
In step S2, the solution of all bound terms is ranked up according to the digraph, specific as follows:
SB2.1: detecting to whether there is in the digraph using Depth Priority Algorithm has loop, and if it exists, then directly ties
Beam operation then performs the next step rapid if it does not exist；
SB2.2: establishing an ordered set P, while arbitrarily selecting from the digraph node of a not no forerunner, and will
In node deposit ordered set P, while deleting in the digraph node and all using the node as the arc of tail；
SB2.3: repeating step SB2.2, until all nodes in the digraph are exported, wherein in the ordered set P
Node sequencing is the Structure matrix of all bound terms of digraph.
6. a kind of application method of design knowledge solving system according to claim 5, which is characterized in that in the step
In S3, calculating parsing is carried out to bound term by the type of the bound term, specifically:
S3.1: the type of the bound term is when checking, to be calculated according to check results the bound term；
S3.2: when the type of the bound term is table, by the screening formula in bound term to the number of data set in bound term
According to being selected；
S3.3: when the type of the bound term is rounding, the mode according to specified in bound term to the solving result of bound term into
Row standardization；
S3.4: when the type of the bound term is production rule, according to the solving result of the part IF in bound term and the portion THEN
The solving result divided solves the bound term；
S3.5: when the type of the bound term is formula or examines, directly the bound term is calculated.
7. a kind of application method of design knowledge solving system according to claim 6, which is characterized in that in the step
In S3.1, bound term is calculated according to the check results, specific as follows:
S3.1.1: when the check results pass through, the feedback formula in the bound term is solved；
S3.1.2: when the check results do not pass through, determining the bound term for needing to adjust in the ordered set P, and
It is adjusted according to value of the step-length specified in the bound term to the bound term that needs adjust；
S3.1.3: in the ordered set P, select bound term in the adjustment to the unsanctioned bound term of check results it
Between all bound term, and solution is re-started to the value of the bound term selected；
S3.1.4: repeating step S3.1.1- step S3.1.3, until the check results of the bound term pass through.
8. a kind of application method of design knowledge solving system according to claim 6, which is characterized in that in the step
In S3.4, bound term is solved according to the solving result of the part IF in the bound term and the solving result of the part THEN,
Specifically:
The part IF in the bound term is solved, and the solving result of the part IF is judged, when the part IF
Solving result the part THEN in the bound term is solved when being true, and export the solving result of the part THEN；
When the part IF solving result be fictitious time, then terminate the solution of the bound term.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910767369.8A CN110503203A (en) | 2019-08-20 | 2019-08-20 | A kind of application method of design knowledge solving system based on CAD and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910767369.8A CN110503203A (en) | 2019-08-20 | 2019-08-20 | A kind of application method of design knowledge solving system based on CAD and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110503203A true CN110503203A (en) | 2019-11-26 |
Family
ID=68588269
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910767369.8A Withdrawn CN110503203A (en) | 2019-08-20 | 2019-08-20 | A kind of application method of design knowledge solving system based on CAD and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110503203A (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101447094A (en) * | 2008-12-24 | 2009-06-03 | 南京大学 | Three-dimensional CAD model shape comparison method based on body space topological constraint |
-
2019
- 2019-08-20 CN CN201910767369.8A patent/CN110503203A/en not_active Withdrawn
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101447094A (en) * | 2008-12-24 | 2009-06-03 | 南京大学 | Three-dimensional CAD model shape comparison method based on body space topological constraint |
Non-Patent Citations (1)
| Title |
|---|
| 夏鸿建等: "面向CAD系统的设计知识表达与求解", 《机械科学与技术》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107590319B (en) | Knowledge modeling method and system for auxiliary design of mechanical product scheme | |
| Cingolani et al. | jFuzzyLogic: a java library to design fuzzy logic controllers according to the standard for fuzzy control programming | |
| Tanchoco | Material flow systems in manufacturing | |
| Topaloglu et al. | Rule-based modeling and constraint programming based solution of the assembly line balancing problem | |
| Grif et al. | Methods of desingning and modeling of man-machine systems | |
| Mittal et al. | Simulation-based complex adaptive systems | |
| Nápoles et al. | Fuzzy cognitive maps tool for scenario analysis and pattern classification | |
| Shah et al. | Knowledge engineering tools in planning: State-of-the-art and future challenges | |
| Nalepa et al. | A graphical tabular model for rule-based logic programming and verification | |
| Wang et al. | Ontology-based uncertainty management approach in designing of robust decision workflows | |
| Jing et al. | Intelligent generation method of 3D machining process based on process knowledge | |
| Lu et al. | Formal modelling of a sheet metal smart manufacturing system by using Petri nets and first-order predicate logic | |
| Toussi | The application of evolutionary, generative, and hybrid approaches in architecture design optimization | |
| Bejjani et al. | Flow chart based information modeling for factory planning | |
| CN110503203A (en) | A kind of application method of design knowledge solving system based on CAD and system | |
| Meyers et al. | Knowledge graphs in digital twins for manufacturing-lessons learned from an industrial case at Atlas Copco Airpower | |
| CN111626060A (en) | Product innovation design method and system based on object field analysis and rule reasoning | |
| Kocmanová et al. | Qualitative equationless models as simple integrators of vague sustainability knowledge items | |
| Keloharju et al. | The basic concepts of system dynamics optimization | |
| Bye et al. | A software framework for intelligent computer-automated product design | |
| Srivastava et al. | Systematic development of an interface for automatic generation of STEP-NC (AP238) code for milled features | |
| Gelle et al. | Constraint satisfaction methods for applications in engineering | |
| Liu et al. | Digital twin-based reconfiguration time point prediction method for reconfigurable manufacturing systems | |
| Heavey et al. | A model management systems approach to manufacturing systems design | |
| Lei et al. | Self-organization simulation and output analysis |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20191126 |
|
| WW01 | Invention patent application withdrawn after publication |