scholarly journals Collaborative Target Search Algorithm for UAV Based on Chaotic Disturbance Pigeon-Inspired Optimization

2021 ◽  
Vol 11 (16) ◽  
pp. 7358
Author(s):  
Linlin Li ◽  
Shufang Xu ◽  
Hua Nie ◽  
Yingchi Mao ◽  
Shun Yu
Keyword(s):  
Optimization Algorithm ◽  
Search Algorithm ◽  
Chaotic Map ◽  
Poor Performance ◽  
Population Diversity ◽  
Convergence Speed ◽  
Local Optimum ◽  
Search Problem ◽  
Target Search ◽  
Disturbance Factor

Unmanned aerial vehicles (UAVs) have shown their superiority in military and civilian missions. In the face of complex tasks, many UAVs are usually needed to cooperate with each other. Therefore, multi-UAV cooperative target search has attracted more and more scholars’ attention. At present, there are many bionic algorithms for solving the cooperative search problem of multi-UAVs, including particle swarm optimization algorithm (PSO) and differential evolution (DE). Pigeon-inspired optimization (PIO) is a new swarm intelligence optimization algorithm proposed in recent years. It has great advantages over other algorithms in convergence, robustness, and accuracy, and has few parameters to be adjusted. Aiming at the shortcomings of the standard pigeon colony algorithm, such as poor population diversity, slow convergence speed, and the ease of falling into local optimum, we have proposed chaotic disturbance pigeon-inspired optimization (CDPIO) algorithm. The improved tent chaotic map was used to initialize the population and increase the diversity of the population. The disturbance factor is introduced in the iterative update stage of the algorithm to generate new individuals, replace the individuals with poor performance, and carry out disturbance to increase the optimization accuracy. Benchmark functions and UAV target search model were used to test the algorithm performance. The results show that the CDPIO had faster convergence speed, better optimization precision, better robustness, and better performance than PIO.

scholarly journals Simultaneous Feature Selection and Support Vector Machine Optimization Using an Enhanced Chimp Optimization Algorithm

Algorithms ◽  
2021 ◽  
Vol 14 (10) ◽  
pp. 282
Author(s):  
Di Wu ◽  
Wanying Zhang ◽  
Heming Jia ◽  
Xin Leng
Keyword(s):  
Optimization Algorithm ◽  
Classification Accuracy ◽  
Search Algorithm ◽  
Rank Correlation ◽  
Population Diversity ◽  
The Other ◽  
Support Vector ◽  
Local Optimum ◽  
Original Algorithm ◽  
Spearman’S Rank Correlation

Chimp Optimization Algorithm (ChOA), a novel meta-heuristic algorithm, has been proposed in recent years. It divides the population into four different levels for the purpose of hunting. However, there are still some defects that lead to the algorithm falling into the local optimum. To overcome these defects, an Enhanced Chimp Optimization Algorithm (EChOA) is developed in this paper. Highly Disruptive Polynomial Mutation (HDPM) is introduced to further explore the population space and increase the population diversity. Then, the Spearman’s rank correlation coefficient between the chimps with the highest fitness and the lowest fitness is calculated. In order to avoid the local optimization, the chimps with low fitness values are introduced with Beetle Antenna Search Algorithm (BAS) to obtain visual ability. Through the introduction of the above three strategies, the ability of population exploration and exploitation is enhanced. On this basis, this paper proposes an EChOA-SVM model, which can optimize parameters while selecting the features. Thus, the maximum classification accuracy can be achieved with as few features as possible. To verify the effectiveness of the proposed method, the proposed method is compared with seven common methods, including the original algorithm. Seventeen benchmark datasets from the UCI machine learning library are used to evaluate the accuracy, number of features, and fitness of these methods. Experimental results show that the classification accuracy of the proposed method is better than the other methods on most data sets, and the number of features required by the proposed method is also less than the other algorithms.

Adaptive cooperative ant colony optimization algorithm based on reinforcement incentive and its application

2021 ◽  
pp. 1-10
Author(s):  
Weiwei Yu ◽  
Chengwang Xie ◽  
Chao Deng
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Information Exchange ◽  
Ant Colony Algorithm ◽  
Search Algorithm ◽  
Convergence Speed ◽  
Ant Colony ◽  
Neighborhood Search ◽  
Local Optimum ◽  
Ant Colony Optimization Algorithm

Ant colony algorithm has great advantages in solving some NP complete problems, but it also has some problems such as slow search speed, low convergence accuracy and easy to fall into local optimum. In order to balance the contradiction between the convergence accuracy and the convergence speed of ant colony algorithm, this paper first proposes an ant colony algorithm (RIACO) based on the reinforcement excitation theory of Burrus Frederic Skinner. In this algorithm, pheromone is stimulated and its volatilization coefficient is adjusted adaptively according to the iteration times, thus the speed of ant colony search is accelerated. Secondly, based on the characteristics of real ant colony classification and division of labor, this paper proposes an ant colony algorithm based on labor division and cooperation (LCACO). The algorithm divides the ant colony into two different types of ant colony for information exchange and improves the state transition probability formula, so that the two ant colonies can search the optimal path cooperatively, so as to improve the precision of ant colony search. Finally, combining the two improved ant colony algorithms, this paper proposes an adaptive cooperative ant colony optimization algorithm based on reinforcement incentive (SMCAACO). A multi constrained vehicle routing problem (MCVRP) is compared with the classical tabu search algorithm (TS), variable neighborhood search algorithm (VNS) and basic ant colony algorithm (ACO). The experimental results show that, in solving the mcvrp problem, the algorithm proposed in this paper not only has a good performance in the solution results, but also achieves a good balance between the convergence speed and the convergence accuracy.

Improved Particle Swarm Optimization Algorithm and its Application Based on the Aggregation Degree

2013 ◽  
Vol 427-429 ◽  
pp. 1934-1938
Author(s):  
Zhong Rong Zhang ◽  
Jin Peng Liu ◽  
Ke De Fei ◽  
Zhao Shan Niu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Diversity ◽  
Function Optimization ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The aim is to improve the convergence of the algorithm, and increase the population diversity. Adaptively particles of groups fallen into local optimum is adjusted in order to realize global optimal. by judging groups spatial location of concentration and fitness variance. At the same time, the global factors are adjusted dynamically with the action of the current particle fitness. Four typical function optimization problems are drawn into simulation experiment. The results show that the improved particle swarm optimization algorithm is convergent, robust and accurate.

scholarly journals Path Planning Based on an Improved Ant Colony Algorithm

2018 ◽  
Vol 228 ◽  
pp. 01010
Author(s):  
Miaomiao Wang ◽  
Zhenglin Li ◽  
Qing Zhao ◽  
Fuyuan Si ◽  
Dianfang Huang
Keyword(s):  
Path Planning ◽  
Ant Colony Algorithm ◽  
Search Algorithm ◽  
Convergence Speed ◽  
Ant Colony ◽  
Local Optimum ◽  
Pheromone Concentration ◽  
Suppression Strategy ◽  
Improved Ant Colony Algorithm ◽  
Robot Path

The classical ant colony algorithm has the disadvantages of initial search blindness, slow convergence speed and easy to fall into local optimum when applied to mobile robot path planning. This paper presents an improved ant colony algorithm in order to solve these disadvantages. First, the algorithm use A* search algorithm for initial search to generate uneven initial pheromone distribution to solve the initial search blindness problem. At the same time, the algorithm also limits the pheromone concentration to avoid local optimum. Then, the algorithm optimizes the transfer probability and adopts the pheromone update rule of "incentive and suppression strategy" to accelerate the convergence speed. Finally, the algorithm builds an adaptive model of pheromone coefficient to make the pheromone coefficient adjustment self-adaptive to avoid falling into a local minimum. The results proved that the proposed algorithm is practical and effective.

scholarly journals Directional-Sensor Network Deployment Planning for Mobile-Target Search

Robotics ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 82
Author(s):  
Shiraz Wasim ◽  
Zendai Kashino ◽  
Goldie Nejat ◽  
Beno Benhabib
Keyword(s):  
Sensor Network ◽  
Search Algorithm ◽  
Search Problem ◽  
Target Search ◽  
Physical Constraints ◽  
Sensing Model ◽  
Mobile Target ◽  
Deployment Planning ◽  
Directional Sensor Network ◽  
Directional Sensor

In this paper, a novel time-phased directional-sensor network deployment strategy is presented for the mobile-target search problem, e.g., wilderness search and rescue (WiSAR). The proposed strategy uses probabilistic target-motion models combined with a variation of a standard direct search algorithm to plan the optimal locations of directional-sensors which maximize the likelihood of target detection. A linear sensing model is employed as a simplification for directional-sensor network deployment planning, while considering physical constraints, such as on-time sensor deliverability. Extensive statistical simulations validated our method. One such illustrative experiment is included herein to demonstrate the method’s operation. A comparative study was also carried out, whose summary is included in this paper, to highlight the tangible improvement of our approach versus three traditional deployment strategies: a uniform, a random, and a ring-of-fire type deployment, respectively.

scholarly journals Improved Backtracking Search Algorithm Based on Population Control Factor and Optimal Learning Strategy

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Lei Zhao ◽  
Zhicheng Jia ◽  
Lei Chen ◽  
Yanju Guo
Keyword(s):  
Learning Strategy ◽  
Search Algorithm ◽  
Population Control ◽  
Pso Algorithm ◽  
Convergence Speed ◽  
Evolutionary Equation ◽  
Control Factor ◽  
Local Optimum ◽  
Backtracking Search ◽  
Backtracking Search Algorithm

Backtracking search algorithm (BSA) is a relatively new evolutionary algorithm, which has a good optimization performance just like other population-based algorithms. However, there is also an insufficiency in BSA regarding its convergence speed and convergence precision. For solving the problem shown in BSA, this article proposes an improved BSA named COBSA. Enlightened by particle swarm optimization (PSO) algorithm, population control factor is added to the variation equation aiming to improve the convergence speed of BSA, so as to make algorithm have a better ability of escaping the local optimum. In addition, enlightened by differential evolution (DE) algorithm, this article proposes a novel evolutionary equation based on the fact that the disadvantaged group will search just around the best individual chosen from previous iteration to enhance the ability of local search. Simulation experiments based on a set of 18 benchmark functions show that, in general, COBSA displays obvious superiority in convergence speed and convergence precision when compared with BSA and the comparison algorithms.

Improved Chaotic Bacteria Foraging Optimization Algorithm Particle

2014 ◽  
Vol 651-653 ◽  
pp. 2322-2325
Author(s):  
Ying Ai ◽  
Yi Xin Su ◽  
Dan Hong Zhang ◽  
Yao Peng
Keyword(s):  
Optimization Algorithm ◽  
Chaotic Map ◽  
Standard Test ◽  
Convergence Speed ◽  
Test Functions ◽  
Algorithm Optimization ◽  
Slow Convergence ◽  
And Migration ◽  
Logistic Chaotic Map ◽  
Bacteria Foraging Optimization Algorithm

. Aiming at the defects of weak global search ability and slow convergence speed in bacteria foraging algorithm optimization, this paper proposed an improved chaotic bacteria foraging optimization algorithm which has introduced the chaotic thoughts, improved the update operation of fitness and migration operation in optimization process. Using Logistic chaotic map initializes the bacteria population, so as to improve the convergence speed of the algorithm; Then adjust quorum sensing mechanism to optimize the chemotactic direction of the bacteria, and operate on perished bacteria with chaos disturbance in migration operation, so as to improve the global optimization ability of the algorithm. Simulation of two standard test functions show that the proposed algorithm has higher convergence speed and precision.

scholarly journals An Improved Squirrel Search Algorithm for Global Function Optimization

Algorithms ◽  
2019 ◽  
Vol 12 (4) ◽  
pp. 80 ◽  
Author(s):  
Yanjiao Wang ◽  
Tianlin Du
Keyword(s):  
Search Algorithm ◽  
Statistical Tests ◽  
Search Space ◽  
Search Method ◽  
Population Diversity ◽  
Convergence Speed ◽  
Function Optimization ◽  
Experimental Results ◽  
Selection Strategy ◽  
Evolutionary Information

An improved squirrel search algorithm (ISSA) is proposed in this paper. The proposed algorithm contains two searching methods, one is the jumping search method, and the other is the progressive search method. The practical method used in the evolutionary process is selected automatically through the linear regression selection strategy, which enhances the robustness of squirrel search algorithm (SSA). For the jumping search method, the ‘escape’ operation develops the search space sufficiently and the ‘death’ operation further explores the developed space, which balances the development and exploration ability of SSA. Concerning the progressive search method, the mutation operation fully preserves the current evolutionary information and pays more attention to maintain the population diversity. Twenty-one benchmark functions are selected to test the performance of ISSA. The experimental results show that the proposed algorithm can improve the convergence accuracy, accelerate the convergence speed as well as maintain the population diversity. The statistical test proves that ISSA has significant advantages compared with SSA. Furthermore, compared with five other intelligence evolutionary algorithms, the experimental results and statistical tests also show that ISSA has obvious advantages on convergence accuracy, convergence speed and robustness.

scholarly journals Enhancing Backtracking Search Algorithm using Reflection Mutation Strategy Based on Sine Cosine

Algorithms ◽  
2019 ◽  
Vol 12 (11) ◽  
pp. 225
Author(s):  
Chong Zhou ◽  
Shengjie Li ◽  
Yuhe Zhang ◽  
Zhikun Chen ◽  
Cuijun Zhang
Keyword(s):  
Heuristic Algorithms ◽  
Search Algorithm ◽  
Population Based ◽  
Population Diversity ◽  
Convergence Speed ◽  
Backtracking Search ◽  
Backtracking Search Algorithm ◽  
Current Population ◽  
Unit Simplex ◽  
Mutation Strategy

Backtracking Search Algorithm (BSA) is a younger population-based evolutionary algorithm and widely researched. Due to the introduction of historical population and no guidance toward to the best individual, BSA does not adequately use the information in the current population, which leads to a slow convergence speed and poor exploitation ability of BSA. To address these drawbacks, a novel backtracking search algorithm with reflection mutation based on sine cosine is proposed, named RSCBSA. The best individual found so far is employed to improve convergence speed, while sine and cosine math models are introduced to enhance population diversity. To sufficiently use the information in the historical population and current population, four individuals are selected from the historical or current population randomly to construct an unit simplex, and the center of the unit simplex can enhance exploitation ability of RSCBSA. Comprehensive experimental results and analyses show that RSCBSA is competitive enough with other state-of-the-art meta-heuristic algorithms.

scholarly journals Electricity Substitution Potential Prediction Based on Tent-CSO-CG-SSA-Improved SVM—A Case Study of China

2022 ◽  
Vol 14 (2) ◽  
pp. 853
Author(s):  
Jinqiang Geng ◽  
Weigao Meng ◽  
Qiaoran Yang
Keyword(s):  
Development Strategy ◽  
Search Algorithm ◽  
Electrical Power ◽  
Electrical Energy ◽  
Population Diversity ◽  
Fuel Oil ◽  
Support Vector ◽  
Local Optimum ◽  
Energy Substitution ◽  
Model Combining

Nowadays, fossil energy continues to dominate China’s energy usage; its inefficient use and large crude emissions of coal and fuel oil in its end-consumption have brought about great pressure to reduce emissions. Electrical power substitution as a development strategy is an important step toward achieving sustainable development, the transformation of the end-use energy consumption structure, and double carbon goals. To better guide the broad promotion of electrical power substitution, and to offer theoretical support for its development, this paper quantifies the amount of electrical power substitution and the influencing factors that affect the potential of electrical energy substitution. This paper proposes a hybrid model, combining Tent chaos mapping (Tent), chicken swarm optimization (CSO), Cauchy–Gaussian mutation (CG), the sparrow search algorithm (SSA), and a support vector machine (SVM), as a Tent-CSO-CG-SSA-SVM model, which first uses the method of Tent chaos mapping to initialize the sparrow population in order to increase population diversity and improve the search ability of the algorithm. Then, the CSO is introduced to update the positions of sparrows, and the CG method is introduced to make the algorithm jump out of the local optimum, in order to improve the global search ability of the SSA. Finally, the final electrical power substitution potential prediction model is obtained by optimizing the SVM through a multi-algorithm combination approach. To verify the validity of the model, two regions in China were used as case studies for the prediction analysis of electrical energy substitution potential, and the prediction results were compared with multiple models. The results of the study show that Tent-CSO-CG-SSA-SVM offers a good improvement in prediction accuracy, and that Tent-CSO-CG-SSA-SVM is a promising method for the prediction of electrical power substitution potential.

Sign in / Sign up

Export Citation Format

Share Document