A novel particle swarm optimization based robust H-infinity control for rotorcrafts

2014 ◽  
Vol 31 (4) ◽  
pp. 726-741 ◽  
Author(s):  
Jiyang Dai ◽  
Jin Ying ◽  
Chang Tan
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Adaptive Mutation ◽  
Optimization Approach ◽  
Swarm Optimization ◽  
H Infinity ◽  
Content Type ◽  
Modified Particle Swarm Optimization ◽  
H Infinity Control

Purpose – The purpose of this paper is to present a novel optimization approach to design a robust H-infinity controller. Design/methodology/approach – To use a modified particle swarm optimization (PSO) algorithm and to search for the optimal parameters of the weighting functions under the circumstance of the given structures of three weighting matrices in the H-infinity mixed sensitivity design. Findings – This constrained multi-objective optimization is a non-convex, non-smooth problem which is solved by a modified PSO algorithm. An adaptive mutation-based PSO (AMBPSO) algorithm is proposed to improve the search accuracy and convergence of the standard PSO algorithm. In the AMBPSO algorithm, the inertia weights are modified as a function with the gradient descent and the velocities and positions of the particles. Originality/value – The AMBPSO algorithm can efficiently solve such an optimization problem that a satisfactory robust H-infinity control performance can be obtained.

scholarly journals Particle swarm optimization algorithm for the optimization of rescue task allocation with uncertain time constraints

2021 ◽  
Author(s):  
Na Geng ◽  
Zhiting Chen ◽  
Quang A. Nguyen ◽  
Dunwei Gong
Keyword(s):  
Particle Swarm Optimization ◽  
Task Allocation ◽  
Optimal Algorithm ◽  
Particle Swarm ◽  
Evolutionary Process ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Fitness Evaluation ◽  
Modified Particle Swarm Optimization ◽  
Uncertain Time

AbstractThis paper focuses on the problem of robot rescue task allocation, in which multiple robots and a global optimal algorithm are employed to plan the rescue task allocation. Accordingly, a modified particle swarm optimization (PSO) algorithm, referred to as task allocation PSO (TAPSO), is proposed. Candidate assignment solutions are represented as particles and evolved using an evolutionary process. The proposed TAPSO method is characterized by a flexible assignment decoding scheme to avoid the generation of unfeasible assignments. The maximum number of successful tasks (survivors) is considered as the fitness evaluation criterion under a scenario where the survivors’ survival time is uncertain. To improve the solution, a global best solution update strategy, which updates the global best solution depends on different phases so as to balance the exploration and exploitation, is proposed. TAPSO is tested on different scenarios and compared with other counterpart algorithms to verify its efficiency.

Comparative analysis of lunar capture braking method based on particle swarm optimization

2019 ◽  
Vol 91 (4) ◽  
pp. 558-566
Author(s):  
Chengchao Bai ◽  
Jifeng Guo ◽  
Wenyuan Zhang ◽  
Tianhang Liu ◽  
Linli Guo
Keyword(s):  
Particle Swarm Optimization ◽  
Comparative Analysis ◽  
Fuel Consumption ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Lunar Exploration ◽  
Swarm Optimization ◽  
Capture Process ◽  
Content Type ◽  
Advantages And Disadvantages

Purpose The purpose of this paper is to verify the feasibility of lunar capture braking through three methods based on particle swarm optimization (PSO) and compare the advantages and disadvantages of the three strategies by analyzing the results of the simulation. Design/methodology/approach The paper proposes three methods to verify capture braking based on PSO. The constraints of the method are the final lunar orbit eccentricity and the height of the final orbit around the Moon. At the same time, fuel consumption is used as a performance indicator. Then, the PSO algorithm is used to optimize the track of the capture process and simulate the entire capture braking process. Findings The three proposed braking strategies under the framework of PSO algorithm are very effective for solving the problem of lunar capture braking. The simulation results show that the orbit in the opposite direction of the trajectory has the most serious attenuation at perilune, and it should consume the least amount of fuel in theoretical analysis. The methods based on the fixed thrust direction braking and thrust uniform rotation braking can better ensure the final perilune control accuracy and fuel consumption. As for practice, the fixed thrust direction braking method is better realized among the three strategies. Research limitations/implications The process of lunar capture is a complicated process, involving effective coordination between multiple subsystems. In this article, the main focus is on the correctness of the algorithm, and a simplified dynamic model is adopted. At the same time, because the capture time is short, the lunar curvature can be omitted. Furthermore, to better compare the pros and cons of different braking modes, some influence factors and perturbative forces are not considered, such as the Earth’s flatness, light pressure and system noise and errors. Practical implications This paper presents three braking strategies that can satisfy all the constraints well and optimize the fuel consumption to make the lunar capture more effective. The results of comparative analysis demonstrate that the three strategies have their own superiority, and the fixed thrust direction braking is beneficial to engineering realization and has certain engineering practicability, which can also provide reference for lunar exploration orbit design. Originality/value The proposed capture braking strategies based on PSO enable effective capture of the lunar module. During the lunar exploration, the capture braking phase determines whether the mission will be successful or not, and it is essential to control fuel consumption on the premise of accuracy. The three methods in this paper can be used to provide a study reference for the optimization of lunar capture braking.

A dynamic particle swarm optimization method applied to global optimizations of engineering inverse problem

2018 ◽  
Vol 37 (1) ◽  
pp. 98-117 ◽  
Author(s):  
Shafiullah Khan ◽  
Shiyou Yang ◽  
Obaid Ur Rehman
Keyword(s):  
Inverse Problem ◽  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Optimization Method ◽  
Swarm Optimization ◽  
Content Type ◽  
Novel Strategy ◽  
Modified Pso

Purpose The aim of this paper is to explore the potential of particle swarm optimization (PSO) algorithm to solve an electromagnetic inverse problem. Design/methodology/approach A modified PSO algorithm is designed. Findings The modified PSO algorithm is a more stable, robust and efficient global optimizer for solving the well-known benchmark optimization problems. The new mutation approach preserves the diversity of the population, whereas the proposed dynamic and adaptive parameters maintain a good balance between the exploration and exploitation searches. The numerically experimental results of two case studies demonstrate the merits of the proposed algorithm. Originality/value Some improvements, such as the design of a new global mutation mechanism and introducing a novel strategy for learning and control parameters, are proposed.

Monopole-Gear Design Based on Neural Network and Modified Particle Swarm Optimization

2013 ◽  
Vol 477-478 ◽  
pp. 368-373 ◽  
Author(s):  
Hai Rong Fang
Keyword(s):  
Neural Network ◽  
Particle Swarm Optimization ◽  
Simulated Annealing Algorithm ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Test Results ◽  
Swarm Optimization ◽  
Modified Particle Swarm Optimization ◽  
Gear Design ◽  
Annealing Algorithm

In order to raise the design efficiency and get the most excellent design effect, this paper combined Particle Swarm Optimization (PSO) algorithm and put forward a new kind of neural network, which based on PSO algorithm, and the implementing framework of PSO and NARMA model. It gives the basic theory, steps and algorithm; The test results show that rapid global convergence and reached the lesser mean square error MSE) when compared with Genetic Algorithm, Simulated Annealing Algorithm, the BP algorithm with momentum term.

Improved Particle Swarm Optimization Approach for Vibration Vision Measurement

2020 ◽  
pp. 2159011
Author(s):  
Chunli Zhu ◽  
Yuan Shen ◽  
Xiujun Lei
Keyword(s):  
Particle Swarm Optimization ◽  
Motion Estimation ◽  
Search Algorithm ◽  
Computational Cost ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Optimization Approach ◽  
Swarm Optimization ◽  
Vision Measurement ◽  
Improved Pso

Traditional template matching-based motion estimation is a popular but time-consuming method for vibration vision measurement. In this study, the particle swarm optimization (PSO) algorithm is improved to solve this time-consumption problem. The convergence speed of the algorithm is increased using the adjacent frames search method in the particle swarm initialization process. A flag array is created to avoid repeated calculation in the termination strategy. The subpixel positioning accuracy is ensured by applying the surface fitting method. The robustness of the algorithm is ensured by applying the zero-mean normalized cross correlation. Simulation results demonstrate that the average extraction error of the improved PSO algorithm is less than 1%. Compared with the commonly used three-step search algorithm, diamond search algorithm, and local search algorithm, the improved PSO algorithm consumes the least number of search points. Moreover, tests on real-world image sequences show good estimation accuracy at very low computational cost. The improved PSO algorithm proposed in this study is fast, accurate, and robust, and is suitable for plane motion estimation in vision measurement.

A Modified Particle Swarm Optimization Algorithm with Cases Studies

2011 ◽  
Vol 268-270 ◽  
pp. 823-828
Author(s):  
Cheng Chien Kuo ◽  
Hung Cheng Chen ◽  
Teng Fa Taso ◽  
Chin Ming Chiang
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Solution Quality ◽  
Swarm Optimization ◽  
Fast Calculation ◽  
Modified Particle Swarm Optimization ◽  
Stochastic Optimization Algorithms

s paper presents a hybrid algorithm, the “particle swarm optimization with simulated annealing behavior (SA-PSO)” algorithm, which combines the advantages of good solution quality in simulated annealing and fast calculation in particle swarm optimization. As stochastic optimization algorithms are sensitive to its parameters, this paper introduces criteria in selecting parameters to improve solution quality. To prove the usability and effectiveness of the proposed algorithm, simulations are performed using 20 different mathematical optimized functions of different dimensions. The results made from different algorithms are then compared between the quality of the solution, the efficiency of searching for the solution and the convergence characteristics. According to the simulation results, SA-PSO obtained higher efficiency, better quality and faster convergence speed than other compared algorithms.

Sign in / Sign up

Export Citation Format

Share Document