A Hybridization of Gravitational Search Algorithm and Particle Swarm Optimization for Odor Source Localization

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.

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 ◽  
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.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Sahazati Md Rozali ◽  
Mohd Fua’ad Rahmat ◽  
Abdul Rashid Husain

This paper presents backstepping controller design for tracking purpose of nonlinear system. Since the performance of the designed controller depends on the value of control parameters, gravitational search algorithm (GSA) and particle swarm optimization (PSO) techniques are used to optimise these parameters in order to achieve a predefined system performance. The performance is evaluated based on the tracking error between reference input given to the system and the system output. Then, the efficacy of the backstepping controller is verified in simulation environment under various system setup including both the system subjected to external disturbance and without disturbance. The simulation results show that backstepping with particle swarm optimization technique performs better than the similar controller with gravitational search algorithm technique in terms of output response and tracking error.


Sign in / Sign up

Export Citation Format

Share Document