Learning Hybrid System Models for Supervisory Decoding of Discrete State, with applications to the Parietal Reach Region

Based on Gibbs sampling, a novel method to identify mathematical models of neural activity in response to temporal changes of behavioral or cognitive state is presented. This work is motivated by the developing field of neural prosthetics, where a supervisory controller is required to classify activity of a brain region into suitable discrete modes. Here, neural activity in each discrete mode is modeled with nonstationary point processes, and transitions between modes are modeled as hidden Markov models. The effectiveness of this framework is first demonstrated on a simulated example. The identification algorithm is then applied to extracellular neural activity recorded from multi-electrode arrays in the parietal reach region of a rhesus monkey, and the results demonstrate the ability to decode discrete changes even from small data sets

A control algorithm for autonomous optimization of extracellular recordings

This paper develops a control algorithm that can autonomously position an electrode so as to find and then maintain an optimal extracellular recording position. The algorithm was developed and tested in a two-neuron computational model representative of the cells found in cerebral cortex. The algorithm is based on a stochastic optimization of a suitably defined signal quality metric and is shown capable of finding the optimal recording position along representative sampling directions, as well as maintaining the optimal signal quality in the face of modeled tissue movements. The application of the algorithm to acute neurophysiological recording experiments and its potential implications to chronic recording electrode arrays are discussed

Spike detection using the continuous wavelet transform

This paper combines wavelet transforms with basic detection theory to develop a new unsupervised method for robustly detecting and localizing spikes in noisy neural recordings. The method does not require the construction of templates, or the supervised setting of thresholds. We present extensive Monte Carlo simulations, based on actual extracellular recordings, to show that this technique surpasses other commonly used methods in a wide variety of recording conditions. We further demonstrate that falsely detected spikes corresponding to our method resemble actual spikes more than the false positives of other techniques such as amplitude thresholding. Moreover, the simplicity of the method allows for nearly real-time execution

Inverse Reinforcement Learning in Large State Spaces via Function Approximation

This paper introduces a new method for inverse reinforcement learning in large-scale and high-dimensional state spaces. To avoid solving the computationally expensive reinforcement learning problems in reward learning, we propose a function approximation method to ensure that the Bellman Optimality Equation always holds, and then estimate a function to maximize the likelihood of the observed motion. The time complexity of the proposed method is linearly proportional to the cardinality of the action set, thus it can handle large state spaces efficiently. We test the proposed method in a simulated environment, and show that it is more accurate than existing methods and significantly better in scalability. We also show that the proposed method can extend many existing methods to high-dimensional state spaces. We then apply the method to evaluating the effect of rehabilitative stimulations on patients with spinal cord injuries based on the observed patient motions.Comment: Experiment update

The power dissipation method and kinematic reducibility of multiple-model robotic systems

This paper develops a formal connection between the power dissipation method (PDM) and Lagrangian mechanics, with specific application to robotic systems. Such a connection is necessary for understanding how some of the successes in motion planning and stabilization for smooth kinematic robotic systems can be extended to systems with frictional interactions and overconstrained systems. We establish this connection using the idea of a multiple-model system, and then show that multiple-model systems arise naturally in a number of instances, including those arising in cases traditionally addressed using the PDM. We then give necessary and sufficient conditions for a dynamic multiple-model system to be reducible to a kinematic multiple-model system. We use this result to show that solutions to the PDM are actually kinematic reductions of solutions to the Euler-Lagrange equations. We are particularly motivated by mechanical systems undergoing multiple intermittent frictional contacts, such as distributed manipulators, overconstrained wheeled vehicles, and objects that are manipulated by grasping or pushing. Examples illustrate how these results can provide insight into the analysis and control of physical systems

A hyper-redundant manipulator

“Hyper-redundant” manipulators have a very large number of actuatable degrees of freedom. The benefits of hyper-redundant robots include the ability to avoid obstacles, increased robustness with respect to mechanical failure, and the ability to perform new forms of robot locomotion and grasping. The authors examine hyper-redundant manipulator design criteria and the physical implementation of one particular design: a variable geometry truss

Spike Clustering and Neuron Tracking over Successive Time Windows

This paper introduces a new methodology for tracking signals from individual neurons over time in multiunit extracellular recordings. The core of our strategy relies upon an extension of a traditional mixture model approach, with parameter optimization via expectation-maximimization (EM), to incorporate clustering results from the preceding time period in a Bayesian manner. EM initialization is also achieved by utilizing these prior clustering results. After clustering, we match the current and prior clusters to track persisting neurons. Applications of this spike sorting method to recordings from macaque parietal cortex show that it provides significantly more consistent clustering and tracking results

The kinematics of hyper-redundant robot locomotion

This paper considers the kinematics of hyper-redundant (or “serpentine”) robot locomotion over uneven solid terrain, and presents algorithms to implement a variety of “gaits”. The analysis and algorithms are based on a continuous backbone curve model which captures the robot's macroscopic geometry. Two classes of gaits, based on stationary waves and traveling waves of mechanism deformation, are introduced for hyper-redundant robots of both constant and variable length. We also illustrate how the locomotion algorithms can be used to plan the manipulation of objects which are grasped in a tentacle-like manner. Several of these gaits and the manipulation algorithm have been implemented on a 30 degree-of-freedom hyper-redundant robot. Experimental results are presented to demonstrate and validate these concepts and our modeling assumptions

Optimal Navigation Functions for Nonlinear Stochastic Systems

This paper presents a new methodology to craft navigation functions for nonlinear systems with stochastic uncertainty. The method relies on the transformation of the Hamilton-Jacobi-Bellman (HJB) equation into a linear partial differential equation. This approach allows for optimality criteria to be incorporated into the navigation function, and generalizes several existing results in navigation functions. It is shown that the HJB and that existing navigation functions in the literature sit on ends of a spectrum of optimization problems, upon which tradeoffs may be made in problem complexity. In particular, it is shown that under certain criteria the optimal navigation function is related to Laplace's equation, previously used in the literature, through an exponential transform. Further, analytical solutions to the HJB are available in simplified domains, yielding guidance towards optimality for approximation schemes. Examples are used to illustrate the role that noise, and optimality can potentially play in navigation system design.Comment: Accepted to IROS 2014. 8 Page