Abstract
Given n robots and n target points on the plane, the minimum set cover formation (SCF) problem requires the robots to form a set cover by the minimum number of robots. In previous formation problems by mobile robots, such as gathering and pattern formation, the problems consist only of the mobile robots, and there are no points fixed in the environment. In addition, the problems do not require a control of the number of robots constructing the formation. In this paper, we first introduce the formation problem in which robots move so that they achieve a desired deployment with the minimum number of robots for a given set of positions of fixed points.
Since the minimum set cover problem with disks in the centralized settings is NP-hard, our goal is to propose approximation algorithms for the minimum SCF problem. First, we show a minimal SCF algorithm from any initial configuration in the asynchronous system. Moreover, we propose an 8-approximation SCF algorithm in the semi-synchronous system for an initial configuration with a low symmetricity. This approximation algorithm achieves 2(1 + 1/l)2 approximation ratio for an initial configuration with the lowest symmetricity (l ≥ 1).
This work was supported in part by KAKENHI No. 26330015 and a Grant-in-Aid for Scientific Research on Innovative Areas gMolecular Roboticsh (No. 24104519) of The Ministry of Education, Culture, Sports, Science, and Technology, Japan.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bronnimann, H., Goodrich, M.T.: Almost Optimal Set Covers in Finite VC-Dimension. Discrete & Computational Geometry 14(1), 463–479 (1995)
Deder, T., Greene, D.: Optimal Algorithms for Approximate Clustering. In: Proc. of STOC 1988, pp. 434–444 (1988)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary Pattern Formation by Asynchronous, Anonymous, Oblivious Robots. Theoretical Computer Science 407, 412–447 (2008)
Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Information Processing Letter 3(12), 133–137 (1981)
Fujinaga, N., Ono, H., Kijima, S., Yamashita, M.: Pattern Formation through Optimum Matching by Oblivious CORDA Robots. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 1–15. Springer, Heidelberg (2010)
Fujinaga, N., Yamauchi, Y., Kijima, S., Yamashita, M.: Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 312–325. Springer, Heidelberg (2012)
Franceschetti, M., Cook, M., Bruck, J.: A Geometric Theorem for Approsimate Disk Covering Algorithms, Report ETR035, Caltech (2001)
Fu, B., Chen, Z., Abdelguerfi, M.: An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol. 4508, pp. 317–326. Springer, Heidelberg (2007)
Gonzalez, T.F.: Covering a set of points in multidimensional space. Information Processing Letters 40(4), 181–188 (1991)
Hochbaum, D.S., Mass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. Journal of the ACM 32(1), 130–136 (1985)
Suzuki, I., Yamashita, M.: Distributed Anonymous Mobile Robots: Formation of geometric patterns. SIAM J. of Comput. 28(4), 1347–1363 (1999)
Yamashita, M., Suzuki, I.: Characterizing Geometric Patterns Formable by Oblivious Anonymous Mobile Robots. Theoretical Computer Science 411, 2433–2453 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Izumi, T., Kamei, S., Yamauchi, Y. (2014). Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots. In: Aguilera, M.K., Querzoni, L., Shapiro, M. (eds) Principles of Distributed Systems. OPODIS 2014. Lecture Notes in Computer Science, vol 8878. Springer, Cham. https://doi.org/10.1007/978-3-319-14472-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-14472-6_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14471-9
Online ISBN: 978-3-319-14472-6
eBook Packages: Computer ScienceComputer Science (R0)