本文選題：裝配序列規(guī)劃 + 有根裝配二叉樹��； 參考：《華中科技大學》2015年碩士論文

【摘要】：計算機輔助裝配規(guī)劃是研究裝配規(guī)劃的重要熱點,其研究方法主要分為幾何推理方法和基于知識的推理兩大類。基于知識的推理方法引入了人的經(jīng)驗知識和啟發(fā)式的裝配規(guī)則,能很大程度上地減少幾何推理的組合爆炸問題,避免裝配序列規(guī)劃的盲目性。在裝配規(guī)劃中,如何利用已有的裝配經(jīng)驗和裝配知識是一個重要問題。通過分析和模仿計算機輔助工藝規(guī)劃的成熟方法,將成組技術(shù)引入到裝配序列規(guī)劃中來,將零件編碼技術(shù)拓展到裝配體編碼,通過裝配編碼搜索,零件匹配和序列修正,實現(xiàn)裝配序列的重用。本文提出了裝配樹和有根裝配二叉樹的概念,介紹了裝配樹的計算機表示與存儲方法,設(shè)計了裝配知識庫的模型,包括裝配序列知識和裝配規(guī)則知識,用于存儲基礎(chǔ)的連接傳動知識和啟發(fā)式的裝配規(guī)則,介紹了如何實現(xiàn)裝配知識的計算機表示方法;采用層次化的思想和方法,將常見的機械裝配體分為基礎(chǔ)級、組件級、產(chǎn)品級三類。采用類似零件編碼系統(tǒng)的方法對裝配體進行編碼,定義了裝配體通用編碼各碼位的含義和編碼方法,從名稱類別,形狀尺寸,裝配復(fù)雜度三方面描述裝配體,并對常見的軸系類裝配和箱體類裝配進一步細分,進行特殊化編碼;以裝配體名稱和編碼為主要關(guān)鍵特征,通過檢索裝配序列知識庫,采用一種逐級放寬匹配條件的方法來檢索相似裝配體,通過對應(yīng)的相同或相似的零件匹配與映射后,完成新的裝配序列規(guī)劃,并更新數(shù)據(jù)庫。在數(shù)據(jù)庫中,為了定義兩棵有根裝配二叉樹的距離,引入了Robinson-Foulds距離和其具體形式的推演與應(yīng)用,以及有根裝配二叉樹的矩陣編碼方法,并以一個經(jīng)典的機械產(chǎn)品為例說明本文提出的裝配序列規(guī)劃流程;基于CATIA平臺及其二次開發(fā)技術(shù),介紹了本研究系統(tǒng)的實現(xiàn)原理與流程,開發(fā)了部分功能模塊KASP。
[Abstract]:Computer-aided assembly planning is an important research hotspot in assembly planning. Its research methods are divided into geometric reasoning method and knowledge-based reasoning method. Knowledge-based reasoning method introduces human experiential knowledge and heuristic assembly rules, which can greatly reduce the combinatorial explosion problem of geometric reasoning and avoid the blindness of assembly sequence planning. In assembly planning, how to make use of the existing assembly experience and assembly knowledge is an important problem. By analyzing and imitating the mature method of computer aided process planning, the group technology is introduced into assembly sequence planning, and the part coding technology is extended to assembly body coding, through assembly coding search, part matching and sequence modification. The reuse of assembly sequence is realized. This paper presents the concepts of assembly tree and root assembly binary tree, introduces the computer representation and storage method of assembly tree, designs the model of assembly knowledge base, including assembly sequence knowledge and assembly rule knowledge. This paper introduces how to realize the computer representation method of assembly knowledge, which is used to store the basic knowledge of connection transmission and heuristic assembly rules, and adopts the idea and method of hierarchy to divide the common mechanical assembly parts into basic level, component level, There are three types of products. The method of similar part coding system is used to encode the assembly, and the meaning and coding method of the general coding of assembly are defined. The assembly is described from three aspects: name category, shape and size, and assembly complexity. The common assembly of shafting and the assembly of box are further subdivided and specialized coding is carried out, and the assembly name and coding are the main key features, and the assembly sequence knowledge base is retrieved. A step by step loosening of matching conditions is used to retrieve similar assembly parts. After matching and mapping corresponding identical or similar parts, the new assembly sequence planning is completed and the database is updated. In the database, in order to define the distance between two root-assembled binary trees, Robinson-Foulds distance and its specific form of deduction and application are introduced, as well as the matrix coding method of root-assembled binary trees. Taking a classical mechanical product as an example to illustrate the assembly sequence planning process proposed in this paper, based on the CATIA platform and its secondary development technology, this paper introduces the principle and flow of the research system, and develops part of the functional module KASP.
【學位授予單位】：華中科技大學
【學位級別】：碩士
【學位授予年份】：2015
【分類號】：TG95

【相似文獻】

相關(guān)期刊論文 前10條

1 丁慧敏,李蓓智,周亞琴;基于遺傳算法的裝配序列規(guī)劃[J];東華大學學報(自然科學版);2001年06期

2 鄧明星;唐秋華;雷U，

本文編號：2105641