| 考虑潜在起点的RP路径排序问题研究 |
| |
| 引用本文： | 黄小毛,叶春生,莫健华,黄树槐.考虑潜在起点的RP路径排序问题研究[J].中国机械工程,2008,19(3):317-320. |
| |
| 作者姓名： | 黄小毛 叶春生 莫健华 黄树槐 |
| |
| 作者单位： | 华中科技大学材料成形及模具技术国家重点实验室,武汉,430074 |
| |
| 摘 要： | 充分考虑路径排序问题的一般性,建立了快速成形中扫描填充加工路径排序优化问题的两种完整数学计算模型，提出并证明了路径的遍历策略及简化定理。引入路径潜在起点的概念，设计了基于所有路径潜在起点（而非仅仅原始起点）的全局贪婪搜索求解算法。该算法不仅适用于所有路径排序问题，而且因为扩大了搜索范围，避免了一般贪婪算法对路径内节点初始排列次序的依赖性，求出了路径排序问题的全局更优解。
|
| 关 键 词： | 快速成形 扫描填充 路径排序 潜在起点 贪婪算法 |
| 文章编号： | 1004-132X（2008）03-0317-04 |
| 收稿时间： | 2006-10-30 |
| 修稿时间： | 2006年10月30 |
Study on RP Paths Ordering Problem Considering Potential Start-point Effect |
| |
| Huang Xiaomao,Ye Chunsheng,Mo Jianhua,Huang Shuhuai.Study on RP Paths Ordering Problem Considering Potential Start-point Effect[J].China Mechanical Engineering,2008,19(3):317-320. |
| |
| Authors: | Huang Xiaomao Ye Chunsheng Mo Jianhua Huang Shuhuai |
| |
| Abstract: | Two mathematical models were presented for paths ordering problem(POP) in rapid prototyping(RP),considering universality of POP.Theorems were also presented and proved for how to traverse a path and predigest a non-loop-path.After conception of potential start-point had been brought in,a global greedy method for paths ordering problem(GGM-POP) was designed based on potential start-points(not only original start point) of all paths.Better global result can be brought out by this algorithm,which fits all POP and largely expands search boundary and avoids dependency on original order of point in a path. |
| |
| Keywords: | rapid prototyping scanning and filling paths ordering potential start-point greedy algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《中国机械工程》浏览原始摘要信息 |
|
点击此处可从《中国机械工程》下载全文 |
