参数化建模中计算完全参数范围的方法
Towards computing complete parameter ranges in parametric modeling
摘要:
在参数化设计中,通过改变参数化模型中的相关参数来编辑几何模型,这通常是在多个参数上顺序完成的。如果没有关于可以保证几何约束系统的可解性的允许参数范围的指导,用户可以将不正确的参数值分配给模型的参数,这将进一步导致模型更新失败。然而,目前的商业CAD系统提供的适当的参数分配的支持很少。虽然现有的方法可以计算允许的范围内的单个参数,他们面临的困难,在处理多参数的情况。特别是,这些方法可能会错过一些可行的参数值,并提供不完整的允许参数范围。针对这一问题,本文提出了一种在多参数编辑中自动计算完整参数范围的方法。该方法首先选择一组可变参数,由用户进行顺序编辑,在每次编辑操作之前,给出可变参数的一维范围作为指导。为了计算一维范围,将每个变量参数表示为等式约束函数,并通过计算函数范围来获得其一维允许范围。为了有效地获得通常难以计算的函数范围,将函数范围问题转化为约束优化问题,并采用拉格朗日乘子法和小生境粒子群优化算法(NichePSO)进行求解。实验结果验证了该方法的有效性和效率。
英文摘要:
In parametric design, the geometric model is edited by changing relevant parameters in the parametric model, which is commonly done sequentially on multiple parameters. Without guidance on allowable parameter ranges that can guarantee the solvability of the geometric constraint system, the user could assign improper parameter values to the model's parameters, which would further lead to a failure in model updating. However, current commercial CAD systems provide little support for the proper parameter assignments. Although the existing methods can compute allowable ranges for individual parameters, they face difficulties in handling multi-parameter situations. In particular, these methods could miss some feasible parameter values and provide incomplete allowable parameter ranges. To solve this problem, an automatic approach is proposed in this paper to compute complete parameter ranges in multi-parameter editing. In the approach, a set of variable parameters are first selected to be sequentially edited by the user; before each editing operation, the one-dimensional ranges of the variable parameters are presented as guidance. To compute the one-dimensional ranges, each variable parameter is expressed as an equality-constrained function, and its one-dimensional allowable range is obtained by calculating the function range. To effectively obtain the function range which can hardly be calculated in a normal way, the function range problem is converted into a constrained optimization problem, and is then solved by Lagrange multiplier method and the Niching particle swarm optimization algorithm (the NichePSO). The effectiveness and efficiency of the proposed approach is verified by several experimental results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。