Constraint-based beautification and dimensioning of 3D polyhedral models reconstructed from 2D sketches

3D models reconstructed from 2D sketches are inaccurate because of the inherent inaccuracies in the input and the reconstruction method. It is therefore necessary to “beautify” them before use in CAD systems. We present a method that detects geometric constraints, such as parallel and orthogonal faces, present in the reconstructed model and then selects a subset that constrains the object sufficiently and consistently. The subset selection algorithm first prioritizes the constraints depending on their type and then uses a novel method, based on quasi-Newton optimization, to detect and eliminate redundant and inconsistent constraints. The remaining constraints then define the dimensions of the model fully and consistently. Results from our implementation show that the method can beautify and dimension recovered 3D models correctly at acceptable speed.     

基于扩展有向图的产品参数化模型的研究与实现

文章提出了基于扩展有向图的产品参数化模型,将各类约束在形式上利用对象及相关概念统一起来,利用扩展的有向图表示设计对象及对象间的约束关系。对于有环的有向图,在正向约束求解的基础上,引入了反向约束求解,局部调整的机制。模型的主要思想是:求解过程中利用对象本身所具有的性质进行充分推理、判断,在此基础上进行约束的最小方程组计算。     

Design of output constraints for model-based non-square controllers using interval operability

A steady-state interval operability methodology is introduced here for multivariable non-square systems with fewer inputs than output variables to be used in the design of model-based constrained controllers (MPC, DMC). For such systems, set-point control is not possible for all the outputs and interval control is needed. The proposed iterative approach enables the selection of the needed interval constraints systematically, so that the tightest possible control is achieved without rendering the control problem infeasible. The application of this methodology to high-dimensional industrial problems characterizing processes of Air Products and Chemicals and DuPont shows that very significant reduction of the constrained region can be achieved from the steady-state point of view. Ratios of the initial to the calculated volume of the constrained regions examined range between 10⁴ and 10⁸.     

基于规则的特征结构细化

特征结构的细化是通过高层约束模型和相应的推理规则实现的，约束的求解直接利用ＡｕｔｏＣＡＤ中的ｃｈａｍｐｅｒ和ｆｉｌｅｎｔ命令进行。本文介绍了特征柔性模型中的高层约束模型、基于该模型的规则推理以及该模型的建立。     

Semantic Web Constraint Language and its application to an intelligent shopping agent

Semantic Web society was initially focused only on data, but then gradually moved toward knowledge. If a vision of the Semantic Web is to enhance humans' decision-making assisted by machines, a missing but important part is knowledge about constraints on data and concepts represented by ontology. This paper proposes a Semantic Web Constraint Language (SWCL) based on OWL, and shows its effectiveness in representing and solving an internet shopper's decision-making problems by implementing a shopping agent in the Semantic Web environment.     

A logic-based mechanical system constraint model

This paper: (1) classifies design constraints of mechanical systems from a multi-disciplinary, concurrent engineering point of view from three orthogonal bases: application, object, and expression, (2) presents some initial developments in extending data models to include design constraints, formally defining entity relationships using first order predicate logic, and modeling assembly related geometry constraints for mechanical systems using predicates. Axioms and atomic formulas of mechanical assemblies are developed. Two frequently used assembly relationships-fit and against—are defined and used to explain the assembly definition axiom of a piston assembly of an engine model. Such a geometry constraint modeling method builds a basis for design change propagation and change management.     

Environment for rapidly creating interactive design tools

The Garnet toolkit was specifically designed to make highly interactive graphical programs easier to design and implement. Visual, interactive, user-interface design tools clearly fall into this category. At this point, we have used the Garnet toolkit to create three different interactive design tools: Gilt, a simple interface builder for laying out widgets; Lapidary, a sophisticated design tool for constructing application-specific graphics and custom widgets; and C32, a spreadsheet interface to constraints. The features of the Garnet toolkit that made these easier to create include use of a prototype-instance object system instead of the usual class-instance model, integration of constraints with the object system, graphics model that supports automatic graphical update and saving to disk of on-screen objects, separation of specifying the graphics of objects from their behavior, automatic layout of graphical objects in a variety of styles, and a widget set that supports such commonly used operations as selection, moving and growing objects, and displaying and setting their properties.     

CLP(ℜ) and some electrical engineering problems

The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constraints, the CLP() language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and non-numeric computation.In this paper we illustrate the practical applicability of CLP() with examples of programs to solve electrical engineering problems. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(). A detailed look at some of the more important programming techniques highlights the ability of CLP() to support well-known, powerful techniques from constraint programming. Our thesis is that CLP() is an embodiment of these techniques in a language that is more general, elegant and versatile than the earlier languages, and yet is practical.An earlier version of this paper appeared in the proceedings of the 4th International Conference on Logic Programming, Melbourne, May 1987. Much of this work was carried out while the authors were at Monash University, Melbourne, Australia.     

遗传算法在多品种小批量模式MPS中的应用

结合准时制生产和约束理论,以“关键设备产能”和“产品提前期”两大约束为重心,确定以关键工作中心利用率最高和提前/拖期罚款最少作为MPS模型的两个目标,提出了一种多品种、小批量生产模式下企业MPS的双目标排单模型的建立思路和方法;应用遗传算法对模型进行优化计算,通过对企业实例数据的运行结果分析,验证了方案的有效性。     

Optimizing the Hot Isostatic Pressing Process

A genetic algorithm (GA) is used to optimize the hot isostatic pressing (HIPing) process for beryllium powder. The GA evaluates a HIPing model with different processing schedules in an effort to minimize temperature, pressure, processing time, ramp rates, grain growth, and distance to target relative density. It is shown that this is a constrained, multiobjective, noisy, optimization problem to which the GA is able to evolve a large number of viable solutions. However, for the GA to work in such a large multidimensional search space, it is suggested that the constraints be treated as objectives and then penalize the Pareto ranking for each constraint violated. This approach is necessary because a large-dimensional objective space naturally results in most members being Pareto rank 1.