| 基于图论和启发式搜索的装配序列规划算法 |
| |
| 引用本文： | 季忠齐,童若锋,林兰芬,蔡铭,董金祥. 基于图论和启发式搜索的装配序列规划算法[J]. 计算机工程, 2003, 29(13): 115-117 |
| |
| 作者姓名： | 季忠齐 童若锋 林兰芬 蔡铭 董金祥 |
| |
| 作者单位： | 浙江大学人工智能研究所,杭州,310027;浙江大学CAD/CG国家重点实验室,杭州,310027 |
| |
| 基金项目： | 浙江省自然科学基金资助项目（601107） |
| |
| 摘 要： | 将装配序列规划中成熟的割集法和人工智能中启发式搜索方法相结合,提出一个高效的装配序列生成算法。此算法在启发函数的指导下,直接产生所需的最佳装配规划,避免了单独采用割集法产生装配AND／OR图而导致的组合爆炸的问题。同时省去了在选择装配规划时,对整个装配AND／OR图进行再次搜索。此算法与其它算法相比具有效率高、智能性强的特点。最后给出了一个实例。
|
| 关 键 词： | 装配序列规划 AND/OR图 割集 AO*算法 子装配 |
| 文章编号： | 1000-3428(2003)13-0115-03 |
| 修稿时间： | 2002-07-10 |
Algorithm for Assembly Sequences Planning Using Graph Theory and Heuristic Search |
| |
| JI Zhongqi,TONG Ruofeng,LIN Lanfen,CAI Ming,DONG Jinxiang. Algorithm for Assembly Sequences Planning Using Graph Theory and Heuristic Search[J]. Computer Engineering, 2003, 29(13): 115-117 |
| |
| Authors: | JI Zhongqi TONG Ruofeng LIN Lanfen CAI Ming DONG Jinxiang |
| |
| Affiliation: | JI Zhongqi1,TONG Ruofeng2,LIN Lanfen1,CAI Ming1,DONG Jinxiang1 |
| |
| Abstract: | Associating the cut sets of graph theory and heuristic search algorithm of AI, this paper presents an efficient algorithm for the automatic generation of the assembly sequences. In the guide of the heuristic functions, the algorithm generates the best assembly sequence directly. It not only avoids the problem of combinational explosion when only using cut sets to generate the AND/OR graph, but also avoids the traversal of the AND/OR graph when selecting the best assembly sequence. This algorithm has the features of high efficiency and strong intelligence. An example is given to illustrate the algorithm. |
| |
| Keywords: | Aassembly sequences planning AND/OR graph Cut sets AO* algorithm Sub-assembly |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
