A novel radio source search algorithm using force field vectors and received signal strengths

The indoor radio source search using received signal strength (RSS) is difficult due to the multipath effects. Robots driven by the RSS gradient-based searching methods are always stuck by local basins which are the areas around local maxima. In this paper, we propose a force field searching (FFS) algorithm which is cost efficient in environments with RSS local basins. The FFS algorithm fuses the geometry layout information with RSS. Virtual attraction forces weighted by RSS gradients are modelled to guide the robot to the radio source. Furthermore, the travel costs of FFS and the gradient ascent with correlated random walks (GACRW) algorithm are derived as functions of the searching space size, the local basin size and the local basin number in gradient fields. The analytical expressions are confirmed by simulations. It is shown that FFS is much faster than other algorithms in simulations driven by real data.

[1]  Petros Koumoutsakos,et al.  Optimization based on bacterial chemotaxis , 2002, IEEE Trans. Evol. Comput..

[2]  J. Byers.  CORRELATED RANDOM WALK EQUATIONS OF ANIMAL DISPERSAL RESOLVED BY SIMULATION , 2001 .

[3]  G. Viswanathan,et al.  Lévy flights and superdiffusion in the context of biological encounters and random searches , 2008 .

[4]  Wei Dong,et al.  Providing OS Support for Wireless Sensor Networks: Challenges and Approaches , 2010, IEEE Communications Surveys & Tutorials.

[5]  Gaurav S. Sukhatme,et al.  Bacterium-inspired robots for environmental monitoring , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[6]  Alon Orlitsky,et al.  Self-avoiding random loops , 1988, IEEE Trans. Inf. Theory.

[7]  R. Andrew Russell,et al.  Robotic location of underground chemical sources , 2004, Robotica.

[8]  Yutaka Nakamura,et al.  An adaptive switching behavior between levy and Brownian random search in a mobile robot based on biological fluctuation , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Yutaka Nakamura,et al.  Biologically inspired adaptive mobile robot search with and without gradient sensing , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[10]  Devin S Johnson,et al.  Continuous-time correlated random walk model for animal telemetry data. , 2008, Ecology.

[11]  Jizhong Xiao,et al.  Adaptive Source Localization by a Mobile Robot Using Signal Power Gradient in Sensor Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[12]  Edward A. Codling,et al.  Random walk models in biology , 2008, Journal of The Royal Society Interface.

[13]  Yi Sun,et al.  Theseus gradient guide: An indoor transmitter searching approach using received signal strength , 2011, 2011 IEEE International Conference on Robotics and Automation.

[14]  K. Fowler.  Sensor survey: Part 2 sensors and sensor networks in five years [Sensor Survey Results] , 2009, IEEE Instrumentation & Measurement Magazine.

[15]  E. Chong,et al.  Introduction to optimization , 1987 .

[16]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .

[17]  Lindsay Kleeman,et al.  Laser scan matching in polar coordinates with application to SLAM , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[18]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[19]  R. Andrew Russell,et al.  A comparison of reactive robot chemotaxis algorithms , 2003, Robotics Auton. Syst..

[20]  V. Lumelsky,et al.  Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .

[21]  Wolfram Burgard,et al.  Monte Carlo localization for mobile robots , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[22]  Dezhen Song,et al.  Monte Carlo simultaneous localization of multiple unknown transient radio sources using a mobile robot with a directional antenna , 2009, 2009 IEEE International Conference on Robotics and Automation.

[23]  Mohammed Atiquzzaman,et al.  Error modeling schemes for fading channels in wireless communications: A survey , 2003, IEEE Communications Surveys & Tutorials.

[24]  P. Kareiva,et al.  Analyzing insect movement as a correlated random walk , 1983, Oecologia.

[25]  M. Salazar-Palma,et al.  A survey of various propagation models for mobile communication , 2003 .

[26]  Roland Siegwart,et al.  A comparison of line extraction algorithms using 2D range data for indoor mobile robotics , 2007, Auton. Robots.

[27]  Lino Marques,et al.  Olfaction-based mobile robot navigation , 2002 .

[28]  O. Nelles,et al.  An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.

[29]  Aleksandar Neskovic,et al.  Modern approaches in modeling of mobile radio systems propagation environment , 2000, IEEE Communications Surveys & Tutorials.

[30]  H. Stanley,et al.  Optimizing the success of random searches , 1999, Nature.

[31]  Geovany de Araújo Borges,et al.  Line Extraction in 2D Range Images for Mobile Robotics , 2004, J. Intell. Robotic Syst..

[32]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[33]  J. Adler.  Chemotaxis in bacteria. , 1976, Journal of supramolecular structure.

[34]  Thomas Bräunl,et al.  Performance Comparison of Bug Navigation Algorithms , 2007, J. Intell. Robotic Syst..

[35]  E. H. Lloyd.  What is, and what is not, a Markov chain? , 1974 .

[36]  Yutaka Nakamura,et al.  Yuragi-based adaptive searching behavior in mobile robot: From bacterial chemotaxis to Levy walk , 2009, 2008 IEEE International Conference on Robotics and Biomimetics.