一种基于图分解的几何约束求解方法

为了提高几何约束求解的效率和鲁棒性 ,对基于图的构造方法进行了改进 ,即加入虚约束进行扩展和过约束问题的一致性判定 ,提出了一种基于图分解的方法 ,用此方法可以处理包括完全约束、过约束和欠约束等多种情况的约束求解问题 ,另外 ,在该方法中还通过引入分解树将约束求解的范围由整体下降到局部 ,使大部分求解过程能够采用几何求解实现 ,提高了求解和后续修改的效率 ,通过实验数据测试证明 ,该方法对于大型约束求解问题可以达到实时处理的效果 ,具有较强的实用性     

基于雁群启示的粒子群优化算法的几何约束求解

几何约束是约束求解技术中最关键的问题之一.求解一个几何约束问题的最终目的是确定几何图形中每一个几何体的具体坐标位置.几何约束问题可以等价为求解非线性方程组问题.约束问题转化为一个优化问题.本文采用基于雁群启示的粒子群优化算法来求解该问题.该算法受雁群飞行特征启发,一方面将粒子排序,每个粒子跟随其前面那个较优粒子飞行,保持了多样性;另一方面使每个粒子利用更多其他粒子的有用信息,粒子之间的竞争被增强.两个方面的结合将平衡速度和精度之间的矛盾.实验表明,该方法可以提高几何约束求解的效率和收敛性.     

一种利用有向图优化约束求解的方法

为克服约束求解的效率问题及可靠性问题，本文提出了一种基于图结构的约束求解方法，它利用图瓣形式来表示几何元素之间的约束关系，使得几何元素的求解从整体下降 至局部，将一个方程组的求解问题论为几个小方程组的求解，大大降低了计算复杂度，进而提高了求解的可靠性。     

自由特征模型约束求解研究*

在对自由特征模型参数化基础上,提出一种约束求解的新方法。该方法对自由特征形体定义点进行参数化,建立几何约束图,将约束问题分解为三角形约束和四面体约束两大类,分别进行求解,定义手向性规则,利用该规则将子问题组合为全局解。在自主开发的HUST-CAIDS（哈尔滨理工大学计算机辅助工业设计系统）中实现了本算法,并得到满足设计者需求的模型。     

密集标志点集的拓扑保持变换方法*

在对自由特征模型参数化基础上,提出一种约束求解的新方法。该方法对自由特征形体定义点进行参数化,建立几何约束图,将约束问题分解为三角形约束和四面体约束两大类,分别进行求解,定义手向性规则,利用该规则将子问题组合为全局解。在自主开发的HUST-CAIDS（哈尔滨理工大学计算机辅助工业设计系统）中实现了本算法,并得到满足设计者需求的模型。     

几何约束求解的简化迭代算法

针对几何约束系统图分解中复合顶点的求解问题,提出复合顶点的图分解算法和等价自由变量的简化迭代求解算法.通过去除复合顶点部分边界约束对复合顶点进行图分解,对求解序列中的欠约束顶点添加等价自由变量、以等价自由变量的部分迭代求解、替代系统的整体数值求解,以提高求解效率和稳定性.该算法具有很强的通用性,并在实际应用中得到验证.     

三维几何约束求解的自由度归约算法

三维几何约束求解在装配设计、几何造型和动力学分析等领域有着广泛的应用．在分析基本几何元素间的约束关系对刚体自由度状态影响的基础上,提出刚体自由度的归约算法,以求得满足约束后刚体的自由度状态空间;以刚体自由度状态空间分析为基础,实现对合理约束的推理求解和约束一致性维护,该算法解决了三维几何约束求解中自由度计算问题,同时避免了一些推理求解算法中出现的“组合爆炸”问题．     

动态种群划分量子遗传算法求解几何约束

几何约束问题的约束方程组可转化为优化模型,因此约束求解问题可以转化为优化问题。针对传统量子遗传算法个体间信息交换不足,易使算法陷入局部最优的缺点,提出了动态种群划分量子遗传算法（dynamic population divided quantum genetic algorithm,DPDQGA）,并将其应用于几何约束求解中。该算法种群中的个体按照一定规则自发地进行信息交换。在每一代进化的开始阶段,分别对两个初始种群中的个体计算个体适应度。将两个种群合并,使用联赛选择的方法为种群中的个体打分,并按照得分对种群进行排序。最后将合并的种群重新划分为两个子种群。实验表明,基于动态种群划分的量子遗传算法求解几何约束问题具有更好的求解精度和求解速率。     

两种空间约束求解算法

进行了3个方面的研究：(1)对由3点3面组成的空间约束系统进行了几何分析和推导，并且利用数值解验证了几何分析和推导的正确性，从而进一步完善了Hoffmann提出的基于图构造方法的约束求解方法；(2)将遗传模拟退火算法结合于空间约束求解中，有效地克服了基于图构造方法的可扩展性差的缺陷，并可以解决过约束和欠约束的情况；(3)应用遗传模拟退火算法对3点3面约束系统进行求解，分析比较了基于图构造方法和基于遗传模拟退火算法两种约束求解算法．     

求解三维装配约束闭环的投影变换方法

为避免直接迭代求解三维装配约束闭环带来的复杂非线性方程组,提出一种投影变换方法求解三维装配设计中的平面约束闭环问题.首先采用等价性分析方法消除伪装配约束闭环,运用无向图块分算法分解装配约束图;然后采用旋量理论将装配约束闭环子图转换为运动副约束图,通过分析运动副的特征参数确定可投影的装配约束闭环,并将其投影变换为二维几何约束系统;最后通过求解二维几何约束系统获得三维装配约束闭环的解.实例结果表明,该方法缩减了迭代求解的规模并降低了约束方程的复杂性,明显地提高了求解的效率和稳定性.     

三维几何约束系统的等价性分析

针对过约束、完整约束和欠约束三维几何约束系统的求解问题,提出了等价性分析方法.该方法基于三维几何约束系统的内在等价性,充分挖掘几何领域知识,依据拆解约束闭环、缩减约束闭环和析出约束闭环等原则,采用等价约束替换来处理几何约束闭环问题,优化几何约束图的结构,实现几何约束系统的优化分解.最后用多个实例验证了该方法的正确性和有...     

Cooperative Resolution of Over-Constrained Information Requests

In this paper, we present a constraint-based model of cooperative agents for information systems dialogues, with an emphasis on how the agents detect and resolve situations in which the user's information needs have been over-constrained. The constraint-based model of the information agents integrates and extends the AI techniques of constraint satisfaction, solution synthesis and constraint hierarchy, providing an incremental computational mechanism for constructing and maintaining partial parallel solutions. Such a mechanism supports immediate detection of over-constrained situations. In addition, we explore using the knowledge in the solution synthesis network to support different relaxation strategies to support cooperative dialogue behaviors.     

二维几何约束多解问题的研究

对采用自由度分析方法求解几何约束问题进行了研究.对几何约束问题的图用自由度分析的方法进行分解可以使约束系统得到充分分解,并可以对高耦合的几何约束问题进行分离.通过转换把几何元素的求解问题,转换为点的定位问题,从而使几何约束的多解问题得到简化,几何约束的多解问题被归结为初始设计图形中点和直线间的相对关系.对未知半径和圆心的圆的求解问题进行了讨论,提供了几种比较通用的算法,可以简化程序的设计.     

一种欠约束草图求解方法的研究

基于约束的参数化描述及求解是计算机辅助设计研究的一个热点，欠约束图的求解是参数化设计的基本问题，为了提高欠约束草图求解的参数化设计效率，提出了一种基于隐式约束优先级的欠约束草图求解方法，并首先给出了欠约束图求解的一般方法以及欠约束图的基本特征，提出了利用隐式约束去匹配缺少的显式约束；然后将隐式约束按照一定的规则分成不同的优先级，再利用优先级高的隐式约束去匹配变动约束图中的欠约束，直到完成约束图的有向化；最后，探讨了无尺寸约束图有向化过程中的基本特点，并给出了无尺寸约束图的求解算法和应用实例。实例应用结果表明，效果较好。     

A new Algorithm for the Solution of under Constraint Graph in Sketch Drawing

A new algorithm for the solution of under constraint graph in sketch drawing is put forward. The directed process of constraint graph is completed by picking concealed constraints of adjacent entities in sketch of few or no dimensions. In this paper, the priority of concealed constraint is given by the different constraint types and constructing orders, and some more priority concealed constraints are forced into obvious ones by the need number of constraint for every node in constraint solution process.     

Genetic algorithm for the personnel assignment problem with multiple objectives

The assignment problem is a well-known graph optimization problem defined on weighted-bipartite graphs. The objective of the standard assignment problem is to maximize the summation of the weights of the matched edges of the bipartite graph. In the standard assignment problem, any node in one partition can be matched with any node in the other partition without any restriction. In this paper, variations of the standard assignment problem are defined with matching constraints by introducing structures in the partitions of the bipartite graph, and by defining constraints on these structures. According to the first constraint, the matching between the two partitions should respect the hierarchical-ordering constraints defined by forest and level graph structures produced by using the nodes of the two partitions respectively. In order to define the second constraint, the nodes of the partitions of the bipartite graph are distributed into mutually exclusive sets. The set-restriction constraint enforces the rule that in one of the partitions all the elements of each set should be matched with the elements of a set in the other partition. Even with one of these constraints the assignment problem becomes an NP-hard problem. Therefore, the extended assignment problem with both the hierarchical-ordering and set-restriction constraints becomes an NP-hard multi-objective optimization problem with three conflicting objectives; namely, minimizing the numbers of hierarchical-ordering and set-restriction violations, and maximizing the summation of the weights of the edges of the matching. Genetic algorithms are proven to be very successful for NP-hard multi-objective optimization problems. In this paper, we also propose genetic algorithm solutions for different versions of the assignment problem with multiple objectives based on hierarchical and set constraints, and we empirically show the performance of these solutions.     

Solving Hierarchical Constraints over Finite Domains with Local Search

Many real world problems have requirements and constraints which conflict with each other. One approach for dealing with such over-constrained problems is with constraint hierarchies. In the constraint hierarchy framework, constraints are classified into ranks, and appropriate solutions are selected using a comparator which takes into account the constraints and their ranks. In this paper, we present a local search solution to solving hierarchical constraint problems over finite domains (HCPs). This is an extension of local search for over-constrained integer programs WSAT(OIP) to constraint hierarchies and general finite domain constraints. The motivation for this work arose from solving large airport gate allocation problems. We show how gate allocation problems can be formulated as HCPs using typical gate allocation constraints. Using the gate allocation benchmarks, we investigate how constraint heirarchy selection strategies and the problem formulation using two models: a 0–1 linear constraint hierarchy model and a nonlinear finite domain constraint hierarchy model.     

基于双重约束的角色挖掘算法

针对基于角色的访问控制(role-based access control,RBAC)中的约束问题,提出一种基于双重约束的角色挖掘算法。将用户权限分配关系转化为二分图表示,在约束条件下,利用二分图中寻找最小完全二分图覆盖的方法,得到满足权限基数约束和用户基数约束的初始角色集,通过图优化的方法优化角色状态构建角色层次,得到最终的角色集。实验结果表明,利用该算法得到的角色集,能够有效实施约束策略,保证RBAC系统的安全。     

Research on engineering-oriented constraints conflict detection in collaborative design of wire harness technology

Engineering-oriented constraint of harness technology has much information and project information presents progressive changes along with the design.Therefore,how to handle conflict resolution quickly is a problem to be solved.Process model of conflict detection is put forward according to characteristics of harness technology design engineering-oriented constraint,and then two problems of how to conduct conflict positioning and judgment of constraint rules are introduced in this paper.Afterwards in this paper,constraint information directed acyclic graph is established by classified project constraint information to solve the conflict positioning problem;solution of constraint satisfaction problem is applied to realize judgment problem of constraint rules.Finally,example is used to analyze the method in this paper to further verify the correctness and effectiveness of this method.