, Volume 2, Issue 2, pp 94–99 | Cite as

Hill-climbing for a noisy potential field using information entropy

  • Piljae KimEmail author
  • Satoru Nakamura
  • Daisuke Kurabayashi
Research Article


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.


hill-climbing potential field mobile robots RFID tags information entropy 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    P. Ögren, E. Fiorelli and N. E. Leonard, Cooperative control of mobile sensor networks: Adaptive gradient climbing in a distributed environment, IEEE Transactions on Automatic control 49(8), 1292–1302 (2004)CrossRefGoogle Scholar
  2. [2]
    S. S. Ge and Y. J. Cui, Dynamic motion planning for mobile robots using potential field method, Autonomous Robots 13, 207–222 (2002)zbMATHCrossRefGoogle Scholar
  3. [3]
    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
  4. [4]
    D. V. Nicolau Jr., K. Burrage, D. V. Nicolau and P. K. Maini, ’Extremotaxis’: Computing with a bacterial-inspired algorithm, BioSystems 94, 47–54 (2008)CrossRefGoogle Scholar
  5. [5]
    M. M. Zavlanos and G. J. Pappas, Potential fields for maintaining connectivity of mobile networks, IEEE Transactions on Robotics 23(4), 812–816 (2007)CrossRefGoogle Scholar
  6. [6]
    Herianto, T. Sakakibara, T. Koiwa and D. Kurabayashi, Realization of pheromone potential field for autonomous navigation by radio frequency identification, Advanced Robotics 22, 1461–1478 (2008)CrossRefGoogle Scholar
  7. [7]
    M. Vergassola, E. Villermaux and B. I. Shraiman, ’Infotaxis’ as a strategy for searching without gradients, Nature 445(25), 406–409 (2007)CrossRefGoogle Scholar
  8. [8]
    C. E. Shannon, A mathematical theory of communication, Bell System Technical Journal 27, 379–423 (1948)MathSciNetzbMATHGoogle Scholar
  9. [9]
    M. Dorigo, M. Birattari and T. Stützle, Ant colony optimization, IEEE Computational Intelligence Magazine, 28–39 (2006)Google Scholar
  10. [10]
    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
  11. [11]
    B. W. Silverman, Density estimation for statistics and data analysis (Chapman & Hall/CRC, 1985)Google Scholar
  12. [12]
    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
  13. [13]
    J. Zeil, M. Hoffmann, and J. S. Chahl, Catchment areas of panoramic home images in outdoor scenes, Journal of the Optical society of America A 20, 450–469 (2003)CrossRefGoogle Scholar

Copyright information

© © Versita Warsaw and Springer-Verlag Wien 2011

Authors and Affiliations

  • Piljae Kim
    • 1
    Email author
  • Satoru Nakamura
    • 1
  • Daisuke Kurabayashi
    • 1
  1. 1.Tokyo Institute of TechnologyTokyoJapan

Personalised recommendations