ABC-Center: Approximate-center election in modular robots

IEEE International Conference on Intelligent Robots and Systems

Volumn 2015-December, Issue , 2015, Pages 2951-2957

  Naz, Andre ^a   Piranda, Benoit ^a   Goldstein, Seth Copen ^b   Bourgeois, Julien ^a  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

^b Carnegie Mellon University   (United States)

Author keywords

Center election; Distributed algorithm; Modular robotic

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; MODULAR ROBOTS; PARALLEL ALGORITHMS; ROBOTS;

CENTER ELECTION; ITERATIVE ALGORITHM; LOW MEMORY; MODULAR ROBOTICS; NUMBER OF ITERATIONS; RANDOM SYSTEMS;

INTELLIGENT ROBOTS;

EID: 84958172002     PISSN: 21530858     EISSN: 21530866     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2015.7353784     Document Type: Conference Paper

References (16)

1. B. T. Kirby, M. Ashley-Rollman, and S. C. Goldstein, "Blinky blocks: A physical ensemble programming platform, " in CHI '11 Extended Abstracts on Human Factors in Computing Systems, ser. CHI EA '11. New York, NY, USA: ACM, 2011, pp. 1111-1116.
2. "Xmega a3 microcontroller data-sheet. " [Online]. Available: http://www. atmel. com/Images/ Atmel-8068-8-and16-bit-AVR-XMEGA-A3-Microcontrollers Datasheet. pdf
3. A. Naz, B. Piranda, J. Bourgeois, and S. C. Goldstein, "Blinky blocks time protocol (BBTP): Protocole de synchronisation des horloges internes de dispositifs embarqués, " FEMTO-ST, Research Report RRFEMTO-ST-2671, Jan. 2015.
4. M. Maróti, B. Kusy, G. Simon, and Á. Lédeczi, "The flooding time synchronization protocol, " in Proceedings of the 2nd international conference on Embedded networked sensor systems. ACM, 2004, pp. 39-49.
5. S. Wasserman, Social network analysis: Methods and applications. Cambridge university press, 1994, vol. 8.
6. E. Korach, D. Rotem, and N. Santoro, "Distributed algorithms for finding centers and medians in networks, " ACM Trans. Program. Lang. Syst., vol. 6, no. 3, pp. 380-401, July 1984.
7. T.-Y. Cheung, "Graph traversal techniques and the maximum flow problem in distributed computation, " Software Engineering, IEEE Transactions on, no. 4, pp. 504-512, 1983.
8. S. C. Bruell, S. Ghosh, M. H. Karaata, and S. V. Pemmaraju, "Selfstabilizing algorithms for finding centers and medians of trees, " SIAM Journal on Computing, vol. 29, no. 2, pp. 600-614, 1999.
9. S. Patterson, "In-network leader selection for acyclic graphs, " arXiv preprint arXiv:1410. 6533, 2014.
10. G. Y. Handler, "Minimax location of a facility in an undirected tree graph, " Transportation Science, vol. 7, no. 3, pp. 287-293, 1973.
11. P. Crescenzi, R. Grossi, M. Habib, L. Lanzi, and A. Marino, "On computing the diameter of real-world undirected graphs, " Theoretical Computer Science, vol. 514, pp. 84-95, 2013.
12. M. Borassi, P. Crescenzi, M. Habib, W. Kosters, A. Marino, and F. Takes, "On the solvability of the six degrees of kevin bacon game, " in Fun with Algorithms. Springer, 2014, pp. 52-63.
13. M. Raynal, Distributed algorithms for message-passing systems. Springer, 2013, vol. 500.
14. N. A. Lynch, Distributed algorithms. Morgan Kaufmann, 1996.
15. J. Bourgeois, J. Cao, M. Raynal, D. Dhoutaut, B. Piranda, E. Dedu, A. Mostefaoui, and H. Mabed, "Coordination and computation in distributed intelligent MEMS, " in AINA 2013, 27th IEEE Int. Conf. on Advanced Information Networking and Applications. Barcelona, Spain: IEEE Computer Society, Mar. 2013, pp. 118-123.
16. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms: The Floyd-Warshall algorithm, 2nd ed. McGraw-Hill Higher Education, 2001.