并入约束的二次曲面重构

针对二次曲面几何特征约束关系复杂、采集数据点多的特点 ,提出了并入约束的几何重构方法 ,即将约束直接并入参数矢量中 ,建立优化目标函数。与已有的研究方法比较 ,其特点是减少优化变量个数 ,避免求解大量约束方程。通过实例验证算法提高了优化效率和重构精度 ,有望在设计与制造领域得到广泛应用     

优化法求解几何约束的问题

几何约束的求解对于变量设计系统是最为关键的问题 ,提出用优化求解的方法来求解循环约束 ,一定程度上克服了Newton -Raphson算法的不稳定性 ,且可较容易地求解欠约束和过约束的问题     

反求工程中二维对称几何模型的约束重构理论及其应用

为提高二维对称几何模型重构的整体品质,反映其初始的设计意图,提出二维对称几何模型的约束重构理论及方法.首先构建参数化点,反射对称以对称轴为中心将对称部分的点集作镜像变换映射到基本点集的一边,旋转对称以旋转中心点为中心将对称部分的点集作旋转变换映射到基本点集的一边,形成参数化的点集.其次识别并处理二维曲线间的约束以及对称模型的边界约束.最后将参数化的点集与基本点集一起作为曲线拟合的目标点集,建立带约束的目标拟合函数,将其转化成无约束优化问题,采用L-M方法迭代求解.实例表明反求结果在满足初始几何约束的同时,能够保证几何模型严格的对称.     

优化法求解几何约束的问题

几何约束的求解对于变量设计系统是最为关键的问题，提出用优化求解的方法来求解循环约束，一定程度上克服了Newton-Raphson算法的不稳定性，且可较容易地求解欠约束和过约束的问题。     

基于遗传算法的光电经纬仪布站优化设计

对光电经纬仪的布站优化设计进行了研究。针对原有光电经纬仪布站优化仅进行定性分析、定位精度不高的问题,提出了根据布站几何与定位精度的精确关系建立布站优化模型,并用小生境遗传算法求解的方法。首先分析了光电经纬仪布站几何与定位精度的关系,构造了布站优化的目标函数,然后全面考虑了实际工程应用的约束条件:光测设备性能约束、光测设备与太阳夹角的约束、布站区域约束;在此基础上,用小生境遗传算法对光电经纬仪的布站优化模型进行求解。最后给出了仿真实例,仿真结果表明了该方法的正确性、有效性和稳定性。     

基于KS函数求解多约束优化问题研究

针对机械优化设计中常见的多约束优化问题，提出了一种求解新方法：利用KS函数的凝聚特性，将优化问题中的全部或部分约束凝聚为一个近似的、逼近精度仅由一个参数控制的约束，然后，再对约束压缩后的优化问题选用适当的约束优化方法求解。三维空间中一例可行域的图形给出了约束凝聚的几何解释。实例证明，由于压缩了求解规模，此法收敛稳定且速度快。     

求解三维装配几何约束闭环系统的约束变换方法

采用等价性分析方法消除三维几何约束系统中的伪约束闭环,并将几何约束图分解为单边子图、独立闭环子图和耦合闭环子图;采用螺旋理论识别出装配几何约束组合对应的运动副约束,将约束闭环子图映射为运动副约束图;通过分析运动副约束图的拓扑结构选择切除约束,建立装配几何约束闭环系统的相对坐标表达,将约束闭环系统的整体迭代求解转换为切除部分约束与相对坐标的迭代求解。该方法降低了数值迭代求解的规模,考虑了约束方向对求解结果的影响,既提高了约束求解的效率和稳定性,又保证了约束求解结果的正确性。     

求解三维装配几何约束闭环系统的约束变换方法

采用等价性分析方法消除三维几何约束系统中的伪约束闭环,并将几何约束图分解为单边子图、独立闭环子图和耦合闭环子图;采用螺旋理论识别出装配几何约束组合对应的运动副约束,将约束闭环子图映射为运动副约束图;通过分析运动副约束图的拓扑结构选择切除约束,建立装配几何约束闭环系统的相对坐标表达,将约束闭环系统的整体迭代求解转换为切除部分约束与相对坐标的迭代求解。该方法降低了数值迭代求解的规模,考虑了约束方向对求解结果的影响,既提高了约束求解的效率和稳定性,又保证了约束求解结果的正确性。     

逆向工程中基于几何约束的汽车零部件模型重建

结合汽车变速籀、发动机零部件的精密测量和数字建模，考虑零部件实物模型中的隐含约束关系，提出了基于几何约束的模型重建和优化求解方法。该方法把约束按照优先等级顺序添加到约束图中，应用自由度分析法建立协调的约束系统，把复杂约束问题分解为约束子问题进行求解。将该方法应用于变速箱零部件模型重建中，所得到的几何模型较好地反映了原始设计意图，满足产品装配精度要求。     

基于截面特征约束的涡轮叶片重构技术

为了解决涡轮叶片在其产品改型、气动优化、叶片修复等实际工程问题需要建立实物数字化模型的问题,采用截面特征技术与二维草图约束功能相结合应用于模型重构。针对涡轮叶片几何特征和气动设计要求,将涡轮叶片点云切片截面曲线分层表达为曲线元并分段进行差值拟合,基于二维草图约束技术对截面曲线进行几何特征约束,构造出满足约束条件与数据点逼近的最优曲线并放样生成曲面。结果表明,基于截面特征的反求工程技术与二维草图曲线约束优化技术相结合,可以快速、准确构造出复杂曲面,提高了逆向建模的效率,为快速重构模型提供了一种方法。     

Unification of the a priori inconsistencies checking among assembly constraints in assembly sequence planning

Sequence planning generation is an important problem in assembly line design. A good assembly sequence can help to reduce the cost and time of the manufacturing process. This paper focuses on assembly sequence planning (ASP) known as a hard combinatorial optimization problem. Although the ASP problem has been tackled via even more sophisticated optimization techniques, these techniques are often inefficient for proposing feasible assembly sequences that satisfy the assembly planners’ preferences. This paper presents an approach that makes easier to check the validity of operations in assembly process. It is based on a model of the assembly planners’ preferences by means of strategic constraints. It helps to check a priori the consistency of the assembly constraints (strategic and operative constraints) given by the assembly system designers before and while running an assembly plan generation algorithm. This approach reduces the solution space significantly. A case study is presented to demonstrate the relevance of the proposed approach.     

The circuit breaker—a practical example in engineering optimizationEin stromkreisschalter — ein praktisches beispiel einer technischen optimierung

This paper demonstrates the applicability of optimization techniques to the design of practical mechanisms. In particular, the dynamic response of a Westinghouse Type R Vacuum Circuit Breaker is to be optimized. The breaker model incorporates breaking time as the objective function with nonlinear inequality constraints on mechanism motion, link stresses, and breaker energy. The calculation of the objective function and constraints is aided by the use of IMP (The Integrated Mechanisms Program). It is shown that with the aid of optimization techniques, a 15% reduction in breaking time may be realized.     

一种新的约束识别与求解算法

约束拟合是逆向工程中模型重建的重要一环。其中约束的识别与求解是约束拟合的关键。本文提出了一种新的二维约束识别求解算法,实现了约束识别求解器。首先给出了二维基本图元的规范化表示及其常见约束关系;然后根据约束识别准则,自动识别出基本图元之间的潜在约束关系,并交互地对其进行确认和编辑;最后根据这些约束关系,采用合适的约束表达策略以及有效的优化算法,进行整体的约束求解,实现基本图元之间的同步拟合。大量实验证明了该算法的稳定性和有效性。     

Progress towards a methodology for high throughput 3D reconstruction of soot nanoparticles via electron tomography

The aim of this work is to make progress towards the development of 3D reconstruction as a legitimate alternative to traditional 2D characterization of soot. Time constraints are the greatest opposition to its implementation, as currently reconstruction of a single soot particle takes around 5–6 h to complete. As such, the accuracy and detail gains are currently insufficient to challenge 2D characterization of a representative sample (e.g. 200 particles). This work is a consideration of the optimization of the steps included within the computational reconstruction and manual segmentation of soot particles. Our optimal process reduced the time required by over 70% in comparison to a typical procedure, whilst producing models with no appreciable decrease in quality.     

Optimal operation of batch processes via the tracking of active constraints

This paper presents a new measurement-based optimization framework for batch processes whereby optimal operation can be achieved via the tracking of active constraints. It is shown that, under mild assumptions and to a first-order approximation, tracking the necessary conditions of optimality is equivalent to tracking active constraints (both during the batch and at the end of the batch). Thus the optimal input trajectories can be adjusted using measurements without the use of a model of the process. When only batch-end measurements are available, the proposed method leads itself to an efficient batch-to-batch optimization scheme. The approach is illustrated via the simulation of a semibatch reactor under uncertainty.     

Feedrate optimization for variant milling process based on cutting force prediction

Machining process modeling, simulation and optimization is one of the kernel technologies for virtual manufacturing (VM). Optimization based on physical simulation (in contrast to geometrical simulation) will bring better control of a machining process, especially to a variant cutting process – a cutting process so complex that cutting parameters, such as cutting depth and width, change with cutter positions. In this paper, feedrate optimization based on cutting force prediction for milling process is studied. It is assumed that cutting path segments are divided into micro-segments according to a given computing step. Heuristic methods are developed for feedrate optimization. Various practical constraints of a milling system are considered. Feedrates at several segments or micro-segments are determined together but not individually to make milling force satisfy constraints and approach an optimization objective. After optimization, an optimized cutting location data file is outputted. Some computation examples are given to show the optimization effectiveness. This revised version was published online in October 2004 with a correction to the issue number.     

Optimization of manipulator point to point motion considering actuator output capability constraints

An optimization algorithm for planning minimum time cubic polynomial joint trajectory splines, is presented. In this optimization, constraints on manipulator joint kinematics and actuator output capabilities are enforced. The contribution of this paper to the algorithm is the incorporation of the actuator capability constraints in the optimization.

Manipulator tasks are specified as a sequence of required end effector locations and orientations, (task spaces). Continuous motion through the task spaces is achieved through use of cubic polynomial trajectory splines at the joint level. Movement times between task spaces are optimized off-line, using a direct search technique. Enforcement of the joint constraints is achieved by scaling infeasible manipulation kinematics and dynamics through expansion of the total motion time.

Example optimizations are included. It was found that trajectory optimization considering kinematic and dynamic constraints, will produce results superior to simple time scaling of a dynamically infeasible, kinematic optimum trajectory.     

基于SolidWorks的截面草图曲线约束优化技术研究

二维截面曲线重建与正向设计技术相结合是实现复杂外形产品CAD模型重建的重要方法。针对该问题提出了基于SolidWorks软件草图的二维截面曲线约束优化技术,并对截面草图曲线的拟合表达、约束表达和约束优化模型的建立及其求解等关键技术进行了深入研究。应用实例表明,基于SolidWorks的截面草图曲线约束优化方法可以得到在满足约束条件下的数据点列最优逼近曲线,基于该优化曲线可以高效、准确地构建出复杂外形产品的曲面模型。