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


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Particle Swarm Optimization Based on Shannon's Entropy for Odor Source Localization

    Li, N. / Lu, Q. / He, Y. et al. | British Library Conference Proceedings | 2014


    A learning particle swarm optimization algorithm for odor source localization

    Lu, Q. / Luo, P. | British Library Online Contents | 2011



    A Novel Odor Source Localization Method via a Deep Neural Network-Based Odor Compass

    Yan, Zheng / Jing, Tao / Chen, Si-Wen et al. | Springer Verlag | 2022


    Particle Swarm Optimization (PSO) for Simulating Robot Movement on Two-Dimensional Space Based on Odor Sensing

    Annuar, K. A. M. / Irianto, Irianto / Harun, M. H. et al. | BASE | 2017

    Free access