Performance analysis on the infotaxis algorithm for searching in dilute environments

The performance of searching an odor source in dilute environments by employing the infotaxis algorithm is evaluated. The infotaxis algorithm is introduced, and a quantitative analysis is conducted from three aspects: (i) the success rate and average path length of the infotaxis algorithm and traditional algorithms (E. coli algorithm, Dung Beetle algorithm and Spiral-Surge algorithm); (ii) the wind-oriented movements and average searching time of the infotaxis algorithm in cases of long distance and short distance; (iii) the influence of quadrilateral and hexagonal path units. Simulation results are provided to show the effectiveness of the infotaxis algorithm in dilute environments.