Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call