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]
@inproceedings{NazPBG18-0,
title = {Electing an Approximate Center in a Huge Modular Robot with the k-BFS SumSweep Algorithm},
author = {Andre Naz and Benoît Piranda and Julien Bourgeois and Seth Copen Goldstein},
year = {2018},
doi = {10.1109/IROS.2018.8593612},
url = {https://doi.org/10.1109/IROS.2018.8593612},
researchr = {https://researchr.org/publication/NazPBG18-0},
cites = {0},
citedby = {0},
pages = {4825-4832},
booktitle = {2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2018, Madrid, Spain, October 1-5, 2018},
publisher = {IEEE},
isbn = {978-1-5386-8094-0},
}