2016
DOI: 10.21307/ijssis-2017-924
|View full text |Cite
|
Sign up to set email alerts
|

Modification of Particle Swarm Optimization by Reforming Global Best Term to Accelerate the Searching of Odor Sources

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…Problem 1: Avoiding being trapped in local optima Due to the time‐varying odor dispersion in realistic environments, a problem faced by S‐PSO methods is being trapped in local optima [72]. Several variant PSO methods were introduced to maintain diversity of the positional distribution of robots and prevent them from being trapped in local optima, including the detection and responding PSO (DR‐PSO) [53], the charged PSO (C‐PSO) [53], the explorative PSO ( E ‐PSO) [54], the ignore global best PSO (IgB‐PSO) [59], the request and reset PSO (RR‐PSO) [55], and so on.…”
Section: Heuristic Searching Methodsmentioning
confidence: 99%
“…Problem 1: Avoiding being trapped in local optima Due to the time‐varying odor dispersion in realistic environments, a problem faced by S‐PSO methods is being trapped in local optima [72]. Several variant PSO methods were introduced to maintain diversity of the positional distribution of robots and prevent them from being trapped in local optima, including the detection and responding PSO (DR‐PSO) [53], the charged PSO (C‐PSO) [53], the explorative PSO ( E ‐PSO) [54], the ignore global best PSO (IgB‐PSO) [59], the request and reset PSO (RR‐PSO) [55], and so on.…”
Section: Heuristic Searching Methodsmentioning
confidence: 99%
“…Once the onlooker has selected its food source x i , it produces a modification on x i by using Eq. (12). As in the case of the employed bees, if the modified food source has a better or equal nectar amount than x i , the modified food source will replace x i and become a new member in the population.…”
Section: L(•) Function X Ij Is a Binary Value Mapping From The Associated Position Vector X I Through Function L(•)mentioning
confidence: 99%
“…So, obtaining the optimal feature subset and model parameters must occur simultaneously. In previous literature, some optimization techniques such as the genetic algorithm (GA) [9], simulated annealing (SA) [10], ant colony optimization, (ACO) [11] and particle swarm optimization (PSO) [12] were employed to tune the parameters of SVMs and INTERNATIONAL JOURNAL ON SMART SENSING AND INTELLIGENT SYSTEMS VOL.9, NO.4, DECEMBER 2016 optimize the input feature subset. But these methods are easy to trap into local optimum and could not get the global solution.…”
Section: Introductionmentioning
confidence: 99%