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

Andre Naz, BenoƮt Piranda, Julien Bourgeois, Seth Copen Goldstein. Electing an Approximate Center in a Huge Modular Robot with the k-BFS SumSweep Algorithm. In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2018, Madrid, Spain, October 1-5, 2018. pages 4825-4832, IEEE, 2018. [doi]

Abstract

Abstract is missing.