An LMI approach to synthesis subject to almost asymptotic regulation constraints

A multi-objective controller synthesis problem is considered in which an output is to be regulated approximately by assuring a bound on the steady-state peak amplification in response to an infinite-energy disturbance, while also guaranteeing a desired level of performance measured in terms of the worst-case energy gain from a finite-energy input to a performance output. Relying on a characterization of the controllers with which almost asymptotic regulation is accomplished, the problem of guaranteeing the desired level of performance is reduced to solving a system of linear matrix inequalities subject to a set of linear equality constraints. Based on the solution of this system, a procedure is outlined for the construction of a suitable controller whose order is equal to the order of the plant plus the order of the exogenous system.     

Bicriteria robotic operation allocation in a flexible manufacturing cell

Consider a manufacturing cell of two identical CNC machines and a material handling robot. Identical parts requesting the completion of a number of operations are to be produced in a cyclic scheduling environment through a flow shop type setting. The existing studies in the literature overlook the flexibility of the CNC machines by assuming that both the allocation of the operations to the machines as well as their respective processing times are fixed. Consequently, the provided results may be either suboptimal or valid under unnecessarily limiting assumptions for a flexible manufacturing cell. The allocations of the operations to the two machines and the processing time of an operation on a machine can be changed by altering the machining conditions of that machine such as the speed and the feed rate in a CNC turning machine. Such flexibilities constitute the point of origin of the current study. The allocation of the operations to the machines and the machining conditions of the machines affect the processing times which, in turn, affect the cycle time. On the other hand, the machining conditions also affect the manufacturing cost. This study is the first to consider a bicriteria model which determines the allocation of the operations to the machines, the processing times of the operations on the machines, and the robot move sequence that jointly minimize the cycle time and the total manufacturing cost. We provide algorithms for the two 1-unit cycles and test their efficiency in terms of the solution quality and the computation time by a wide range of experiments on varying design parameters.     

Throughput optimization in two-machine flowshops with flexible operations

In this study, a two-machine flowshop producing identical parts is considered. Each of the identical parts is assumed to require a number of manufacturing operations, and the machines are assumed to be flexible enough to perform different operations. Due to economical or technological constraints, some specific operations are preassigned to one of the machines. The remaining operations, called flexible operations, can be performed on either one of the machines, so that the same flexible operation can be performed on different machines for different parts. The problem is to determine the assignment of the flexible operations to the machines for each part, with the objective of maximizing the throughput rate. We consider various cases regarding the number of parts to be produced and the capacity of the buffer between the machines. We present solution methods for each variant of the problem.     

Developing robust vision modules for microsystems applications

In this work, several robust vision modules are developed and implemented for fully automated micromanipulation. These are autofocusing, object and end-effector detection, real-time tracking and optical system calibration modules. An image based visual servoing architecture and a path planning algorithm are also proposed based on the developed vision modules. Experimental results are provided to assess the performance of the proposed visual servoing approach in positioning and trajectory tracking tasks. Proposed path planning algorithm in conjunction with visual servoing imply successful micromanipulation tasks.     

The hydro-abrasive erosion wear behavior of duplex-treated surfaces of AISI H13 tool steel

The influence of duplex surface treatments consisting of a DC-pulsed plasma nitriding process and subsequent coatings of CrN and TiAlN deposited by physical vapor deposition(PVD)on AISI H13 tool steel was studied in this article.The treated samples were characterized using metallographic techniques,SEM,EDS,and microhardness methods.Hydro-abrasive erosion wear tests were performed in a specifically designed wear tester in which the samples were rotated in a wear tank containing a mixture of distilled water and ceramic abrasive chips with a fixed rotational speed.The wear rates caused by the abrasive particle impacts were assessed based on accumulated weight loss measurements.The worn surfaces were also characterized using optical microscopy,SEM,and EDS.Microhardness measurements indicated a significant increase in the surface hardness of the duplex-treated samples.The surfaces of the samples with the TiAlN coating were approximately 15 times harder than that of the untreated samples and 3 times that of the plasma nitrided samples.Hydro-abrasive erosion wear results showed that the duplex surface treatments,especially the CrN coating,displayed the highest erosion wear resistance.     

Cell formation in group technology using constraint programming and Boolean satisfiability

Cell formation consists in organizing a plant as a set of cells, each of them containing machines that process similar types or families of parts. The idea is to minimize the part flow among cells in order to reduce costs and increase productivity. The literature presents different approaches devoted to solve this problem, which are mainly based on mathematical programming and on evolutionary computing. Mathematical programming can guarantee a global optimal solution, however at a higher computational cost than an evolutionary algorithm, which can assure a good enough optimum in a fixed amount of time. In this paper, we model and solve this problem by using state-of-the-art constraint programming (CP) techniques and Boolean satisfiability (SAT) technology. We present different experimental results that demonstrate the efficiency of the proposed optimization models. Indeed, CP and SAT implementations are able to reach the global optima in all tested instances and in competitive runtime.     

An experimental study for the effect of different clearances on burr, smooth-sheared and blanking force on aluminium sheet metal

In this study, an experimental study was carried out to examine the effect of different clearances on smooth-sheared depth, burr height and blanking force. Aluminium sheet metals with 0.8, 1, and 1.5 mm thicknesses were used in the experiments. These experiments were carried out in circular blanking dies to 6, 8, 10, and 12 mm diameters. Six different clearances (0.009, 0.064, 0.12, 0.175, 0.231 and 0.287 mm) were used for every material and diameter. The results of the experiment show that burr, smooth-sheared and punch force is strongly related to the clearance value. The results are in agreement with the results of previous theoretical and experimental work in the literature.     

The Classical Theory of Invariants and Object Recognition Using Algebraic Curve and Surfaces

Combining implicit polynomials and algebraic invariants for representing and recognizing complicated objects proves to be a powerful technique. In this paper, we explore the findings of the classical theory of invariants for the calculation of algebraic invariants of implicit curves and surfaces, a theory largely disregarded in the computer vision community by a shadow of skepticism. Here, the symbolic method of the classical theory is described, and its results are extended and implemented as an algorithm for computing algebraic invariants of projective, affine, and Euclidean transformations. A list of some affine invariants of 4th degree implicit polynomials generated by the proposed algorithm is presented along with the corresponding symbolic representations, and their use in recognizing objects represented by implicit polynomials is illustrated through experiments. An affine invariant fitting algorithm is also proposed and the performance is studied.     

A comparison of mixed integer programming formulations of the capacitated lot-sizing problem

We propose a novel mixed integer programming formulation for the capacitated lot-sizing problem with set-up times and set-up carryover. We compare our formulation to two earlier formulations, the Classical and Modified formulations, and a more recent formulation due to Suerie and Stadtler. Extensive computational experiments show that our formulation consistently outperforms the Classical and Modified formulations in terms of CPU time and solution quality. It is competitive with the Suerie–Stadtler (S&S) formulation, but outperforms all other formulations on the most challenging instances, those with low-capacity slack and a dense jobs matrix. We show that some of the differences in the performance of these various formulations arise from their different use of binary variables to represent production or set-up states. We also show that the LP relaxation of our Novel formulation provides a tighter lower bound than that of the Modified formulation. Our experiments demonstrate that, while the S&S formulation provides a much tighter LP bound, the Novel formulation is better able to exploit the intelligence of the CPLEX solution engine.