Breaking the Fixed-Arrival-Time Restriction in Reaching Movements of Neural Prosthetic Devices

We routinely generate reaching arm movements to function independently. For paralyzed users of upper extremity neural prosthetic devices, flexible, high-performance reaching algorithms will be critical to restoring quality-of-life. Previously, algorithms called real-time reach state equations (RSE) were developed to integrate the user's plan and execution-related neural activity to drive reaching movements to arbitrary targets. Preliminary validation under restricted conditions suggested that RSE might yield dramatic performance improvements. Unfortunately, real-world applications of RSE have been impeded because the RSE assumes a fixed, known arrival time. Recent animal-based prototypes attempted to break the fixed-arrival-time assumption by proposing a standard model (SM) that instead restricted the user's movements to a fixed, known set of targets. Here, we leverage general purpose filter design (GPFD) to break both of these critical restrictions, freeing the paralyzed user to make reaching movements to arbitrary target sets with various arrival times and definitive stopping. In silico validation predicts that the new approach, GPFD-RSE, outperforms the SM while offering greater flexibility. We demonstrate the GPFD-RSE against SM in the simulated control of an overactuated 3-D virtual robotic arm with a real-time inverse kinematics engine.