2014 | OriginalPaper | Chapter
Particle Swarm Optimization Based on Shannon’s Entropy for Odor Source Localization
Authors : Nanqi Li, Qiang Lu, Yang He, Jian Wang
Published in: Computational Intelligence, Networked Systems and Their Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper proposes the particle swarm optimization based on Shannon’s entropy to deal with the problem of odor source localization. First, a measurement model by which the robots can always observe a position is briefly described. When the detection events occur, the position of the odor source lies in the vicinity of the observed position with a higher probability. When the non-detection events occur, the position of the odor source does not lie in the vicinity of the observed position with a higher probability. Second, on the basis of the measurement model, the posteriori probability distribution on the position of the odor source is established where the detection events and non-detection events are taken into account. Third, each robot can understand the search environment by using Shannon’s entropy which can be calculated in terms of the posteriori probability distribution on the position of the odor source. Moreover, each robot should move toward the direction of the entropy reduction. By means of this principle, the particle swarm optimization algorithm is introduced to plan the movement of the robot group. Finally, the effectiveness of the proposed approach is investigated for the problem of odor source localization.