Search

Camera robot is an important tool for realizing and reproducing complex camera motion path in modern special film effects. This paper proposed an inverse kinematics optimization algorithm for PRRPR-S redundant degrees of freedom (DoF) camera robot. This paper analyzed the motion characteristics, in Genetic Mix (GM) method, from the idea of movement boundary composed of part robot axis. Then proposed Simplify Mix (SM) method which can stably converge to the global optimal solution in a shorter time. [ABSTRACT FROM AUTHOR]

Demand response (DR) is an effective method to lower peak-to-average ratio of demand, facilitate the integration of renewable resources (e.g., wind and solar) and plug-in hybrid electric vehicles, and strengthen the reliability of power system. In smart grid, implementing DR through home energy management system (HEMS) in residential sector has a great significance. However, an algorithm that only optimally controls parts of HEMS rather than the overall system cannot obtain the best results. In addition, single objective optimization algorithm that minimizes electricity cost cannot quantify user’s comfort level and cannot take a tradeoff between electricity cost and comfort level conveniently. To tackle these problems, this paper proposes a framework of HEMS that consists of grid, load, renewable resource (i.e., solar resource), and battery. In this framework, a user has the ability to sell electricity to utility grid for revenue. Different comfort level indicators are proposed for different home appliances according to their characteristics and user preferences. Based on these comfort level indicators, this paper proposes a multiobjective optimization algorithm for HEMS that minimizes electricity cost and maximizes user’s comfort level simultaneously. Simulation results indicate that the algorithm can reduce user’s electricity cost significantly, ensure user’s comfort level, and take a tradeoff between the cost and comfort level conveniently. [ABSTRACT FROM AUTHOR]

In consideration of the difficulty in determining the parameters of underactuated autonomous underwater vehicles in multi-degree-of-freedom motion control, a hybrid method that combines particle swarm optimization (PSO) with artificial fish school algorithm (AFSA) is proposed in this paper. The optimization process of the PSO-AFSA method is firstly introduced. With the control simulation models in the horizontal plane and vertical plane, the PSO-AFSA method is elaborated when applied in control parameter optimization for an underactuated autonomous underwater vehicle. Both simulation tests and field trials were carried out to prove the efficiency of the PSO-AFSA method in underactuated autonomous underwater vehicle control parameter optimization. The optimized control parameters showed admirable control quality by enabling the underactuated autonomous underwater vehicle to reach the desired states with fast convergence. [ABSTRACT FROM AUTHOR]

We propose a novel online manifold regularization framework based on the notion of duality in constrained optimization. The Fenchel conjugate of hinge functions is a key to transfer manifold regularization from offline to online in this paper. Our algorithms are derived by gradient ascent in the dual function. For practical purpose, we propose two buffering strategies and two sparse approximations to reduce the computational complexity. Detailed experiments verify the utility of our approaches. An important conclusion is that our online MR algorithms can handle the settings where the target hypothesis is not fixed but drifts with the sequence of examples. We also recap and draw connections to earlier works. This paper paves a way to the design and analysis of online manifold regularization algorithms. [ABSTRACT FROM AUTHOR]

Particle swarm optimization algorithm (PSOA) is an advantage optimization tool. However, it has a tendency to get stuck in a near optimal solution especially for middle and large size problems and it is difficult to improve solution accuracy by fine-tuning parameters. According to the insufficiency, this paper researches the local and global search combine particle swarm algorithm (LGSCPSOA), and its convergence and obtains its convergence qualification. At the same time, it is tested with a set of 8 benchmark continuous functions and compared their optimization results with original particle swarm algorithm (OPSOA). Experimental results indicate that the LGSCPSOA improves the search performance especially on the middle and large size benchmark functions significantly. [ABSTRACT FROM AUTHOR]

Kernel Fisher discriminant analysis (KFDA) method has demonstrated its success in extracting facial features for face recognition. Compared to linear techniques, it can better describe the complex and nonlinear variations of face images. However, a single kernel is not always suitable for the applications of face recognition which contain data from multiple, heterogeneous sources, such as face images under huge variations of pose, illumination, and facial expression. To improve the performance of KFDA in face recognition, a novel algorithm named multiple data-dependent kernel Fisher discriminant analysis (MDKFDA) is proposed in this paper. The constructed multiple data-dependent kernel (MDK) is a combination of several base kernels with a data-dependent kernel constraint on their weights. By solving the optimization equation based on Fisher criterion and maximizing the margin criterion, the parameter optimization of data-dependent kernel and multiple base kernels is achieved. Experimental results on the three face databases validate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The presented paper aims to analyze the influence of the selection of transfer function and training algorithms on neural network flood runoff forecast. Nine of the most significant flood events, caused by the extreme rainfall, were selected from 10 years of measurement on small headwater catchment in the Czech Republic, and flood runoff forecast was investigated using the extensive set of multilayer perceptrons with one hidden layer of neurons. The analyzed artificial neural network models with 11 different activation functions in hidden layer were trained using 7 local optimization algorithms. The results show that the Levenberg-Marquardt algorithm was superior compared to the remaining tested local optimization methods. When comparing the 11 nonlinear transfer functions, used in hidden layer neurons, the Root Sig function was superior compared to the rest of analyzed activation functions. [ABSTRACT FROM AUTHOR]

This paper studies in detail the background and implementation of a teaching-learning based optimization (TLBO) algorithm with differential operator for optimization task of a few mechanical components, which are essential for most of the mechanical engineering applications. Like most of the other heuristic techniques, TLBO is also a population-based method and uses a population of solutions to proceed to the global solution. A differential operator is incorporated into the TLBO for effective search of better solutions. To validate the effectiveness of the proposed method, three typical optimization problems are considered in this research: firstly, to optimize the weight in a belt-pulley drive, secondly, to optimize the volume in a closed coil helical spring, and finally to optimize the weight in a hollow shaft. have been demonstrated. Simulation result on the optimization (mechanical components) problems reveals the ability of the proposed methodology to find better optimal solutions compared to other optimization algorithms. [ABSTRACT FROM AUTHOR]

The particle swarm optimization (PSO) algorithm superiority exists in convergence rate, but it tends to get stuck in local optima. An improved PSO algorithm is proposed using a best dimension mutation technique based on quantum theory, and it was applied to sensor scheduling problem for target tracking. The dynamics of the target are assumed as linear Gaussian model, and the sensor measurements showa linear correlation with the state of the target. This paper discusses the single target tracking problemwithmultiple sensors using the proposed best dimensionmutation particle swarmoptimization (BDMPSO) algorithm for various cases. Our experimental results verify that the proposed algorithm is able to track the target more reliably and accurately than previous ones. [ABSTRACT FROM AUTHOR]

Imperfect data stream leads to tree size explosion and detrimental accuracy problems. Overfitting problem and the imbalanced class distribution reduce the performance of the original decision-tree algorithm for stream mining. In this paper, we propose an incremental optimization mechanism to solve these problems. The mechanism is called Optimized Very Fast Decision Tree (OVFDT) that possesses an optimized node-splitting control mechanism. Accuracy, tree size, and the learning time are the significant factors influencing the algorithm's performance. Naturally a bigger tree size takeslonger computation time. OVFDT is a pioneer model equipped with an incremental optimization mechanism that seeks for a balance between accuracy and tree size for data stream mining. It operates incrementally by a test-then-train approach. Three types of functional tree leaves improve the accuracy with which the tree model makes a prediction for a new data stream in the testing phase. The optimized node-splitting mechanism controls the tree model growth in the training phase. The experiment shows that OVFDT obtains an optimal tree structure in both numeric and nominal datasets [ABSTRACT FROM AUTHOR]

AMO is a simple and efficient optimization algorithm which is inspired by animal migration behavior. However, as most optimization algorithms, it suffers frompremature convergence and often falls into local optima. This paper presents an oppositionbased AMOalgorithm. It employs opposition-based learning for population initialization and evolution to enlarge the search space, accelerate convergence rate, and improve search ability. A set of well-known benchmark functions is employed for experimental verification, and the results show clearly that opposition-based learning can improve the performance of AMO. [ABSTRACT FROM AUTHOR]

Given the growing computational power of embedded controllers, the use of model predictive control MPC strategies on this type of devices becomes more and more attractive. This paper investigates the use of online MPC, in which at each step, an optimization problem is solved, on both a programmable automation controller PAC and a programmable logic controller PLC. Three different optimization routines to solve the quadratic program were investigated with respect to their applicability on these devices. To this end, an air heating setup was built and selected as a small-scale-multi-input single-output system. It turns out that the code generatorCVXGEN is not suited for the PLC as the required programming language is not available and the programming concept with preallocated-memory consumes too much memory. The Hildreth and qpOASES algorithms successfully controlled the setup running on the PLC hardware. Both algorithms perform similarly, although it takes more time to calculate a solution for qpOASES. However, if the problem size increases, it is expected that the high number of required iterations when the constraints are hit will cause the Hildreth algorithm to exceed the necessary time to present a solution. For this small heating problem under test, the Hildreth algorithm is selected as most useful on a PLC. [ABSTRACT FROM AUTHOR]

This paper presents a modified barebones particle swarm optimization (OBPSO) to solve constrained nonlinear optimization problems. The proposed approach OBPSO combines barebones particle swarm optimization (BPSO) and opposition-based learning (OBL) to improve the quality of solutions. A novel boundary search strategy is used to approach the boundary between the feasible and infeasible search region. Moreover, an adaptive penalty method is employed to handle constraints. To verify the performance of OBPSO, a set of well-known constrained benchmark functions is used in the experiments. Simulation results show that our approach achieves a promising performance. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) is a stochastic optimization method sensitive to parameter settings. The paper presents a modification on the comprehensive learning particle swarm optimizer (CLPSO), which is one of the best performing PSO algorithms. The proposed method introduces a self-adaptive mechanism that dynamically changes the values of key parameters including inertia weight and acceleration coefficient based on evolutionary information of individual particles and the swarm during the search. Numerical experiments demonstrate that our approach with adaptive parameters can provide comparable improvement in performance of solving global optimization problems. [ABSTRACT FROM AUTHOR]

This paper considers two additional factors of the widely researched vehicle routing problem with time windows (VRPTW). The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To solve the problem, an efficient multiswarm cooperative particle swarm optimization (MCPSO) algorithm is applied. And a new encoding method is proposed for the extension VRPTW. Finally, comparing with genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, the MCPSO algorithm performs best for solving this problem. [ABSTRACT FROM AUTHOR]