首页 | 本学科首页   官方微博 | 高级检索  
     

基于动态约束网络的约束优化分解
引用本文:邢思茗,常天庆,徐文胜,李萍. 基于动态约束网络的约束优化分解[J]. 计算技术与自动化, 2004, 23(1): 49-52
作者姓名:邢思茗  常天庆  徐文胜  李萍
作者单位:装甲兵工程学院,控制工程系,北京,100072;清华大学,自动化系,北京,100084
基金项目:国家自然科学基金(60104008)资助。
摘    要:约束网络通过对较大规模的任务和问题的分解,传递了并行工程产品开发过程中的各多功能小组之间必然存在的相互制约、相互依赖的关系。在任务和问题简单分解的过程中,由于所得到的子问题之间通常是不能完全独立的,因而只能在有限程度上降低难度、简化问题。在分析了约束求解的研究现状和不足的基础上,提出了一种基于动态约束的约束优化分解方法,使得各个子任务、子问题间的关系得到进一步的分解,从而在满足原要求的基础上,得到优化的结果。

关 键 词:约束满足问题  并行工程  约束分解  动态约束  动态约束网络
文章编号:1003-6199(2004)01-0049-04
修稿时间:2003-10-10

An Optimized Method for Constraint Decomposition Based on Dynamic Constraint Network
XING Si-ming,CHANG Tian-qing,XU Weng-sheng,LI Ping. An Optimized Method for Constraint Decomposition Based on Dynamic Constraint Network[J]. Computing Technology and Automation, 2004, 23(1): 49-52
Authors:XING Si-ming  CHANG Tian-qing  XU Weng-sheng  LI Ping
Affiliation:XING Si-ming~1,CHANG Tian-qing~1,XU Weng-sheng~2,LI Ping~1
Abstract:To decomposed the complex problems, Constraint Network transfers interdependent relationships existed in the multidiscipline teams. The original problem is resolved from solutions of sub-problems. Ideally,sub-problems are not only mutually independent but also inherent parameters of original problem. Solution of original problem can be directly derived from the collection of solutions from simplified sub-problems. In practice,the degree of interdependency is indeed reduced,sub-problems are neither totally independent nor inherent all parameters of original problem. This paper discusses an optimized method for constraint decomposition based on dynamic constraint network under the actuality nowadays. The suggested optimal constraint decomposition method will insure workable optimal solution.
Keywords:constraint satisfaction problem  concurrent engineering  constraint decomposition  dynamic constraint  dynamic constraint network
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号