Abstract
Case based reasoning (CBR) is an effective method to solve DFA and Assembly Planning problems, while assemblies retrieval and indexing is a primary step to its application. In this paper, the connection relations of assemblies are formally expressed and categorized, and then quantitative method for comparing two connection relations is proposed. Based on bipartite graph theory, similarity calculation model of assemblies is constructed. Assemblies retrieving process is described and a computation example is presented.
| Original language | English |
|---|---|
| Pages (from-to) | 2106-2111 |
| Number of pages | 6 |
| Journal | Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics |
| Volume | 17 |
| Issue number | 9 |
| State | Published - Sep 2005 |
Keywords
- Assemblies retrieval and indexing
- Bipartite graph
- Connection relation
- Similarity calculation model
Fingerprint
Dive into the research topics of 'Research on assemblies retrieval and indexing based on bipartite graph'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver