9,272 research outputs found
A hybrid EKF and switching PSO algorithm for joint state and parameter estimation of lateral flow immunoassay models
This is the post-print version of the Article. The official published can be accessed from the link below - Copyright @ 2012 IEEEIn this paper, a hybrid extended Kalman filter (EKF) and switching particle swarm optimization (SPSO) algorithm is proposed for jointly estimating both the parameters and states of the lateral flow immunoassay model through available short time-series measurement. Our proposed method generalizes the well-known EKF algorithm by imposing physical constraints on the system states. Note that the state constraints are encountered very often in practice that give rise to considerable difficulties in system analysis and design. The main purpose of this paper is to handle the dynamic modeling problem with state constraints by combining the extended Kalman filtering and constrained optimization algorithms via the maximization probability method. More specifically, a recently developed SPSO algorithm is used to cope with the constrained optimization problem by converting it into an unconstrained optimization one through adding a penalty term to the objective function. The proposed algorithm is then employed to simultaneously identify the parameters and states of a lateral flow immunoassay model. It is shown that the proposed algorithm gives much improved performance over the traditional EKF method.This work was supported in part by the International Science and Technology Cooperation Project of China under Grant
2009DFA32050, Natural Science Foundation of China under Grants 61104041, International Science and Technology Cooperation Project of Fujian Province of China under Grant
2009I0016
Deadline Constrained Cloud Computing Resources Scheduling through an Ant Colony System Approach
Cloud computing resources scheduling is essential for executing workflows in the cloud platform because it relates to both execution time and execution cost. In this paper, we adopt a model that optimizes the execution cost while meeting deadline constraints. In solving this problem, we propose an Improved Ant Colony System (IACS) approach featuring two novel strategies. Firstly, a dynamic heuristic strategy is used to calculate a heuristic value during an evolutionary process by taking the workflow topological structure into consideration. Secondly, a double search strategy is used to initialize the pheromone and calculate the heuristic value according to the execution time at the beginning and to initialize the pheromone and calculate heuristic value according to the execution cost after a feasible solution is found. Therefore, the proposed IACS is adaptive to the search environment and to different objectives. We have conducted extensive experiments based on workflows with different scales and different cloud resources. We compare the result with a particle swarm optimization (PSO) approach and a dynamic objective genetic algorithm (DOGA) approach. Experimental results show that IACS is able to find better solutions with a lower cost than both PSO and DOGA do on various scheduling scales and deadline conditions
The Project Scheduling Problem with Non-Deterministic Activities Duration: A Literature Review
Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with nondeterministic activities duration. Design/methodology/approach: This paper presents an exhaustive literature review, identifying the existing models where the activities duration were taken as uncertain or random parameters. In order to get published articles since 1996, was employed the Scopus database. The articles were selected on the basis of reviews of abstracts, methodologies, and conclusions. The results were classified according to following characteristics: year of publication, mathematical representation of the activities duration, solution techniques applied, and type of problem solved. Findings: Genetic Algorithms (GA) was pointed out as the main solution technique employed by researchers, and the Resource-Constrained Project Scheduling Problem (RCPSP) as the most studied type of problem. On the other hand, the application of new solution techniques, and the possibility of incorporating traditional methods into new PSP variants was presented as research trends. Originality/value: This literature review contents not only a descriptive analysis of the published articles but also a statistical information section in order to examine the state of the research activity carried out in relation to the Project Scheduling Problem with non-deterministic activities duration.Peer Reviewe
Gaussian process based model predictive control : a thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Engineering, School of Engineering and Advanced Technology, Massey University, New Zealand
The performance of using Model Predictive Control (MPC) techniques is highly dependent
on a model that is able to accurately represent the dynamical system. The datadriven
modelling techniques are usually used as an alternative approach to obtain such
a model when first principle techniques are not applicable. However, it is not easy to
assess the quality of learnt models when using the traditional data-driven models, such
as Artificial Neural Network (ANN) and Fuzzy Model (FM). This issue is addressed in
this thesis by using probabilistic Gaussian Process (GP) models.
One key issue of using the GP models is accurately learning the hyperparameters.
The Conjugate Gradient (CG) algorithms are conventionally used in the problem of
maximizing the Log-Likelihood (LL) function to obtain these hyperparameters. In this
thesis, we proposed a hybrid Particle Swarm Optimization (PSO) algorithm to cope with
the problem of learning hyperparameters. In addition, we also explored using the Mean
Squared Error (MSE) of outputs as the fitness function in the optimization problem.
This will provide us a quality indication of intermediate solutions.
The GP based MPC approaches for unknown systems have been studied in the past
decade. However, most of them are not generally formulated. In addition, the optimization
solutions in existing GP based MPC algorithms are not clearly given or are
computationally demanding. In this thesis, we first study the use of GP based MPC approaches
in the unconstrained problems. Compared to the existing works, the proposed
approach is generally formulated and the corresponding optimization problem is eff-
ciently solved by using the analytical gradients of GP models w.r.t. outputs and control
inputs. The GPMPC1 and GPMPC2 algorithms are subsequently proposed to handle
the general constrained problems. In addition, through using the proposed basic and
extended GP based local dynamical models, the constrained MPC problem is effectively
solved in the GPMPC1 and GPMPC2 algorithms. The proposed algorithms are verified
in the trajectory tracking problem of the quadrotor.
The issue of closed-loop stability in the proposed GPMPC algorithm is addressed
by means of the terminal cost and constraint technique in this thesis. The stability
guaranteed GPMPC algorithm is subsequently proposed for the constrained problem. By
using the extended GP based local dynamical model, the corresponding MPC problem
is effectively solved
- …