You are here

Triangulating unknown environments using robot swarms.

In recent years, the field of robotics has seen two diverging trends. One has been to achieve progress by increasing the capabilities of individual robots, keeping the cost of state-of-art machines relatively high. An opposite direction has been to develop simpler and cheaper platforms, at the expense of reducing the capabilities per robot. The latter raises new challenges for developing new principles and algorithms, such as coordinating many robots with limited capabilities into a swarm that can carry out difficult tasks, for example, exploration, surveillance, and guidance. In this video, we show a recent collaboration between theory and practice of swarm robotics. We consider online 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 viagra en suisse 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 heir communication graph contains a root and forms a triangulated cover of a maximum possible amount of area. We demonstrate the practical relevance of our methods by showing how they can be used on the novel real-world platform r-one.

Aaron Becker, Sandor Fekete, Alexandro Kröller, SeoungKyou Lee, James McLurkin, Christiane Schmidt
Proceedings of the 29th annual symposium on Symposuim on computational geometry