In this thesis we have solved the two-dimensional problem of locomotion of modular robots on square lattices in the presence of obstacles of arbitrary forms, for the class of modular robots that follow the model of movement known as the sliding-cube model. The algorithm we propose is deterministic and distributed. All robot modules apply the same set of local rules. That is, they make their own decisions based on local information from their immediate surroundings. The result is a scalable algorithm that solves the problem efficiently. Our results close a problem that was open for more than ten years
Abstract—We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arraye...
Modular robots consist of many identical units (or atoms) that can attach together and perform local...
The field of modular self-reconfigurable robotic systems addresses the design, fabrication, motion p...
In this thesis we have solved the two-dimensional problem of locomotion of modular robots on square ...
Previous work on locomotion strategies for lattice-based modular robots has provided several algori...
In our work we present a collection of distributed algorithms for the locomotion of rectangular and ...
International audienceA modular robots is composed of many independent connected modules which are a...
We prove universal reconfiguration (i.e., reconfigura-tion between any two robotic systems with the ...
A self-reconfigurable modular robot can change its own shape by rearranging the connectivity of the ...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
In this paper we develop a theory of metamodules and an associated distributed asynchronous planner ...
<p>The power of modern computer systems is due in no small part to their fantastic ability to adapt ...
This work is on recon guration of hexagonal lattice-based modular robotic systems. The solutions ar...
Stigmergy is defined as a mechanism of coordination through indirect communication among agents, whi...
Abstract — A self-reconfigurable modular robot can change its own shape by rearranging the connectiv...
Abstract—We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arraye...
Modular robots consist of many identical units (or atoms) that can attach together and perform local...
The field of modular self-reconfigurable robotic systems addresses the design, fabrication, motion p...
In this thesis we have solved the two-dimensional problem of locomotion of modular robots on square ...
Previous work on locomotion strategies for lattice-based modular robots has provided several algori...
In our work we present a collection of distributed algorithms for the locomotion of rectangular and ...
International audienceA modular robots is composed of many independent connected modules which are a...
We prove universal reconfiguration (i.e., reconfigura-tion between any two robotic systems with the ...
A self-reconfigurable modular robot can change its own shape by rearranging the connectivity of the ...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
In this paper we develop a theory of metamodules and an associated distributed asynchronous planner ...
<p>The power of modern computer systems is due in no small part to their fantastic ability to adapt ...
This work is on recon guration of hexagonal lattice-based modular robotic systems. The solutions ar...
Stigmergy is defined as a mechanism of coordination through indirect communication among agents, whi...
Abstract — A self-reconfigurable modular robot can change its own shape by rearranging the connectiv...
Abstract—We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arraye...
Modular robots consist of many identical units (or atoms) that can attach together and perform local...
The field of modular self-reconfigurable robotic systems addresses the design, fabrication, motion p...