Exploring and Triangulating a Region by a Swarm of Robots
We consider online and offline problems related to exploring and surveying a region by a swarm of robots with limited communication range. The minimum relay triangulation problem (MRTP) asks for placing a minimum number of robots, such that their communication graph is a triangulated cover of the region. The maximum area triangulation problem (MATP) aims at finding a placement of n robots such that their communication graph contains a root and forms a triangulated cover of a maximum possible amount of area. Both problems are geometric versions of natural graph optimization problems.
The offline version of both problems share a decision problem, which we prove to be NP-hard. For the online version of the MRTP, we give a lower bound of 6/5 for the competitive ratio, and a strategy that achieves a ratio of 3; for different offline versions, we describe polynomial-time approximation schemes. For the MATP we show that no competitive ratio exists for the online problem, and give polynomial-time approximation schemes for offline versions.
KeywordsCompetitive Ratio Steiner Point Simple Polygon Robot Swarm Online Strategy
Unable to display preview. Download preview PDF.
- 8.Efrat, A., Fekete, S.P., Gaddehosur, P.R., Mitchell, J.S., Polishchuk, V., Suomela, J.: Improved approximation algorithms for relay placement. In: Proc. 16th Annu. Europ. Sympos. Algor., pp. 356–367. Springer, Heidelberg (2008)Google Scholar
- 9.Fekete, S.P., Kamphans, T., Kröller, A., Schmidt, C.: Robot swarms for exploration and triangulation of unknown environments. In: Proceedings of the 25th European Workshop on Computational Geometry, pp. 153–156 (2010)Google Scholar
- 10.Fekete, S.P., Mitchell, J.S.B., Schmidt, C.: Minimum covering with travel cost. In: Proc. 20th Int. Symp. Algor. Comput., pp. 393–402. Springer, Heidelberg (2009)Google Scholar
- 14.Hsiang, T.-R., Arkin, E.M., Bender, M.A., Fekete, S.P., Mitchell, J.S.B.: Algorithms for rapidly dispersing robot swarms in unknown environments. In: Proc. 5th Workshop Algorithmic Found. Robot, pp. 77–94 (2002)Google Scholar
- 17.McLurkin, J., Smith, J.: Distributed algorithms for dispersion in indoor environments using a swarm of autonomous mobile robots (2004)Google Scholar