Cloud computing based localization for mobile robot systems

A robot localization plays an important role in the field of robot navigation. One of the most commonly used localization algorithms is Monte Carlo algorithm. To improve the efficiency of robot localization, many modified algorithms have been proposed, such as Self-Adaptive Monte Carlo algorithm. However, this method requires a lot of storage space and intensive computing, especially in large environments. In recent years, because of the rapid development of cloud computing, the data can be dynamically allocated. Therefore, this paper combines the Self-Adaptive Monte Carlo Localization algorithm with cloud computing. Some experimental results illustrate the proposed architecture, which can quickly establish the map database and provide the shared map information to multiple robots. In addition, the proposed method reduces the computational load and expands the scope of activities.

[1]  Ken Goldberg,et al.  Cloud Robotics and Automation: A Survey of Related Work , 2013 .

[2]  Javier Civera,et al.  C2TAM: A Cloud framework for cooperative tracking and mapping , 2014, Robotics Auton. Syst..

[3]  Tiancheng Li,et al.  Monte Carlo localization for mobile robot using adaptive particle merging and splitting technique , 2010, The 2010 IEEE International Conference on Information and Automation.

[4]  Ching-Chang Wong,et al.  Localization of mobile robots via an enhanced particle filter , 2010, 2010 IEEE Instrumentation & Measurement Technology Conference Proceedings.

[5]  Tom White,et al.  Hadoop: The Definitive Guide , 2009 .

[6]  Lei Zhang,et al.  Self-adaptive monte carlo for single-robot and multi-robot localization , 2009, 2009 IEEE International Conference on Automation and Logistics.

[7]  Zhikui Chen,et al.  An Algorithm of Weighted Monte Carlo Localization Based on Smallest Enclosing Circle , 2011, 2011 International Conference on Internet of Things and 4th International Conference on Cyber, Physical and Social Computing.

[8]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[9]  GhemawatSanjay,et al.  The Google file system , 2003 .

[10]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[11]  Lei Zhang,et al.  Self-adaptive Monte Carlo localization for mobile robots using range sensors , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[12]  Dieter Fox,et al.  Adapting the Sample Size in Particle Filters Through KLD-Sampling , 2003, Int. J. Robotics Res..

[13]  Lars George,et al.  HBase: The Definitive Guide , 2011 .

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

[15]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[16]  Tae-Bum Kwon,et al.  Efficiency Improvement in Monte Carlo Localization through Topological Information , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Wilson C. Hsieh,et al.  Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.