Search

Cable-driven continuum robots, which are robots with a continuously flexible backbone and no identifiable joints that are actuated by cables, have shown great potential for many applications in unstructured, uncertain environments. However, the standard design for a cable-driven continuum robot segment, which bends a continuous backbone along a circular arc, has many compliant modes of deformation which are uncontrolled, and which may result in buckling or other undesirable behaviors if not ameliorated. In this paper, we detail an approach for using additional cables to selectively stiffen planar cable-driven robots with-out substantial coupling to the actuating cables. A mechanics-based model based on the planar Cosserat equations is used to find the design conditions under which additional cables can be routed without coupling of the cable lengths for small deformations. Simulations show that even for relatively large deformations, coupling remains small. A prototype is evaluated, and it is demonstrated that the compliance of the robot is substantially modified relative to the same robot without stiffening cables. Additional stiffening cables are shown to increase the end-effector output stiffness by a factor of approximately 10 over a typical design with actuating cables.

Estimation of unknown noise covariances in a Kalman filter is a problem of significant practical interest in a wide array of applications. Although this problem has a long history, reliable algorithms for their estimation were scant, and necessary and sufficient conditions for identifiability of the covariances were in dispute until recently. Necessary and sufficient conditions for covariance estimation and a batch estimation algorithm were presented in our previous study. This paper presents stochastic gradient descent algorithms for noise covariance estimation in adaptive Kalman filters that are an order of magnitude faster than the batch method for similar or better root mean square error. More significantly, these algorithms are applicable to non-stationary systems where the noise covariances can occasionally jump up or down by an unknown magnitude. The computational efficiency of the new algorithms stems from adaptive thresholds for convergence, recursive fading memory estimation of the sample cross-correlations of the innovations, and accelerated stochastic gradient descent algorithms. The comparative evaluation of the proposed methods on a number of test cases demonstrates their computational efficiency and accuracy.