| 一种约束求解的两级规划方法 |
| |
| 引用本文： | 罗尚虎,董金祥.一种约束求解的两级规划方法[J].计算机工程与应用,2001,37(21):92-95. |
| |
| 作者姓名： | 罗尚虎 董金祥 |
| |
| 作者单位： | 浙江大学人工智能研究所 |
| |
| 摘 要： | 提出了一个基于图构造的几何约束求解方法。基于自由度分析的理论,把整个约束图分解为多个约束子图,各个约束子图之间的共享结点形成一个全局的共享结点集,当共享结点集中的结点确定下来时,相关的约束子图中的结点也相应被确定下来。通过这样的全局到局部的两级求解规划的构造,缩小了约束问题的规模,提高了求解效率。
|
| 关 键 词： | 参数化设计 约束求解 图构造 |
| 文章编号： | 1002-8331-(2001)21-0092-04 |
| 修稿时间： | 2000年9月1日 |
A Two-level Plan Method to Constraints Solving |
| |
| Luo Shanghu Dong Jinxiang.A Two-level Plan Method to Constraints Solving[J].Computer Engineering and Applications,2001,37(21):92-95. |
| |
| Authors: | Luo Shanghu Dong Jinxiang |
| |
| Abstract: | This paper presents a graph-based approach to geometric constraint solving?It divides constraint graph into many sub-graphs basing on the theory of degree-of-freedom,sub-graphs are attached by sharing nodes,when sharing nodes solved,the corresponding sub-graph can be solved accordingly.By construct solving plan in such global-to-local way,the scale of constraint problem is reduced and the efficiency of solving is improved. |
| |
| Keywords: | parametric design constraint resolving constructive graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
