Hill-climbing for a noisy potential field using information entropy
- 43 Downloads
For a robot navigation system used in an unpredictable environment, it is generally effective to create a pathway that robots can track for carrying out a given task, such as reaching a goal. In the biological world, ants construct a foraging path using a volatile substance called a pheromone, which has been widely studied and whose characteristics have been used in a transportation network model. When a navigation path is constructed by autonomous agents using this pheromone model, the created potential field can be very noisy, with many local peaks due to the unsynchronized updates of the field. In this paper, a new hill-climbing algorithm is proposed. The algorithm minimizes information entropy and can track dynamic and noisy potential fields. The proposed algorithm is evaluated through a computer simulation.
Keywordshill-climbing potential field mobile robots RFID tags information entropy
Unable to display preview. Download preview PDF.
- J. Choi, J. Lee and S. Oh, Biologically inspired navigation strategies for swarm intelligence using spatial Gaussian processes, Proceedings of the 17th World Congress, International Federation of Automatic Control 593–598 (2008)Google Scholar
- M. Dorigo, M. Birattari and T. Stützle, Ant colony optimization, IEEE Computational Intelligence Magazine, 28–39 (2006)Google Scholar
- K. Sugawara, T. Kazama and T. Watanabe, Foraging behavior of interacting robots with virtual pheromone, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 3074–3079 (2004)Google Scholar
- B. W. Silverman, Density estimation for statistics and data analysis (Chapman & Hall/CRC, 1985)Google Scholar
- T. Lochmatterm and A. Martinoli, Theoretical analysis of three bio-inspired plume tracking algorithms, Proceedings of the 2009 IEEE international conference on Robotics and Automation, 3195–3202 (2009)Google Scholar