IMPROVED HOMOTOPY ITERATION METHOD AND APPLIED TO THE NINE-POINT PATH SYNTHESIS PROBLEM FOR FOUR-BAR LINKAGES

A new algorithm called homotopy iteration method based on the homotopy function is studied and improved. By the improved homotopy iteration method, Polynomial systems with high Order and deficient can be solved fast and efficiently comparing to the original homotopy iteration method. Numerical examples for the ninepoint path synthesis of four-bar linkages show the advantages and efficiency of the improved homotopy iteration method.

Reaction path synthesis methodology for waste minimization

It is a key step for reducing waste generation in chemical processes to design op-timal reaction paths. In this paper, methods of waste minimization for reaction path synthesis problems are proposed to realize eco-industrial production mode with minimum waste emission. A new conception of simple stoichiometric reaction is presented for reaction path synthesis problem. All simple stoichiometric reactions can be obtained by mathematical transformation for atom matrix of a reaction system. Based on the conception, a two-tier optimization method for complex reaction path synthesis problems is addressed. The first step is to determine the eco-nomic optimal overall reactions, and the second step to decompose each overall reaction into several sub-reactions and find out the best thermodynamic feasible reaction path. Further, a method of reaction path synthesis with waste closed-cycle is proposed based on simple stoichiometric reactions for achieving zero waste emission to poly-generation problem of multi-products. Case studies show that the proposed methods can efficiently solve practical re-action path synthesis problems.

Five precision point-path synthesis of planar four-bar linkage using algebraic method

The problem of synthesizing a planar four-bar linkage with two given fixed pivots such that the coupler curve passes through five given points is considered with the Groebner-Sylvester hybrid approach.First,closed-form equations of a single point are constructed.The reduced Groebner basis in degree lexicographic ordering for the closed-form equations is then obtained using com-puter algebra.A 23623 Sylvester’s matrix can be con-structed by selecting 23 out of 89 Groebner bases.A 36th degree univariate equation is obtained directly from the determinate of the matrix.The same result can be obtained with a continuation method.A numerical example is given and verifies that the problem has at most 36 solutions in the complex field.

Path planning and stability control of collision avoidance system based on active front steering

Vehicle collision avoidance system is a kind of auxiliary driving system based on vehicle active safety,which can assist the driver to take the initiative to avoid obstacles under certain conditions,so as to effectively improve the driving safety of vehicle.This paper presents a collision avoidance system for an autonomous vehicle based on an active front steering,which mainly consists of a path planner and a robust tracking controller.A path planner is designed based on polynomial parameterization optimized by simulated annealing algorithm,which plans an evasive trajectory to bypass the obstacle and avoid crashes.The dynamic models of the AFS system,vehicle as well as the driver model are established,and based on these,a robust tracking controller is proposed,which controls the system to resist external disturbances and work in accordance with the planning trajectory.The proposed collision avoidance system is testified through CarSim and Simulink combined simulation platform.The simulation results show that it can effectively track the planning trajectory,and improve the steering stability and anti-interference performance of the vehicle.

High Level Synthesis for Loop-Based BIST

Area and test time are two major overheads encountered duringdata path high level synthesis for BIST. This paper presents an approach to behavioral synthesis for loop-based BIST. By taking into account the requirements of theBIST scheme during behavioral synthesis processes, an area optimal BIST solutioncan be obtained. This approach is based on the use of test resources reusabilitythat results in a fewer number of registers being modified to be test registers. Thisis achieved by incorporating self-testability constraints during register assignmentoperations. Experimental results on benchmarks are presented to demonstrate theeffectiveness of the approach.