A neural network-based framework is developed and experimentally demonstrated for the problem of estimating the shape of a soft continuum arm (SCA) from noisy measurements of the pose at a finite number of locations along the length of the arm. The neural network takes as input these measurements and produces as output a finitedimensional approximation of the strain, which is further used to reconstruct the infinite-dimensional smooth posture. This problem is important for various soft robotic applications. It is challenging due to the flexible aspects that lead to the infinitedimensional reconstruction problem for the continuous posture and strains. Because of this, past solutions to this problem are computationally intensive. The proposed fast smooth reconstruction method is shown to be five orders of magnitude faster while having comparable accuracy. The framework is evaluated on two testbeds: a simulated octopus muscular arm and a physical BR2 pneumatic soft manipulator.

This paper is concerned with the problem of estimating (interpolating and smoothing) the shape (pose and the six modes of deformation) of a slender flexible body from multiple camera measurements. This problem is important in both biology, where slender, soft, and elastic structures are ubiquitously encountered across species, and in engineering, particularly in the area of soft robotics. The proposed mathematical formulation for shape estimation is physics-informed, based on the use of the special Cosserat rod theory whose equations encode slender body mechanics in the presence of bending, shearing, twisting and stretching. The approach is used to derive numerical algorithms which are experimentally demonstrated for fiber reinforced and cable-driven soft robot arms. These experimental demonstrations show that the methodology is accurate (<5 mm error, three times less than the arm diameter) and robust to noise and uncertainties.

Drawing inspiration from flight behavior in biological settings (e.g. territorial battles in dragonflies, and flocking in starlings), this paper demonstrates two strategies for coverage and flocking. Using earlier theoretical studies on mutual motion camouflage, an appropriate steering control law for area coverage has been implemented in a laboratory test-bed equipped with wheeled mobile robots and a Vicon high speed motion capture system. The same test-bed is also used to demonstrate another strategy (based on local information), termed topological velocity alignment, which serves to make agents move in the same direction. The present work illustrates the applicability of biological inspiration in the design of multi-agent robotic collectives.

This paper presents a Cluster-based Dynamic Differential Evolution with external Archive (CDDE_Ar) for global optimization in dynamic fitness landscape. The algorithm uses a multipopulation method where the entire population is partitioned into several clusters according to the spatial locations of the trial solutions. The clusters are evolved separately using a standard differential evolution algorithm. The number of clusters is an adaptive parameter, and its value is updated after a certain number of iterations. Accordingly, the total population is redistributed into a new number of clusters. In this way, a certain sharing of information occurs periodically during the optimization process. The performance of CDDE_Ar is compared with six state-of-the-art dynamic optimizers over the moving peaks benchmark problems and dynamic optimization problem (DOP) benchmarks generated with the generalized-dynamic-benchmark-generator system for the competition and special session on dynamic optimization held under the 2009 IEEE Congress on Evolutionary Computation. Experimental results indicate that CDDE_Ar can enjoy a statistically superior performance on a wide range of DOPs in comparison to some of the best known dynamic evolutionary optimizers.

This paper investigates the chaotic characteristics in the dynamics of an aggregating swarm model. The range of the parameters of the swarm model is determined for which chaos exists in the dynamics. The trajectories of the individuals are simulated, and the stable, limit cyclic, and chaotic behaviors are demonstrated. The existence of chaos in the swarm is determined by the maximum Lyapunov exponent. The computer simulation supports the results obtained by theoretical analysis.

In this paper we propose a Self Adaptive Cluster based and Weed Inspired Differential Evolution algorithm (SACWIDE), the total population is divided into several clusters based on the positions of the individuals and the cluster number is dynamically changed by the suitable learning strategy during evolution. Here we incorporate a modified version of the Invasive Weed Optimization (IWO) algorithm as a local search technique. The algorithm strategically determines whether a particular cluster will perform Differential Evolution (DE) or the IWO algorithm (modified). The number of clusters in a particular iteration is set by the algorithm itself self-adaptively. The performance of SACWIDE is reported on the set of 22 benchmark problems of CEC-2011.