Fusion of Gravitational Search Algorithm, Particle Swarm Optimization, and Grey Wolf Optimizer for Odor Source Localization

Author(s):  
Upma Jain ◽  
Ritu Tiwari ◽  
W. Wilfred Godfrey

This chapter concerns the problem of odor source localization by a team of mobile robots. A brief overview of odor source localization is given which is followed by related work. Three methods are proposed for odor source localization. These methods are largely inspired by gravitational search algorithm, grey wolf optimizer, and particle swarm optimization. Objective of the proposed approaches is to reduce the time required to localize the odor source by a team of mobile robots. The intensity of odor across the plume area is assumed to follow the Gaussian distribution. Robots start search from the corner of the workspace. As robots enter in the vicinity of plume area, they form groups using K-nearest neighbor algorithm. To avoid stagnation of the robots at local optima, search counter concept is used. Proposed approaches are tested and validated through simulation.

2020 ◽  
pp. 1519-1533
Author(s):  
Upma Jain ◽  
W. Wilfred Godfrey ◽  
Ritu Tiwari

This paper concerns with the problem of odor source localization by a team of mobile robots. The authors propose two methods for odor source localization which are largely inspired from gravitational search algorithm and particle swarm optimization. The intensity of odor across the plume area is assumed to follow the Gaussian distribution. As robots enter in the vicinity of plume area they form groups using K-nearest neighbor algorithm. The problem of local optima is handled through the use of search counter concept. The proposed approaches are tested and validated through simulation.


Author(s):  
Upma Jain ◽  
W. Wilfred Godfrey ◽  
Ritu Tiwari

This paper concerns with the problem of odor source localization by a team of mobile robots. The authors propose two methods for odor source localization which are largely inspired from gravitational search algorithm and particle swarm optimization. The intensity of odor across the plume area is assumed to follow the Gaussian distribution. As robots enter in the vicinity of plume area they form groups using K-nearest neighbor algorithm. The problem of local optima is handled through the use of search counter concept. The proposed approaches are tested and validated through simulation.


Author(s):  
Abhishek Sharma ◽  
Abhinav Sharma ◽  
Averbukh Moshe ◽  
Nikhil Raj ◽  
Rupendra Kumar Pachauri

In the field of renewable energy, the extraction of parameters for solar photovoltaic (PV) cells is a widely studied area of research. Parameter extraction of solar PV cell is a highly non-linear complex optimization problem. In this research work, the authors have explored grey wolf optimization (GWO) algorithm to estimate the optimized value of the unknown parameters of a PV cell. The simulation results have been compared with five different pre-existing optimization algorithms: gravitational search algorithm (GSA), a hybrid of particle swarm optimization and gravitational search algorithm (PSOGSA), sine cosine (SCA), chicken swarm optimization (CSO) and cultural algorithm (CA). Furthermore, a comparison with the algorithms existing in the literature is also carried out. The comparative results comprehensively demonstrate that GWO outperforms the existing optimization algorithms in terms of root mean square error (RMSE) and the rate of convergence. Furthermore, the statistical results validate and indicate that GWO algorithm is better than other algorithms in terms of average accuracy and robustness. An extensive comparison of electrical performance parameters: maximum current, voltage, power, and fill factor (FF) has been carried out for both PV model.


Sign in / Sign up

Export Citation Format

Share Document