Mobile Robot Exploration in Indoor Environment Using Topological Structure with Invisible Barcodes

ETRI Journal

关键词: topological mapping;    navigation;    mobile robot;    Invisible barcode;   

Others  :  1185579
DOI  :  10.4218/etrij.07.0106.0066

【 摘 要 】

This paper addresses the localization and navigation problem in the movement of service robots by using invisible two dimensional barcodes on the floor. Compared with other methods using natural or artificial landmarks, the proposed localization method has great advantages in cost and appearance since the location of the robot is perfectly known using the barcode information after mapping is finished. We also propose a navigation algorithm which uses a topological structure. For the topological information, we define nodes and edges which are suitable for indoor navigation, especially for large area having multiple rooms, many walls, and many static obstacles. The proposed algorithm also has the advantage that errors which occur in each node are mutually independent and can be compensated exactly after some navigation using barcodes. Simulation and experimental results were performed to verify the algorithm in the barcode environment, showing excellent performance results. After mapping, it is also possible to solve the kidnapped robot problem and to generate paths using topological information.

   

【 参考文献 】

• [1]iRobot. website. [Online]. Available: http://www. roombavac.com
• [2]F. Dellaert, D. Fox, W. Burgard, and S. Thrun, "Monte Carlo Localization for Mobile Robots," Int’l Conf. Robotics and Automation, 1999, pp. 1322-1328.
• [3]H.H. Gonzalez-Banos and J.C. Latombe, "Navigation Strategies for Exploring Indoor Environments," Int’l J. Robotics Research, vol. 21, no. 10, 2002, pp. 829-848.
• [4]Javier Minguez, "Integration of Planning and Reactive Obstacle Avoidance in Autonomous Sensor-Based Navigation," Int’l Conf. Intelligent Robots and Systems, 2005, pp. 270-276.
• [5]C. Madsen and C. Andersen, "Optimal Landmark Selection for Triangulation of Robot Position," Int’l J. Robotics and Autonomous Systems, vol. 23, no. 4, 1998, pp. 277-292.
• [6]S. Hernaondez, J.M. Torres, C.A. Morales, and L. Acosta, "A New Low Cost System for Autonomous Robot Heading and Position Localization in a Closed Area," Autonomous Robots, vol. 15, no. 2, 2003, pp. 99-110.
• [7]Evolution Robotics. website. [Online]. Available: http://www. evolution.com/products/northstar/
• [8]E. Gonzaolez, A. Suaorez, C. Moreno, and F. Artigue "Complementary Regions: a Surface Filling Algorithm," Int’l Conf. Robotics and Automation, 1996, pp. 909-914.
• [9]W.H. Huang, "Optimal Line-Sweep-Based Decompositions for Coverage Algorithms," Int’l Conf. Robotics and Automation, 2001, pp. 27-32.
• [10]P. Althaus and H.I. Christensen, "Automatic Map Acquisition for Navigation in Domestic Environments," Int’l Conf. Robotics and Automation, 2003, pp. 1551-1556.
• [11]N. Tomatis, I. Nourbakhsh, and R. Siegwart, "Simultaneous Localization and Map Building: A Global Topological Model with Local Metric Maps," Proc. IEEE Int’l Conf. Intelligent Robots and Systems, Oct. 2001, pp. 421-426.
• [12]M. Bosse, P. Newman, J. Leonard, M. Soika, W. Feiten, and S. Teller, "An Atlas Framework for Scalable Mapping," Proc. IEEE Int’l Conf. Robotics and Automation, Sep. 2003, pp. 1899-1906.
• [13]A.C. Victorino and P. Rives, "Global Consistency Mapping with a Hybrid Representation," Proc. IEEE Int’l Conf. Intelligent Robots and Systems, Aug. 2005, pp. 2403-2408.
• [14]E. Fabrizi and A. Saffiotti, "Extracting Topology-Based Maps from Gridmaps," Proc. IEEE Int’l Conf. Robotics and Automation, Sep. 2000, pp. 2972-2978.
• [15]P. Buschka and A. Saffiotti, "A Virual Sensor for Room Detection," Proc. IEEE Int’l Conf. Intelligent Robots and Systems, Oct. 2002, pp. 637-642.
• [16]S. Thrun, W. Burgard and D. Fox, Probabilistic Robotics, MIT Press, 2005.
• [17]D. Fox, S. Thrun, W. Burgard, and F. Dellaert, "Particle Filters for Mobile Robot Localization," A. Doucet, N. de Freitas, and N. Gordon (eds.), Sequential Monte Carlo Methods in Practice, Springer Verlag, 2001, pp. 499-516.