Contact Sensing: A Sequential Decision Approach to Sensing Manipulation Contact

This paper describes a new statistical, model-based approach to building a contact state observer. The observer uses measurements of the contact force and position, and prior information about the task encoded in a graph, to determine the current location of the robot in the task configuration space. Each node represents what the measurements will look like in a small region of configuration space by storing a predictive, statistical, measurement model. This approach assumes that the measurements are statistically block independent conditioned on knowledge of the model, which is a fairly good model of the actual process. Arcs in the graph represent possible transitions between models. Beam Viterbi search is used to match measurement history against possible paths through the model graph in order to estimate the most likely path for the robot. The resulting approach provides a new decision process that can be use as an observer for event driven manipulation programming. The decision procedure is significantly more robust than simple threshold decisions because the measurement history is used to make decisions. The approach can be used to enhance the capabilities of autonomous assembly machines and in quality control applications.

Sequential Optimal Recovery: A Paradigm for Active Learning

In most classical frameworks for learning from examples, it is assumed that examples are randomly drawn and presented to the learner. In this paper, we consider the possibility of a more active learner who is allowed to choose his/her own examples. Our investigations are carried out in a function approximation setting. In particular, using arguments from optimal recovery (Micchelli and Rivlin, 1976), we develop an adaptive sampling strategy (equivalent to adaptive approximation) for arbitrary approximation schemes. We provide a general formulation of the problem and show how it can be regarded as sequential optimal recovery. We demonstrate the application of this general formulation to two special cases of functions on the real line 1) monotonically increasing functions and 2) functions with bounded derivative. An extensive investigation of the sample complexity of approximating these functions is conducted yielding both theoretical and empirical results on test functions. Our theoretical results (stated insPAC-style), along with the simulations demonstrate the superiority of our active scheme over both passive learning as well as classical optimal recovery. The analysis of active function approximation is conducted in a worst-case setting, in contrast with other Bayesian paradigms obtained from optimal design (Mackay, 1992).

Tubular Organization of SnO₂ Nanocrystallites for Improved Lithium Ion Battery Anode Performance

Porous tin oxide nanotubes were obtained by vacuum infiltration of tin oxide nanoparticles into porous aluminum oxide membranes, followed by calcination. The porous tin oxide nanotube arrays so prepared were characterized by FE-SEM, TEM, HRTEM, and XRD. The nanotubes are open-ended, highly ordered with uniform cross-sections, diameters and wall thickness. The tin oxide nanotubes were evaluated as a substitute anode material for the lithium ion batteries. The tin oxide nanotube anode could be charged and discharged repeatedly, retaining a specific capacity of 525 mAh/g after 80 cycles. This capacity is significantly higher than the theoretical capacity of commercial graphite anode (372 mAh/g) and the cyclability is outstanding for a tin based electrode. The cyclability and capacities of the tin oxide nanotubes were also higher than their building blocks of solid tin oxide nanoparticles. A few factors accounting for the good cycling performance and high capacity of tin oxide nanotubes are suggested.