Beacon color code scheduling for the localization of multiple robots

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes a beacon color code scheduling algorithm for the localization of multiple robots in a multi-block workspace. With the developments of intelligent robotics and ubiquitous technology, service robots are applicable for the wide area such as airports and train stations where multiple indoor GPS systems are required for the localization of the mobile robots. Indoor localization schemes using ultrasonic sensors have been widely studied due to its cheap price and high accuracy. However, ultrasonic sensors have some shortages of short transmission range and interferences with other ultrasonic signals. In order to use multiple robots in wide workspace concurrently, it is necessary to resolve the interference problem among the multiple robots in the localization process. This paper proposes an indoor localization system for concurrent multiple robots localization in a wide service area which is divided into multi-block for the reliable sensor operation. The beacon color code scheduling algorithm is developed to avoid the signal interferences and to achieve efficient localization with high accuracy and short sampling time. The performance of the proposed localization system is verified through the simulations and the real experiments.

Cite

CITATION STYLE

APA

Park, J., & Lee, J. (2010). Beacon color code scheduling for the localization of multiple robots. Journal of Institute of Control, Robotics and Systems, 16(5), 433–439. https://doi.org/10.5302/J.ICROS.2010.16.5.433

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free