Seth Copen Goldstein — accepted AI-conference papers

2018

Electing an Approximate Center in a Huge Modular Robot with the k-BFS SumSweep Algorithm

André Naz, Benoît Piranda, Julien Bourgeois, Seth Copen Goldstein

IROS 2018poster

Among the diversity of the existing modular robotic systems, we consider in this paper the subset of distributed modular robotic ensembles composed of resource-constrained identical modules that are organized in a lattice structure and which can only communicate with neighboring modules. These modul…

Cited by 5 Source ↗Scholar ↗

2015

ABC-Center: Approximate-center election in modular robots

André Naz, Benoît Piranda, Seth Copen Goldstein, Julien Bourgeois

IROS 2015poster

Modular robots are composed of many independent connected modules which are able to achieve common goals through communications. Many distributed algorithms have better performance if the modules that have to communicate with all the others, are placed at the center of the system. In this paper, we…

Cited by 13 Source ↗Scholar ↗