FLUIDIC STOCHASTIC MODULAR ROBOTICS: REVISTING THE SYSTEM DESIGN
Grand Challenges in the Area of Self-Reconfigurable Modular Robots
Experiment Design for Stochastic Three-Dimensional Reconfiguration of Modular Robots
EXPERIMENT DESIGN FOR STOCHASTIC THREE-DIMENSIONAL RECONFIGURATION OF MODULAR ROBOTS
At the Creative Machines Lab we build robots that do what you’d least expect robots to do: Self replicate, self-reflect, ask questions, and even be creative. We develop machines that can design and make other machines – automatically. Our work is inspired from biology, as we seek new biological concepts for engineering and new engineering insights into biology…
Distributed locomotion algorithms for self-reconfigurable robots operating on rough terrain
DISTRIBUTED LOCOMOTION ALGORITHMS FOR SELF-RECONFIGURABLE ROBOTS OPERATING ON ROUGH TERRAIN
Abstract: In this paper, we describe a set of distributed algorithms for self-reconfiguring modular robots that allow them to explore an area in parallel. The algorithms are based on geometric rules that each module evaluates independently relative to its local neighborhood. This paper concentrates on developing algorithms within this framework to enable travel over the widest
variety of terrain. In particular, we show how to perform straight-line motion, turning while on obstacles, climbing over tall obstacles, and tunneling under overhangs, all of which work for groups of arbitrary size. This last feature is important, as it also allows a large system of self-reconfiguring modules to divide up into several groups of various sizes, each of which is equally capable of motion and participation in the overall group task. We also discuss implementations and ways to improve efficiency and switching between tasks.
Design of a Modular Self-Reconfigurable Robot
DESIGN OF A MODULAR SELF-RECONFIGURABLE ROBOT
Abstract: In this paper we examine the development of modular self-reconfigurable robots. A survey of existing modular robots is given. Some limitations of homogeneous design and connection mechanisms are discussed. Therefore, we propose a heterogeneous self-reconfigurable robot with genderless, fail-safe connecting mechanisms. We initially design three basic types (joint, power and special units) of module.
Concurrent metamorphosis of hexagonal robot chains into simple connected configurations
CONCURRENT METAMORPHOSIS OF HEXAGONAL ROBOT CHAINS INTO SIMPLE CONNECTED CONFIGURATIONS
Abstract: The problem addressed is the distributed reconfiguration of a metamorphic robotic system composed of an arbitrary number of two dimensional hexagonal robots (modules) from specific initial to specific goal configurations. The initial configuration considered is a straight chain of robotic modules, while the goal configurations considered satisfy a more general “admissibility” condition. A centralized algorithm is described for determining whether an arbitrary goal configuration is admissible. We prove this algorithm correctly identifies admissible goal configurations and finds a “substrate path” within the goal configuration along which the modules can move to reach their positions in the goal. A second result of the paper is a distributed algorithm for reconfiguring a straight chain into an admissible goal configuration. Different heuristics are proposed to improve the performance of the reconfiguration algorithm and simulation results demonstrate the use of these heuristics.
Flexible Elements with Per Sjoborg
FLEXIBLE ELEMENTS WITH PER SJOBORG
Kasper Stoy, Associate Professor, USD Modular Robotics Research Lab
Robotics: Science & Systems Workshop on Self-Reconfigurable Modular Robots – RSS06
ROBOTICS: SCIENCE & SYSTEMS WORKSHOP ON SELF-RECONFIGURABLE MODULAR ROBOTS – RSS06
Robotics Science and Systems – RSS05
ROBOTICS SCIENCE AND SYSTEMS – RSS05
Self-Reconfigurable Robots/Systems and Applications Workshop 2005 Robotics Conference at MIT
Declarative Programming for Modular Robot – IROS07 (PDF)
DECLARATIVE PROGRAMMING FOR MODULAR ROBOT – IROS07 (PDF)
Abstract: Because of the timing, complexity, and asynchronicity challenges common in modular robot software we have recently begun to explore new programming models for modular robot ensembles. In this paper we apply two of those models to a metamodule-based shape planning algorithm and comment on the differences between the two approaches. Our results suggest that declarative programming can provide several advantages over more traditional imperative approaches, and that the differences between declarative programming styles can themselves contribute leverage to different parts of the problem domain.