Soft Cell Simulator: A tool to study Soft Multi-Cellular Robots

Modular or multi-cellular robots hold the promise to adapt their morphology to task and environment. However, research in modular robotics has traditionally been limited to mechanically non-adaptive systems due to hard building blocks and rigid connection mechanisms. To improve adaptation and global flexibility, we suggest the use of modules made of soft materials. Thanks to recent advances in fabrication techniques the development of soft robots without spatial or material constraints is now possible. In order to exploit this vast design space, computer simulations are a time and cost-efficient tool. However, there is currently no framework available that allows studying the dynamics of soft multi-cellular systems. In this work, we present our simulation framework named Soft Cell Simulator (SCS) that enables to study both mechanical design parameters as well as control problems of soft multi-cellular systems in an time-efficient yet globally accurate manner. Its main features are: (i) high simulation speed to test systems with a large number of cells (real-time up to 100 cells), (ii) large non-linear deformations without module self-penetration, (iii) tunability of module softness (0-500 N/m), (iv) physics-based module connectivity, (v) variability of module shape using internal actuators. We present results that validate the plausibility of the simulated soft cells, the scalability as well as the usability of the simulator. We suggest that this simulator helps to master and leverage the potential of the vast design space to generate novel soft multi-cellular robots.

Decentralized multi-robot coordination in crowded workspaces

Laleh Makarem

The coordination of multi-robot systems is becoming one of the most important areas of research in robotics, mostly because it is required by numerous complex applications. These applications range from intelligent transportation systems, search and rescue robots, and medical robots, to cosmology and astrophysics. The coordination of multi-robot systems is based upon cooperation. The actions performed by each robot take into account the actions executed by the others in such a way that the whole system can operate coherently and efficiently. Regardless of the application, coordination is the key to the successful design and implementation of multi-robot systems. The number of robots involved in the aforementioned applications is increasing along with advances in miniaturization and automation. Consequently, a large number of robots need to share a workspace. This crowded workspace introduces new challenges into the coordination problem by increasing the risk of collision. To take into account communication constraints and sensor ranges, robots rely on local information. Therefore, efficient but simple coordination algorithms are required. This thesis investigates decentralized approaches based on navigation functions for the coordination of multi-robot systems in crowded workspaces. Decentralization allows robots to rely on local information, guarantees scalability and enables real-time deployment. Navigation functions are a special category of potential functions. Their negated gradient vector-field is attractive towards the goal and repulsive with respect to fixed or moving obstacles to avoid collision. In the first part of the thesis, we present the multi-robot coordination problem using navigation functions in a game-theory based framework. We propose a motion model along with a control law that leads the robots to a Nash equilibrium. The existence of the Nash equilibrium enables navigation functions to be exploited for studying, building, and running coordination frameworks for multi-robot systems. In the second part, we address the coordination of autonomous vehicles at intersections. A novel decentralized navigation function is proposed. It guarantees collision-free crossing of autonomous vehicles modeled as first order dynamic systems. The inertia of the vehicles is also introduced in the navigation functions to ensure deadlock-free coordination. The proposed approach does not require adaptation of the road infrastructure and relies upon onboard vehicles sensor data. Compared with traffic lights and roundabouts, the proposed method significantly reduces the travel time and the number of stops, thus decreasing energy consumption and pollution emission. This provides a strong motivation to pursue efforts towards the deployment of autonomous vehicles on roads. In the third part of the thesis, we investigate a coordination framework for a large number of miniaturized fiber positioner robots. The fiber positioner robots are designed and built as parts of the next generation of telescopes enabling large spectroscopic surveys. The proposed decentralized framework ensures the collision-free coordination of the fiber positioners sharing a crowed workspace at the focal plate of the telescope. The dynamical (max speed) and the mechanical (limited actuation range) constraints of the positioners are taken into account in the proposed coordination approach, which significantly reduces the time to reach a new robot configuration.

EPFL2015

Gait Optimization for Roombots Modular Robots - Matching Simulation and Reality

Stéphane Bonardi, Auke Ijspeert, Soha Pouya, Jesse van den Kieboom, Massimo Vespignani

The design of efficient locomotion gaits for robots with many degrees of freedom is challenging and time consuming even if optimization techniques are applied. Control parameters can be found through optimization in two ways: (i) through online optimization where the performance of a robot is measured while trying different control parameters on the actual hardware and (ii) through offline optimization by simulating the robot's behavior with the help of models of the robot and its environment. In this paper, we present a hybrid optimization method that combines the best properties of online and offline optimization to efficiently find locomotion gaits for arbitrary structures. In comparison to pure online optimization, both the number of experiments using robotic hardware as well as the total time required for finding efficient locomotion gaits get highly reduced by running the major part of the optimization process in simulation using a cluster of processors. The presented example shows that even for robots with a low number of degrees of freedom the time required for optimization can be reduced by a factor of 2.5 to 30, at least, depending on how extensive the search for optimized control parameters should be. Time for hardware experiments becomes minimal. More importantly, gaits that can possibly damage the robotic hardware can be filtered before being tried in hardware. Yet in contrast to pure offline optimization, we reach well matched behavior that allows a direct transfer of locomotion gaits from simulation to hardware. This is because through a meta-optimization we adapt not only the locomotion parameters but also the parameters for simulation models of the robot and environment allowing for a good matching of the robot behavior in simulation and hardware. We validate the proposed hybrid optimization method on a structure composed of two Roombots modules with a total number of six degrees of freedom. Roombots are self-reconfigurable modular robots that can form arbitrary structures with many degrees of freedom through an integrated active connection mechanism.

Ieee2013

Gait Optimization for Roombots Modular Robots - Matching Simulation and Reality

Stéphane Bonardi, Auke Ijspeert, Soha Pouya, Jesse van den Kieboom, Massimo Vespignani

Ieee2013

Decentralized multi-robot coordination in crowded workspaces

Laleh Makarem

EPFL2015