Linear multimodal actuation through discrete coupling

Due to technological limitations, robot actuators are often designed for specific tasks with narrow performance goals, whereas a wide range of behaviors is necessary for autonomous robots in uncertain complex environments. In an effort to increase the versatility of actuators, we introduce a new concept of multimodal actuation (MMA) that employs dynamic coupling in the form of clutches and brakes to change its mode of operation. The dynamic coupling allows motors and passive elements such as springs to be engaged and disengaged within a single actuator. We apply the concept to a linear series elastic actuator which uses friction brakes controlled online for the dynamic coupling. With this prototype, we are able to demonstrate several modes of operation including stiff position control, series elastic actuation as well as the possibility to store and release energy in a controlled manner for explosive tasks such as jumping. In this paper, we model the proposed concept of actuation and show a systematic performance analysis of the physical prototype that we developed in our laboratory. © 1996-2012 IEEE.

Linear multi-modal actuation through discrete coupling

Due to technological limitations robot actuators are often designed for specific tasks with narrow performance goals, whereas a wide range of output and behaviours is necessary for robots to operate autonomously in uncertain complex environments. We present a design framework that employs dynamic couplings in the form of brakes and clutches to increase the performance and diversity of linear actuators. The couplings are used to switch between a diverse range of discrete modes of operation within a single actuator. We also provide a design solution for miniaturized couplings that use dry friction to produce rapid switching and high braking forces. The couplings are designed so that once engaged or disengaged no extra energy is consumed. We apply the design framework and coupling design to a linear series elastic actuator (SEA) and show that this relatively simple implementation increases the performance and adds new behaviours to the standard design. Through a number of performance tests we are able to show rapid switching between a high and a low impedance output mode; that the actuator's spring can be charged to produce short bursts of high output power; and that the actuator has additional passive and rigid modes that consume no power once activated. Robots using actuators from this design framework would see a vast increase in their behavioural diversity and improvements in their performance not yet possible with conventional actuator design. © 2012 IEEE.

Linear dimensionality reduction: Survey, insights, and generalizations

© 2015 John P. Cunningham and Zoubin Ghahramani. Linear dimensionality reduction methods are a cornerstone of analyzing high dimensional data, due to their simple geometric interpretations and typically attractive computational properties. These methods capture many data features of interest, such as covariance, dynamical structure, correlation between data sets, input-output relationships, and margin between data classes. Methods have been developed with a variety of names and motivations in many fields, and perhaps as a result the connections between all these methods have not been highlighted. Here we survey methods from this disparate literature as optimization programs over matrix manifolds. We discuss principal component analysis, factor analysis, linear multidimensional scaling, Fisher's linear discriminant analysis, canonical correlations analysis, maximum autocorrelation factors, slow feature analysis, sufficient dimensionality reduction, undercomplete independent component analysis, linear regression, distance metric learning, and more. This optimization framework gives insight to some rarely discussed shortcomings of well-known methods, such as the suboptimality of certain eigenvector solutions. Modern techniques for optimization over matrix manifolds enable a generic linear dimensionality reduction solver, which accepts as input data and an objective to be optimized, and returns, as output, an optimal low-dimensional projection of the data. This simple optimization framework further allows straightforward generalizations and novel variants of classical methods, which we demonstrate here by creating an orthogonal-projection canonical correlations analysis. More broadly, this survey and generic solver suggest that linear dimensionality reduction can move toward becoming a blackbox, objective-agnostic numerical technology.