scholarly journals Balancing Control of Bicyrobo by Particle Swarm Optimization-Based Structure-Specified Mixed H2/H∞ Control

10.5772/6235 ◽  
2008 ◽  
Vol 5 (4) ◽  
pp. 39 ◽  
Author(s):  
Bui Trung Thanh ◽  
Manukid Parnichkun

In this paper, a structure-specified mixed H2/H∞ controller design using particle swarm optimization (PSO) is proposed for control balancing of Bicyrobo, which is an unstable system associated with many sources of uncertainties due to un-model dynamics, parameter variations, and external disturbances. The structure-specified mixed H2/H∞ control is a robust and optimal control technique. However, the design process normally comes up with a complex and non-convex optimization problem which is difficult to solve by the conventional optimization methods. PSO is a recently useful meta-heuristic search method used to solve multi-objective and non-convex optimization problems. In the method, PSO is used to search for parameters of a structure-specified controller which satisfies mixed H2/H∞ performance index. The simulation and experimental results show the robustness of the proposed controller in compared with the conventional proportional plus derivative (PD) controller, and the efficiency of the proposed algorithm in compared with the genetic algorithm (GA).

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Feng Qian ◽  
Mohammad Reza Mahmoudi ◽  
Hamïd Parvïn ◽  
Kim-Hung Pho ◽  
Bui Anh Tuan

Conventional optimization methods are not efficient enough to solve many of the naturally complicated optimization problems. Thus, inspired by nature, metaheuristic algorithms can be utilized as a new kind of problem solvers in solution to these types of optimization problems. In this paper, an optimization algorithm is proposed which is capable of finding the expected quality of different locations and also tuning its exploration-exploitation dilemma to the location of an individual. A novel particle swarm optimization algorithm is presented which implements the conditioning learning behavior so that the particles are led to perform a natural conditioning behavior on an unconditioned motive. In the problem space, particles are classified into several categories so that if a particle lies within a low diversity category, it would have a tendency to move towards its best personal experience. But, if the particle’s category is with high diversity, it would have the tendency to move towards the global optimum of that category. The idea of the birds’ sensitivity to its flying space is also utilized to increase the particles’ speed in undesired spaces in order to leave those spaces as soon as possible. However, in desirable spaces, the particles’ velocity is reduced to provide a situation in which the particles have more time to explore their environment. In the proposed algorithm, the birds’ instinctive behavior is implemented to construct an initial population randomly or chaotically. Experiments provided to compare the proposed algorithm with the state-of-the-art methods show that our optimization algorithm is one of the most efficient and appropriate ones to solve the static optimization problems.


2018 ◽  
Vol 6 (2) ◽  
pp. 129-142 ◽  
Author(s):  
Hasan Koyuncu ◽  
Rahime Ceylan

Abstract In the literature, most studies focus on designing new methods inspired by biological processes, however hybridization of methods and hybridization way should be examined carefully to generate more suitable optimization methods. In this study, we handle Particle Swarm Optimization (PSO) and an efficient operator of Artificial Bee Colony Optimization (ABC) to design an efficient technique for continuous function optimization. In PSO, velocity and position concepts guide particles to achieve convergence. At this point, variable and stable parameters are ineffective for regenerating awkward particles that cannot improve their personal best position (Pbest). Thus, the need for external intervention is inevitable once a useful particle becomes an awkward one. In ABC, the scout bee phase acts as external intervention by sustaining the resurgence of incapable individuals. With the addition of a scout bee phase to standard PSO, Scout Particle Swarm Optimization (ScPSO) is formed which eliminates the most important handicap of PSO. Consequently, a robust optimization algorithm is obtained. ScPSO is tested on constrained optimization problems and optimum parameter values are obtained for the general use of ScPSO. To evaluate the performance, ScPSO is compared with Genetic Algorithm (GA), with variants of the PSO and ABC methods, and with hybrid approaches based on PSO and ABC algorithms on numerical function optimization. As seen in the results, ScPSO results in better optimal solutions than other approaches. In addition, its convergence is superior to a basic optimization method, to the variants of PSO and ABC algorithms, and to the hybrid approaches on different numerical benchmark functions. According to the results, the Total Statistical Success (TSS) value of ScPSO ranks first (5) in comparison with PSO variants; the second best TSS (2) belongs to CLPSO and SP-PSO techniques. In a comparison with ABC variants, the best TSS value (6) is obtained by ScPSO, while TSS of BitABC is 2. In comparison with hybrid techniques, ScPSO obtains the best Total Average Rank (TAR) as 1.375, and TSS of ScPSO ranks first (6) again. The fitness values obtained by ScPSO are generally more satisfactory than the values obtained by other methods. Consequently, ScPSO achieve promising gains over other optimization methods; in parallel with this result, its usage can be extended to different working disciplines. Highlights PSO parameters are ineffective to regenerate the awkward particle that cannot improve its pbest. An external intervention is inevitable once a particle becomes an awkward one. ScPSO is obtained with the addition of scout bee phase into the PSO. So an evolutionary method eliminating the most important handicap of PSO is gained. ScPSO is compared with the variants and with hybrid versions of PSO and ABC methods. According to the experiments, ScPSO results in better optimal solutions. The fitness values of ScPSO are generally more satisfactory than the others. Consequently, ScPSO achieve promising gains over other optimization methods. In parallel with this, its usage can be extended to different working disciplines.


Author(s):  
Prof. Kanika Lamba

ELD or Economic load dispatch is an online process of allocating generating among the available generating units to minimize the total generating cost and satisfy the equality and inequality constraint. ELD means the real and reactive power of the generator vary within the certain limits and fulfils theload demand with less fuel cost. There are some traditional methods for = 1; 2; :::;N) isgiven as Vi=[Vi;1; Vi;2; :::; Vi;D]. The index ivaries from solving ELD include lambda irritation method, Newton-Raphson method, Gradient method, etc. All these traditional algorithms need the incremental fuel cost curves of the generators to be increasing monotonically or piece-wise linear. But in practice the input-output characteristics of a generator are highly non-linear leading to a challenging non-convex optimization problem. Methods like artificial intelligence, DP (dynamic programming), GA (genetic algorithms), and PSO (particle swarm optimization), ALO ( ant-lion optimization), solve non convex optimization problems in an efficient manner and obtain a fast and near global and optimum solution. In this project ELD problem has been solved using Lambda-Iterative technique, ALO (ant-lion Optimization) and PSO (Particle Swarm Optimization) and the results have been compared. All the analyses have been made in MATLAB environment


Author(s):  
Wei-Der Chang

Engineering optimization problems can be always classified into two main categories including the linear programming (LP) and nonlinear programming (NLP) problems. Each programming problem further involves the unconstrained conditions and constrained conditions for design variables of the optimized system. This paper will focus on the issue about the design problem of NLP with the constrained conditions. The employed method for such NLP problems is a variant of particle swarm optimization (PSO), named improved particle swarm optimization (IPSO). The developed IPSO is to modify the velocity updating formula of the algorithm to enhance the search ability for given optimization problems. In this work, many different kinds of physical engineering optimization problems are examined and solved via the proposed IPSO algorithm. Simulation results compared with various optimization methods reported in the literature will show the effectiveness and feasibility for solving NLP problems with the constrained conditions.


2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
Jianhua Qu ◽  
Xiyu Liu ◽  
Minghe Sun ◽  
Feng Qi

Particle Swarm Optimization (PSO) is a population-based stochastic search technique for solving optimization problems, which has been proven to be effective in a wide range of applications. However, the computational efficiency on large-scale problems is still unsatisfactory. A graph drawing is a pictorial representation of the vertices and edges of a graph. Two PSO heuristic procedures, one serial and the other parallel, are developed for undirected graph drawing. Each particle corresponds to a different layout of the graph. The particle fitness is defined based on the concept of the energy in the force-directed method. The serial PSO procedure is executed on a CPU and the parallel PSO procedure is executed on a GPU. Two PSO procedures have different data structures and strategies. The performance of the proposed methods is evaluated through several different graphs. The experimental results show that the two PSO procedures are both as effective as the force-directed method, and the parallel procedure is more advantageous than the serial procedure for larger graphs.


Author(s):  
Shuzhen Zhang ◽  
Xiaolong Yuan ◽  
Paul D Docherty ◽  
Kai Yang ◽  
Chunling Li

This paper proposes an improved particle swarm optimization to study the forward kinematic of a solar tracking device which has two rotational and one translational degree of freedom. The forward kinematics of the parallel manipulator is transformed into an optimization problem by solving the inverse kinematics equations. The proposed method combines inertial weight with the iterations number and the distance between current swarm particles and the optimum to improve convergence ability and speed. The novel cognitive and social parameters are adjusted by the inertia weight to enhance unity and intelligence of the algorithm. A stochastic mutation is used to diversify swarm for faster convergence via local optima evasion in high dimensional complex optimization problems. The performance of the proposed method is demonstrated by applying it to four benchmark functions and comparing convergence with three popular particle swarm optimization methods to verify the feasibility of the improved method. The behaviors of the proposed method using variable cognitive and social parameters and fixed value are also tested to verify fast convergence speed of variable parameters method. And further, an application example uses the method to determine the forward kinematics of a three-degree-of-freedom parallel manipulator. Finally, the mechanism simulations model of the parallel manipulator are carefully built and analyzed to verify the correctness of the proposed algorithm in PTC Creo Parametric software. In all cases tested, the proposed algorithm achieved much faster convergence and either improved or proximal fitness values.


2012 ◽  
Vol 22 (1) ◽  
pp. 87-105 ◽  
Author(s):  
Timothy Ganesan ◽  
Pandian Vasant ◽  
Irraivan Elamvazuthy

A hybrid PSO approach for solving non-convex optimization problemsThe aim of this paper is to propose an improved particle swarm optimization (PSO) procedure for non-convex optimization problems. This approach embeds classical methods which are the Kuhn-Tucker (KT) conditions and the Hessian matrix into the fitness function. This generates a semi-classical PSO algorithm (SPSO). The classical component improves the PSO method in terms of its capacity to search for optimal solutions in non-convex scenarios. In this work, the development and the testing of the refined the SPSO algorithm was carried out. The SPSO algorithm was tested against two engineering design problems which were; ‘optimization of the design of a pressure vessel’ (P1) and the ‘optimization of the design of a tension/compression spring’ (P2). The computational performance of the SPSO algorithm was then compared against the modified particle swarm optimization (PSO) algorithm of previous work on the same engineering problems. Comparative studies and analysis were then carried out based on the optimized results. It was observed that the SPSO provides a better minimum with a higher quality constraint satisfaction as compared to the PSO approach in the previous work.


Author(s):  
Sara Grassi ◽  
Lorenzo Pareschi

In this paper, we consider a continuous description based on stochastic differential equations of the popular particle swarm optimization (PSO) process for solving global optimization problems and derive in the large particle limit the corresponding mean-field approximation based on Vlasov–Fokker–Planck-type equations. The disadvantage of memory effects induced by the need to store the local best position is overcome by the introduction of an additional differential equation describing the evolution of the local best. A regularization process for the global best permits to formally derive the respective mean-field description. Subsequently, in the small inertia limit, we compute the related macroscopic hydrodynamic equations that clarify the link with the recently introduced consensus based optimization (CBO) methods. Several numerical examples illustrate the mean field process, the small inertia limit and the potential of this general class of global optimization methods.


Sign in / Sign up

Export Citation Format

Share Document