Vol 52, No 1 (2018)

This paper proposes a new control law based on linear algebra. This technique allows nonlinear path tracking in multivariable and complex systems. This new methodology consists in finding the control action to make the system follow predefined concentration profiles solving a system of linear equations. The controller parameters are selected with a Monte Carlo algorithm so as to minimize a previously defined cost index. The control scheme is applied to a fed-batch penicillin production process. Different tests are shown to prove the controller effectiveness, such as adding parametric uncertainty, perturbations in the control action and in the initial conditions. Moreover, a comparison with other controllers from the literature is made, showing the better performance of the present approach.

When four wheel side driven EV travals in steering or changes lanes in high speed, the vehicle is easy to side-slip or flick due to the difference of wheel hub motor and a direct effect of vehicle nonlinear factors on vehicle yaw motion, which would affect vehicle handling and stability seriously. To solve this problem, a joint control strategy, combined with the linear programming algorithm and improved sliding mode algorithm, which combines the exponential reaching law and saturation function was proposed. Firstly, the vehicle dynamics model and the reference model according with the structure and driving characteristics of four wheel side driven EV were set up. Then, introduced the basic method of the improved sliding mode variable structure control and complete the sliding mode variable structure controller design basic on vehicle sideslip angle and yaw velocity.The controller accomplish optimal allocation of vehicle braking force through a linear programming algorithm, according to yaw moment produced by the vehicle motion state. Single lane driving simulation results show that the proposed control strategy can not only control vehicle sideslip angle and yaw velocity well, but also accomplish good controlling of the vehicle yaw moment, so as to significantly improve the handling and stability of vehicle.

In this paper, the medical CT image blind restoration is translated into two sub problems, namely, image estimation based on dictionary learning and point spread function estimation. A blind restoration algorithm optimized by the alternating direction method of multipliers for medical CT images was proposed. At present, the existing methods of blind image restoration based on dictionary learning have the problem of low efficiency and precision. This paper aims to improve the effectiveness and accuracy of the algorithm and to improve the robustness of the algorithm. The local CT images are selected as training samples, and the K-SVD algorithm is used to construct the dictionary by iterative optimization, which is beneficial to improve the efficiency of the algorithm. Then, the orthogonal matching pursuit algorithm is employed to implement the dictionary update. Dictionary learning is accomplished by sparse representation of medical CT images. The alternating direction method of multipliers (ADMM) is used to solve the objective function and realize the local image restoration, so as to eliminate the influence of point spread function. Secondly, the local restoration image is used to estimate the point spread function, and the convex quadratic optimization method is used to solve the point spread function sub problems. Finally, the optimal estimation of point spread function is obtained by iterative method, and the global sharp image is obtained by the alternating direction method of multipliers. Experimental results show that, compared with the traditional adaptive dictionary restoration algorithm, the new algorithm improves the objective image quality metrics, such as peak signal to noise ratio, structural similarity, and universal image quality index. The new algorithm optimizes the restoration effect, improves the robustness of noise immunity and improves the computing efficiency.

Solving the dynamic shortest path problem has become important in the development of intelligent transportation systems due to the increasing use of this technology in supplying accurate traffic information. This paper focuses on the problem of finding the dynamic shortest path from a single source to a destination in a given traffic network. The goal of our studies is to develop an algorithm to optimize the journey time for the traveler when traffic conditions are in a state of dynamic change. In this paper, the models of the dynamic traffic network and the dynamic shortest path were investigated. A novel dynamic shortest path algorithm based on hybridizing genetic and ant colony algorithms was developed, and some improvements in the algorithm were made according to the nature of the dynamic traffic network. The performance of the hybrid algorithm was demonstrated through an experiment on a real traffic network. The experimental results proved that the algorithm proposed in this paper could effectively find the optimum path in a dynamic traffic network. This algorithm may be useful for vehicle navigation in intelligent transportation systems.