Tool-path design for metal spinning

Toolpath design in spinning is an open ended problem, with a large number of solutions, and remains an art acquired by practice. To be able to specify a toolpath without the need for experimental trials, further understanding of the process mechanics Is required. At the moment, the mechanics of the process Is not completely understood, due to the complex deformation and because long solution times required for accurate numerical modelling of the process Inhibit detailed study. This paper proposes and applies a new approach to modelling the process and aims to contribute to the understanding of process mechanics, In particular with respect to the mechanisms of failure and and to apply this understanding for toolpath design In spinning. A new approach to numerical modelling Is proposed and applied to Investigate the process. The findings suggest that there are two different causes and two different modes of wrinkling In spinning, depending on the stage In the process and direction of roller movement. A simple test Is performed to estimate the limits of wrinkling and provide a guideline for toolpath design In a typical spinning process. The results show that the required toolpath geometry in the early stages of the process is different from that In later stages. © 2011 Wiley-VCH Verlag GmbH & Co. KGaA. Weinheim.

Fast dynamic wavelength and path scheduling in a monolithic 8×8 switch

The control plane is implemented for the first time to allow scheduling and power leveling in a monolithic 8×8 space and wavelength selective cross-connect. 16 dynamic data connections are established within 16μs. © 2013 Optical Society of America.

Application of fast oxygen sensors for investigations into air-path dynamics and EGR distribution in a diesel engine

The control of NOX emissions by exhaust gas recirculation (EGR) is of widespread application. However, despite dramatic improvements in all aspects of engine control, the subtle mixing processes that determine the cylinder-to-cylinder distribution of the recirculated gas often results in a mal-distribution that is still an issue for the engine designer and calibrator. In this paper we demonstrate the application of a relatively straightforward technique for the measurement of the absolute and relative dilution quantity in both steady state and transient operation. This was achieved by the use of oxygen sensors based on standard UEGO (universal exhaust gas oxygen) sensors but packaged so as to give good frequency response (∼ 10 ms time constant) and be completely insensitivity to the sample pressure and temperature. Measurements can be made at almost any location of interest, for example exhaust and inlet manifolds as well as EGR path(s), with virtually no flow disturbance. At the same time, the measurements yield insights into air-path dynamics. We argue that "dilution", as indicated by the deviation of the oxygen concentration from that of air, is a more appropriate parameter than EGR rate in the context of NOX control, especially for diesel engines. Experimental results are presented for the EGR distribution in a current production light duty 4-cylinder diesel engine in which significant differences were found in the proportion of the recirculated gas that reached each cylinder. Even the individual inlet runners of the cylinders exhibited very different dilution rates - differences of nearly 50% were observed at some conditions. An application of such data may be in the improvement of calibration and validation of CFD and other modelling techniques. Copyright © 2014 SAE International.

Exact quantum master equation via the calculus on path integrals

An exact quantum master equation formalism is constructed for the efficient evaluation of quantum non-Markovian dissipation beyond the weak system-bath interaction regime in the presence of time-dependent external field. A novel truncation scheme is further proposed and compared with other approaches to close the resulting hierarchically coupled equations of motion. The interplay between system-bath interaction strength, non-Markovian property, and required level of hierarchy is also demonstrated with the aid of simple spin-boson systems. (C) 2005 American Institute of Physics.

Design and path planning for a remote-brained service robot

This paper presents a novel robot named "TUT03-A" with expert systems, speech interaction, vision systems etc. based on remote-brained approach. The robot is designed to have the brain and body separated. There is a cerebellum in the body. The brain with the expert systems is in charge of decision and the cerebellum control motion of the body. The brain-body. interface has many kinds of structure. It enables a brain to control one or more cerebellums. The brain controls all modules in the system and coordinates their work. The framework of the robot allows us to carry out different kinds of robotics research in an environment that can be shared and inherited over generations. Then we discuss the path planning method for the robot based on ant colony algorithm. The mathematical model is established and the algorithm is achieved with the Starlogo simulating environment. The simulation result shows that it has strong robustness and eligible pathfinding efficiency.

Design and path planning for a remote-brained service robot

This article introduced an effective design method of robot called remote-brain, which is made the brain and body separated. It leaves the brain in the mother environment, by which we mean the environment in which the brain's software is developed, and talks with its body by wireless links. It also presents a real robot TUT06-B based on this method which has human-machine interaction, vision systems, manipulator etc. Then it discussed the path planning method for the robot based on ant colony algorithm in details, especially the Ant-cycle model. And it also analyzed the parameter of the algorithm which can affect the convergence. Finally, it gives the program flow chat of this algorithm.

an efficient method to generate feasible paths for basis path testing

Basis path testing is a very powerful structural testing criterion. The number of test paths equals to the cyclomatic complexity of program defined by McCabe. Traditional test generation methods select the paths either without consideration of the constraints of variables or interactively. In this note, an efficient method is presented to generate a set of feasible basis paths. The experiments show that this method can generate feasible basis paths for real-world C programs automatically in acceptable time.

a constraint solver and its application to path feasibility analysis

Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.

a real-time path planning approach without the computation of cspace obstacles

An important concept proposed in the early stage of robot path planning field is the shrinking of the robot to a point and meanwhile expanding of the obstacles in the workspace as a set of new obstacles. The resulting grown obstacles are called the Configuration Space (Cspace) obstacles. The find-path problem is then transformed into that of finding a collision free path for a point robot among the Cspace obstacles. However, the research experiences obtained so far have shown that the calculation of the Cspace obstacles is very hard work when the following situations occur: 1. both the robot and obstacles are not polygons and 2. the robot is allowed to rotate. This situation is even worse when the robot and obstacles are three dimensional (3D) objects with various shapes. Obviously a direct path planning approach without the calculation of the Cspace obstacles is strongly needed. This paper presents such a new real-time robot path planning approach which, to the best of our knowledge, is the first one in the robotic community. The fundamental ideas are the utilization of inequality and optimization technique. Simulation results have been presented to show its merits.

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2 i), and traditional Dijkstra’s complexity is O((i + k)2).

a shortest path algorithm for moving objects in spatial network databases

中国计算机学会

Analysis of the lateral displacement and optical path difference in wide-field-of-view polarization interference imaging spectrometer

The mechanism of beam splitting and principle of wide-field-of-view compensation of modified Savart polariscope in the wide-field-of-view polarization interference imaging spectrometer (WPIIS) are analyzed and discussed. Formulas for the lateral displacement and optical path difference (OPD) produced by the modified Savart polariscope are derived by ray-tracing method. The theoretical and practical guidance is thereby provided for the study, design, modulation, experiment and engineering of the polarization interference imaging spectrometers and other birefringent Fourier-transform spectrometers based on Savart polariscopes. (c) 2006 Elsevier B.V. All rights reserved.