5 accepted papers
We present a distributed Bayesian algorithm for robot swarms to classify a spatially distributed feature of an environment. This type of "go/no-go" decision appears in applications where a group of robots must collectively choose whether to take action, such as determining if a farm field should be…
We study the problem of controlling a swarm of anonymous, mobile robots to cooperatively cover an unknown two-dimensional space. The novelty of our proposed solution is that it is applicable to extremely simple robots that lack run-time computation or storage. The solution requires only a single bit…
A canonical problem for swarms of agents is to collectively choose one of multiple options in their environment. We present a novel control strategy for solving this problem—the first to be free of arithmetic computation. The agents do not communicate with each other nor do they store run-time infor
In this letter, we present the design of a miniature (100 mm) autonomous underwater robot that is low-cost ($ 100), easy to manufacture, and highly maneuverable. A key aspect of the robot design that makes this possible is the use of low-cost magnet-in-coil actuators, which have a small profile and
Recently, a new class of machine learning algorithms has emerged, where models and discriminators are generated in a competitive setting. The most prominent example is Generative Adversarial Networks (GANs). In this paper we examine how these algorithms relate to the Turing test, and derive what - f…