z-logo
open-access-imgOpen Access
Electing an Approximate Center in a Huge Modular Robot with the k-BFS SumSweep Algorithm
Author(s) -
Andre Naz,
Benoit Piranda,
Julien Bourgeois,
Seth Copen Goldstein
Publication year - 2018
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - modular design , computer science , center (category theory) , robot , algorithm design , self reconfiguring modular robot , algorithm , mobile robot , artificial intelligence , robot control , operating system , chemistry , crystallography

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom