Next Article in Journal
Fabrication of Nanopores Polylactic Acid Microtubes by Core-Sheath Electrospinning for Capillary Vascularization
Previous Article in Journal
An Evaluation Methodology for Interactive Reinforcement Learning with Simulated Users
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Simulating the Fast Prediction Strategy of the Sensorimotor System

Department of Medicine and Surgery, University of Perugia, 06132 Perugia, Italy
Submission received: 18 December 2020 / Revised: 30 January 2021 / Accepted: 2 February 2021 / Published: 10 February 2021

Abstract

:
The values of a physiological parameter and its time derivatives, detected at different times by different sensory receptors, are processed by the sensorimotor system to predict the time evolution of the parameter and convey appropriate control commands acting with minimum latency (few milliseconds) from the sensory stimulus. We have derived a power-series expansion (U-expansion) to simulate the fast prediction strategy of the sensorimotor system. Given a time-function f , a time-instant t 0 , and a time-increment τ , the U-expansion enables the calculation of f ( t 0 + τ ) from f ( t 0 ) and the values f ( n ) ( t n ) of the derivatives f ( n ) of f at arbitrarily different times t n   ( n = 1 , 2 , ) , instead of time t 0 as in the Taylor series. For increments τ significantly greater than the maximum t among the differences | t n t n 1 | , the error associated with truncation of the U-expansion at a given order closely equalizes the error of the corresponding Taylor series ( t = 0 ) truncated at the same order. Small values of t and higher values of τ correspond to the high-frequency discharge of sensory neurons and the need for longer-term prediction, respectively. Taking inspiration from the sensorimotor system, the U-expansion can potentially provide an analytical background for the development of algorithms designed for the fast and accurate feedback control of nonlinear systems.

1. Introduction

One of the main objectives of basic and applied sciences is to predict the time evolution of a physical system based on its current and previous behavior. This information is often used to regulate the system (i.e., to direct the system towards a specific behavior) through appropriate feedback control commands [1,2]. Notably, the human central nervous system (CNS) integrates and processes a continuous stream of afferent exteroceptive, proprioceptive, and interoceptive information originating from a vast array of sensory receptors (mechanoreceptors, chemoreceptors, photoreceptors, and thermoreceptors) to predict in advance the time evolution of the body’s status and functions (for example, to predict the effects of external perturbations, the effects of the execution of a voluntary task, or the development of internal body conditions that might become harmful) and convey appropriate efferent control commands (for example, to maintain postural equilibrium and orientation, enable coordinated and precise movement patterns, stabilize the visual image on the retinas, and restore and maintain homeostasis) [3,4,5,6]. In many real situations, the constitutive equations that govern the dynamics of a physical system are not exactly known or are too complex to be solved analytically, and approximate numerical methods are needed to arrive at a reliable assessment and effective control of the time evolution of the system [7]. For example, most real-world systems, including the great majority of biological systems, are inherently nonlinear in nature [8,9]. These systems are often governed by nonlinear differential equations and are generally analyzed with the use of numerical methods in the time domain [10,11].
The Taylor series provides a powerful analytical tool for the prediction of the evolution of nonlinear functions. A sufficiently smooth function f of time can usually be expanded into a Taylor series [12] about a time instant t 0 , enabling the calculation of the function at a later time t 0 + τ ( τ being the time increment from t 0 ), given the values of f and its derivatives f ( n ) (n = 1, 2, …) at time t 0 :
f ( t 0 + τ ) = f ( t 0 ) + n = 1 f ( n ) ( t 0 ) τ n n !
Truncation of the series at a given order n yields an error in the calculation of f ( t 0 + τ ) (referred to as the remainder), which is an infinitesimal of order higher than τ n as τ 0 [13]. In fact, the CNS seems to use a similar prediction strategy. Indeed, the sensory receptors of the nervous system can collectively sense the value of a physiological parameter and its time derivatives (up to the third order) and may be directly connected with target motor neurons via large-diameter fast-conducting sensory axons and monosynaptic spinal reflex pathways [14,15,16,17,18,19]. As a result, the efferent response elicited by a sensory stimulus can act with a latency of a few milliseconds [4].
In spite of this close analogy, the Taylor series is not directly usable to simulate the sensorimotor control system. Indeed, the afferent sensory information originating from different sensory receptors is not synchronized in time, as it is generally engendered at different instants from different receptors. Each piece of information originating from a sensory receptor travels along a specific sensory neural pathway to reach the processing and integration centers. Thus, the CNS can retrieve a complete map of the receptive fields where the sensory stimuli originated from, together with the corresponding sets of time instants when each sensory stimulus was produced in a specific receptive field. None of the existing models dealing with the control strategy of the sensorimotor system have specifically addressed the problem of the lack of time synchronization within a discrete set of sensory information that conveys to the CNS the value of the successive derivatives of a physiological function [20,21,22,23].
The purpose of this study was to develop a computational model that enables a fast and accurate prediction of the time evolution of a physiological parameter, based on the value of the parameter and the values of its time derivatives detected at different times. To accomplish this goal, we have derived a specific power series expansion, hereafter referred to as the “unsynchronized expansion” (or “U-expansion”, for the sake of brevity). Specifically, given a time function f , a time instant t 0 , and a time increment τ, the U-expansion enables the computation of f ( t 0 + τ ) from the value f ( t 0 ) and the values f ( n ) ( t n ) of the derivatives f ( n ) of f at arbitrarily different times t n (n = 1, 2, …), instead of time t 0 as in the Taylor series. This new series expansion might constitute an analytical background for the study and simulation of the fast prediction strategies of the sensorimotor system, yet the demonstration that the sensorimotor system actually relies on this specific algorithm is beyond the scope of this study. Nevertheless, the U-expansion unveils for the first time a seminal, plausible sensorimotor prediction strategy, which is based on the afferent sensory information that conveys to the CNS the unsynchronized values of the successive derivatives of a physiological function. Most important, the U-expansion can potentially provide an analytical background for the development of numerical algorithms based on high-order finite difference methods and designed for the fast and accurate feedback control of nonlinear systems.

2. Materials and Methods

Let us consider the Taylor series expansion of the time function f about the time instant t 0 :
f ( t 0 + τ ) = f ( t 0 ) + f ( 1 ) ( t 0 ) τ + f ( 2 ) ( t 0 ) τ 2 2 ! + f ( 3 ) ( t 0 ) τ 3 3 ! + f ( 4 ) ( t 0 ) τ 4 4 ! + f ( 5 ) ( t 0 ) τ 5 5 ! + = f ( t 0 ) + k = 1 f ( k ) ( t 0 ) τ k k !
where τ is the time increment from t 0 . To derive the U-expansion, the derivatives f ( n ) ( t 0 )   in the right-hand side of Equation (1) will be recursively expanded in the Taylor series about a set of arbitrary instants t n (n = 1, 2, …), as detailed in the following subsections.

2.1. Expansion of the First-Order Term

In the first order-term f ( 1 ) ( t 0 ) τ of the Taylor series (1), f ( 1 ) ( t 0 ) is expressed as the Taylor series expansion of f ( 1 ) about t 1 and for a t 0 t 1 increment:
f ( 1 ) ( t 0 ) = f ( 1 ) ( t 1 ) + f ( 2 ) ( t 1 ) ( t 0 t 1 ) + f ( 3 ) ( t 1 ) ( t 0 t 1 ) 2 2 ! + f ( 4 ) ( t 1 ) ( t 0 t 1 ) 3 3 ! + f ( 5 ) ( t 1 ) ( t 0 t 1 ) 4 4 ! +
In this equation, f ( 2 ) ( t 1 ) is expressed as the expansion of f ( 2 ) about t 2 and for a t 1 t 2 increment:
f ( 1 ) ( t 0 ) = f ( 1 ) ( t 1 ) + ( t 0 t 1 ) [ f ( 2 ) ( t 2 ) + f ( 3 ) ( t 2 ) ( t 1 t 2 ) + f ( 4 ) ( t 2 ) ( t 1 t 2 ) 2 2 ! + f ( 5 ) ( t 2 ) ( t 1 t 2 ) 3 3 ! + ] + f ( 3 ) ( t 1 ) ( t 0 t 1 ) 2 2 ! + f ( 4 ) ( t 1 ) ( t 0 t 1 ) 3 3 ! + f ( 5 ) ( t 1 ) ( t 0 t 1 ) 4 4 ! +
Here, the two 3rd-order derivatives are expanded in the Taylor series: f ( 3 ) ( t 1 )   is expressed as the expansion of f ( 3 ) about t 3 and for a t 1 t 3 increment, while f ( 3 ) ( t 2 )   is again expressed as the expansion of f ( 3 ) about t 3 , but for a t2t3 increment:
f ( 1 ) ( t 0 ) = f ( 1 ) ( t 1 ) + ( t 0 t 1 ) [ f ( 2 ) ( t 2 ) + f ( 3 ) ( t 3 ) ( t 1 t 2   ) + f ( 4 ) ( t 3 ) ( t 1 t 2   ) ( t 2 t 3   ) + f ( 5 ) ( t 3 ) ( t 1 t 2   ) ( t 2 t 3   ) 2 2 ! + f ( 4 ) ( t 2   ) ( t 1 t 2   ) 2 2 ! + f ( 5 ) ( t 2   ) ( t 1 t 2   ) 3 3 ! + ] + ( t 0 t 1 ) 2 2 ! [ f ( 3 ) ( t 3 ) + f ( 4 ) ( t 3 ) ( t 1 t 3 ) + f ( 5 ) ( t 3 ) ( t 1 t 3 ) 2 2 ! +   ] + f ( 4 ) ( t 1 ) ( t 0 t 1 ) 3 3 ! + f ( 5 ) ( t 1 ) ( t 0 t 1 ) 4 4 ! +
The three 4th-order derivatives   f ( 4 ) ( t 1 ) , f ( 4 ) ( t 2 ) , and f ( 4 ) ( t 3 ) are then expressed as the expansion of f ( 4 ) about t 4 , for increments given by t 1 t 4 ,   t 2 t 4 , and t 3 t 4 , respectively:
f ( 1 ) ( t 0 ) = f ( 1 ) ( t 1 ) + ( t 0 t 1 ) [ f ( 2 ) ( t 2 ) + f ( 3 ) ( t 3 ) ( t 1 t 2 ) + f ( 4 ) ( t 4 ) ( t 1 t 2 ) ( t 2 t 3 ) + f ( 5 ) ( t 4 ) ( t 1 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) + f ( 5 ) ( t 3 ) ( t 1 t 2 ) ( t 2 t 3 ) 2 2 ! + f ( 4 ) ( t 4 ) ( t 1 t 2 ) 2 2 ! + f ( 5 ) ( t 4 ) ( t 1 t 2 ) 2 2 ! ( t 2 t 4 ) + f ( 5 ) ( t 2 ) ( t 1 t 2 ) 3 3 ! + ] + ( t 0 t 1 ) 2 2 ! [ f ( 3 ) ( t 3 ) + f ( 4 ) ( t 4 ) ( t 1 t 3 ) + f ( 5 ) ( t 4 ) ( t 1 t 3 ) ( t 3 t 4 ) + f ( 5 ) ( t 3 ) ( t 1 t 3 ) 2 2 ! + ] + ( t 0 t 1 ) 3 3 ! [ f ( 4 ) ( t 4 ) + f ( 5 ) ( t 4 ) ( t 1 t 4 ) ] + f ( 5 ) ( t 1 ) ( t 0 t 1 ) 4 4 ! +
The process continues by expressing the four 5th-order derivatives f ( 5 ) ( t 1 ) , f ( 5 ) ( t 2 ) , f ( 5 ) ( t 3 ) , and f ( 5 ) ( t 4 ) as the expansion of f ( 5 ) about t 5 , for increments given by t 1 t 5 , t 2 t 5 , t 3 t 5 , and t 4 t 5 , respectively. With the progressive expansion of higher-order derivatives and grouping together of derivatives of the same order, one gets the following final equation for f ( 1 ) ( t 0 ) (where terms up to the 6th order have been included):
f ( 1 ) ( t 0 ) = f ( 1 ) ( t 1 ) + f ( 2 ) ( t 2 ) ( t 0 t 1 ) + f ( 3 ) ( t 3 ) [ ( t 0 t 1 ) 2 2 ! + ( t 0 t 1 ) ( t 1 t 2 ) ] + f ( 4 ) ( t 4 ) [ ( t 0 t 1 ) 3 3 ! + ( t 0 t 1 ) ( t 1 t 2 ) 2 2 ! + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) ] + f ( 5 ) ( t 5 ) [ ( t 0 t 1 ) 4 4 ! + ( t 0 t 1 ) ( t 1 t 2 ) 3 3 ! + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) 2 2 ! + ( t 0 t 1 ) 3 3 ! ( t 1 t 4 ) + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) 2 2 ! + ( t 0 t 1 ) ( t 1 t 2 ) 2 2 ! ( t 2 t 4 ) + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) ( t 3 t 4 ) + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) ] + f ( 6 ) ( t 6 ) [ ( t 0 t 1 ) 5 5 ! + ( t 0 t 1 ) ( t 1 t 2 ) 4 4 ! + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) 3 3 ! + ( t 0 t 1 ) 3 3 ! ( t 1 t 4 ) 2 2 ! + ( t 0 t 1 ) 4 4 ! ( t 1 t 5 ) + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) 3 3 ! + ( t 0 t 1 ) ( t 1 t 2 ) 2 2 ! ( t 2 t 4 ) 2 2 ! + ( t 0 t 1 ) ( t 1 t 2 ) 3 3 ! ( t 2 t 5 ) + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) ( t 3 t 4 ) 2 2 ! + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) 2 2 ! ( t 3 t 5 ) + ( t 0 t 1 ) 3 3 ! ( t 1 t 4 ) ( t 4 t 5 ) + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) 2 2 ! + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) 2 2 ! ( t 3 t 5 ) + ( t 0 t 1 ) ( t 1 t 2 ) 2 2 ! ( t 2 t 4 ) ( t 4 t 5 ) + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) ( t 3 t 4 ) ( t 4 t 5 ) + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) ( t 4 t 5 ) ] +
Each term in this equation is the product of a number of factors equal to the number of expansions carried out.

2.2. Expansion of the Second-Order Term

The step procedure is repeated for the 2nd-order derivative f ( 2 ) ( t 0 ) in the Taylor series (1). Specifically, f ( 2 ) ( t 0 ) is expressed as the Taylor series expansion of f ( 2 ) about t 2 and for a t 0 t 2 increment:
f ( 2 ) ( t 0 ) = f ( 2 ) ( t 2 ) + f ( 3 ) ( t 2 ) ( t 0 t 2 ) + f ( 4 ) ( t 2 ) ( t 0 t 2 ) 2 2 ! + f ( 5 ) ( t 2 ) ( t 0 t 2 ) 3 3 ! + f ( 6 ) ( t 2 ) ( t 0 t 2 ) 4 4 ! +
In this equation, f ( 3 ) ( t 2 ) is expressed as the Taylor series expansion of f ( 3 ) about t 3 and for a t 2 t 3 increment:
f ( 2 ) ( t 0 ) = f ( 2 ) ( t 2 ) + ( t 0 t 2 ) [ f ( 3 ) ( t 3 ) + f ( 4 ) ( t 3 ) ( t 2 t 3 ) + f ( 5 ) ( t 3 ) ( t 2 t 3 ) 2 2 ! + f ( 6 ) ( t 3 ) ( t 2 t 3 ) 3 3 ! ] + f ( 4 ) ( t 2 ) ( t 0 t 2 ) 2 2 ! + f ( 5 ) ( t 2 ) ( t 0 t 2 ) 3 3 ! + f ( 6 ) ( t 2 ) ( t 0 t 2 ) 4 4 ! +
The two 4th-order derivatives f ( 4 ) ( t 2 ) and f ( 4 ) ( t 3 ) are then expressed as the expansion of f ( 4 ) about t 4 , for increments given by t 2 t 4 and t 3 t 4 , respectively:
f ( 2 ) ( t 0 ) = f ( 2 ) ( t 2 ) + ( t 0 t 2 ) [ f ( 3 ) ( t 3 ) + f ( 4 ) ( t 4 ) ( t 2 t 3 ) + f ( 5 ) ( t 4 ) ( t 2 t 3 ) ( t 3 t 4 ) + f ( 6 ) ( t 4 ) ( t 2 t 3 ) ( t 3 t 4 ) 2 2 ! + f ( 5 ) ( t 3 ) ( t 2 t 3 ) 2 2 ! + f ( 6 ) ( t 3 ) ( t 2 t 3 ) 3 3 ! ] + ( t 0 t 2 ) 2 2 ! [ f ( 4 ) ( t 4 ) + f ( 5 ) ( t 4 ) ( t 2 t 4 ) + f ( 6 ) ( t 4 ) ( t 2 t 4 ) 2 2 ] + f ( 5 ) ( t 2 ) ( t 0 t 2 ) 3 3 ! + f ( 6 ) ( t 2 ) ( t 0 t 2 ) 4 4 ! +
In the next step, the three 5th-order derivatives f ( 5 ) ( t 2 ) , f ( 5 ) ( t 3 ) , and f ( 5 ) ( t 4 ) are expressed as the expansion of f ( 5 ) about t 5 , for increments given by t 2 t 5 , t 3 t 5 , and t 4 t 5 , respectively:
f ( 2 ) ( t 0 ) = f ( 2 ) ( t 2 ) + ( t 0 t 2 ) [ f ( 3 ) ( t 3 ) + f ( 4 ) ( t 4 ) ( t 2 t 3 ) + f ( 5 ) ( t 5 ) ( t 2 t 3 ) ( t 3 t 4 ) + f ( 6 ) ( t 5 ) ( t 2 t 3 ) ( t 3 t 4 ) ( t 4 t 5 ) + f ( 6 ) ( t 4 ) ( t 2 t 3 ) ( t 3 t 4 ) 2 2 ! + f ( 5 ) ( t 5 ) ( t 2 t 3 ) 2 2 ! + f ( 6 ) ( t 3 ) ( t 2 t 3 ) 2 2 ! ( t 3 t 5 ) + f ( 6 ) ( t 3 ) ( t 2 t 3 ) 3 3 ! ] + ( t 0 t 2 ) 2 2 ! [ f ( 4 ) ( t 4 ) + f ( 5 ) ( t 5 ) ( t 2 t 4 ) + f ( 6 ) ( t 5 ) ( t 2 t 4 ) ( t 4 t 5 ) + f ( 6 ) ( t 4 ) ( t 2 t 4 ) 2 2 ] + ( t 0 t 2 ) 3 3 ! [ f ( 5 ) ( t 5 ) + f ( 6 ) ( t 5 ) ( t 2 t 5 ) ] + f ( 6 ) ( t 2 ) ( t 0 t 2 ) 4 4 ! +
With the progressive expansion of the higher-order derivatives and grouping together of derivatives of the same order, one arrives at the following final equation for f ( 2 ) ( t 0 ) (where terms up to the 6th order have been included):
f ( 2 ) ( t 0 ) = f ( 2 ) ( t 2 ) + f ( 3 ) ( t 3 ) ( t 0 t 2 ) + f ( 4 ) ( t 4 ) [ ( t 0 t 2 ) 2 2 ! + ( t 0 t 2 ) ( t 2 t 3 ) ] + f ( 5 ) ( t 5 ) [ ( t 0 t 2 ) 3 3 ! + ( t 0 t 2 ) ( t 2 t 3 ) 2 2 ! + ( t 0 t 2 ) 2 2 ! ( t 2 t 4 ) + ( t 0 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) ] + f ( 6 ) ( t 6 ) [ ( t 0 t 2 ) 4 4 ! + ( t 0 t 2 ) ( t 2 t 3 ) 3 3 ! + ( t 0 t 2 ) 2 2 ! ( t 2 t 4 ) 2 2 ! + ( t 0 t 2 ) 3 3 ! ( t 2 t 5 ) + ( t 0 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) 2 2 ! + ( t 0 t 2 ) ( t 2 t 3 ) 2 2 ! ( t 3 t 5 ) + ( t 0 t 2 ) 2 2 ! ( t 2 t 4 ) ( t 4 t 5 ) + ( t 0 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) ( t 4 t 5 ) ] +

2.3. Expansion of the Third-Order Term

The procedure progresses with the higher-order derivatives. For example, f ( 3 ) ( t 0 ) is expressed as the Taylor series expansion of f ( 3 ) about t 3 and for a t 0 t 3 increment:
f ( 3 ) ( t 0 ) = f ( 3 ) ( t 3 ) + f ( 4 ) ( t 3 ) ( t 0 t 3 ) + f ( 5 ) ( t 3 ) ( t 0 t 3 ) 2 2 ! + f ( 6 ) ( t 3 ) ( t 0 t 3 ) 3 3 ! +
f ( 4 ) ( t 3 ) as the Taylor series expansion of f ( 4 ) about t 4 and for a t 3 t 4 increment:
f ( 3 ) ( t 0 ) = f ( 3 ) ( t 3 ) + ( t 0 t 3 ) [ f ( 4 ) ( t 4 ) + f ( 5 ) ( t 4 ) ( t 3 t 4 ) + f ( 6 ) ( t 4 ) ( t 3 t 4 ) 2 2 + ] + f ( 5 ) ( t 3 ) ( t 0 t 3 ) 2 2 ! + f ( 6 ) ( t 3 ) ( t 0 t 3 ) 3 3 ! +
f ( 5 ) ( t 3 ) and f ( 5 ) ( t 4 ) as the expansion of f ( 5 ) about t 5 , for increments given by t 3 t 5 and t 4 t 5 , respectively, and so on, to finally get
f ( 3 ) ( t 0 ) = f ( 3 ) ( t 3 ) + f ( 4 ) ( t 4 ) ( t 0 t 3 ) + f ( 5 ) ( t 5 ) [ ( t 0 t 3 ) 2 2 ! + ( t 0 t 3 ) ( t 3 t 4 ) ] + f ( 6 ) ( t 6 ) [ ( t 0 t 3 ) 3 3 ! + ( t 0 t 3 ) ( t 3 t 4 ) 2 2 + ( t 0 t 3 ) 2 2 ! ( t 3 t 5 ) + ( t 0 t 3 ) ( t 3 t 4 ) ( t 4 t 5 ) ] +

2.4. The U-Expansion

The procedure outlined in the previous sections highlights that each of the derivatives f ( k ) ( t 0 ) in the Taylor series (1) can be expressed in terms of the derivatives f ( n ) ( t n )   ( n = k ,   k + 1 ,   k + 2 ,   ) according to the following equation:
f ( k ) ( t 0 ) = n = k f ( n ) ( t n ) p n k                                                     ( k = 1 ,   2 ,   3 , )
where the p n k coefficients will be readily deduced, in the next section, from Equations (2)–(4). Replacing the first and the higher-order time derivatives f ( k ) ( t 0 ) in the right-hand side of the Taylor series (1) with the corresponding expressions given by Equation (5), one gets
f ( t 0 + τ ) = f ( t 0 ) + k = 1 ( τ k k ! · n = k f ( n ) ( t n ) p n k )
Rearrangement of the indexes k and n gives the final form of the U-expansion:
f ( t 0 + τ ) = f ( t 0 ) + n = 1 ( f ( n ) ( t n ) · k = 1 n τ k k ! p n k )

2.5. The Coefficients

Comparison of Equation (5) with Equations (2)–(4) highlights that for n = k , all the p n k coefficients ( p 11 ,   p 22 , …) are equal to 1:
p n k = 1                                                                                                                                             ( n = k )
For n = k + 1 , the p n k coefficients ( p 21 ,   p 32 , …) are equal to t 0 t k , and can be written as
p n k = t 0 t k = ( t 0 t k ) n k ( n k ) !                                                             ( n = k + 1 )
For n = k + 2 , k + 3 , and k + 4 , one has
p n k = ( t 0 t k ) 2 2 ! + ( t 0 t k ) ( t k t k + 1 ) = ( t 0 t k ) n k ( n k ) ! + i 1 = k + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) n i 1 ( n i 1 ) ! ( n = k + 2 ) p n k = ( t 0 t k ) 3 3 ! + ( ( t 0 t k ) ( t k t k + 1 ) 2 2 ! + ( t 0 t k ) 2 2 ! ( t k t k + 2 ) ) + ( t 0 t k ) ( t k t k + 1 ) ( t k + 1 t k + 2 ) = ( t 0 t k ) n k ( n k ) ! + i 1 = k + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) n i 1 ( n i 1 ) ! + i 1 = k + 1 n 2 i 2 = i 1 + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) i 2 i 1 ( i 2 i 1 ) ! ( t i 1 t i 2 ) n i 2 ( n i 2 ) ! ( n = k + 3 ) p n k = ( t 0 t k ) 4 4 ! + ( ( t 0 t k ) ( t k t k + 1 ) 3 3 ! + ( t 0 t k ) 2 2 ! ( t k t k + 2 ) 2 2 ! + ( t 0 t k ) 3 3 ! ( t k t k + 3 ) ) + ( ( t 0 t k ) ( t k t k + 1 ) ( t k + 1 t k + 2 ) 2 2 ! + ( t 0 t k ) ( t k t k + 1 ) 2 2 ! ( t k + 1 t k + 3 ) + ( t 0 t k ) 2 2 ! ( t k t k + 2 ) ( t k + 2 t k + 3 ) ) + ( t 0 t k ) ( t k t k + 1 ) ( t k + 1 t k + 2 ) ( t k + 2 t k + 3 ) = ( t 0 t k ) n k ( n k ) ! + i 1 = k + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) n i 1 ( n i 1 ) ! + i 1 = k + 1 n 2 i 2 = i 1 + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) i 2 i 1 ( i 2 i 1 ) ! ( t i 1 t i 2 ) n i 2 ( n i 2 ) ! + i 1 = k + 1 n 3 i 2 = i 1 + 1 n 2 i 3 = i 2 + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) i 2 i 1 ( i 2 i 1 ) ! ( t i 1 t i 2 ) i 3 i 2 ( i 3 i 2 ) ! ( t i 2 t i 3 ) n i 3 ( n i 3 ) ! ( n = k + 4 )
The other p n k coefficients ( n > k + 4 ) are defined by the following general equation:
p n k = ( t 0 t k ) n k ( n k ) ! + i 1 = k + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) n i 1 ( n i 1 ) ! + i 1 = k + 1 n 2 i 2 = i 1 + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) i 2 i 1 ( i 2 i 1 ) ! ( t i 1 t i 2 ) n i 2 ( n i 2 ) ! + i 1 = k + 1 n 3 i 2 = i 1 + 1 n 2 i 3 = i 2 + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) i 2 i 1 ( i 2 i 1 ) ! ( t i 1 t i 2 ) i 3 i 2 ( i 3 i 2 ) ! ( t i 2 t i 3 ) n i 3 ( n i 3 ) ! + + i 1 = k + 1 n ( n k 1 ) i 2 = i 1 + 1 n ( n k 2 ) i n k 1 = i n k 2 + 1 n 1 ( t 0 t k ) i 1 k ( i 1 k ) ! ( t k t i 1 ) i 2 i 1 ( i 2 i 1 ) ! ( t i 1 t i 2 ) i 3 i 2 ( i 3 i 2 ) ! ( t i n k 2 t i n k 1 ) n i n k 1 ( n i n k 1 ) !
Assuming t i 1 t 0 ,   i 0 k , t i 0 t k , i j + 1 n , and t   i j + 1 t n , the coefficients p n k with n k + 2 can also be reduced to
p n k = ( t 0 t k ) n k ( n k ) ! + j = 1 n k 1 [ i 1 = k + 1 n j     i 2 = i 1 + 1 n j + 1 i j = i j 1 + 1 n 1 ( m = 0 j ( t i m 1 t i m ) i m + 1 i m ( i m + 1 i m ) ! ) ]
The Appendix displays the U-expansion with terms up to the 6th order and explicit expression of the p n k   coefficients (Equation (A1)).

2.6. A Specific Example of U-Expansion

In this section, we consider a specific type of U-expansion defined by the condition that the derivatives f ( n ) of f are detected at progressively earlier times t n as the derivative order n increases. Specifically, given an arbitrary time increment t > 0 , the time instants t n are defined by the following condition:
t n = t 0 n t                                 ( n = 1 ,   2 ,   )
Substitution of Equation (10) into Equations (6)–(9) yields
f ( t 0 + τ ) = f ( t 0 ) + n = 1 ( f ( n ) ( t 0 n t ) k = 1 n τ k k ! c n k t n k )
with the numerical coefficient c n k given by ( i 1 = 0 , i 0 = k ,   i j + 1 = n ) :
c n k = 1                                                                                                   ( k = n )
c n k = k = k ( n k ) ( n k ) !                                                             ( k = n 1 )
c n k = k n k ( n k ) ! + j = 1 n k 1 ( i 1 = k + 1 n j     i 2 = i 1 + 1 n j + 1 i j = i j 1 + 1 n 1 ( m = 0 j ( i m i m 1 ) i m + 1 i m ( i m + 1 i m ) ! ) )                                           ( k n 2 )
The numerical value of the c n k coefficients can be readily calculated from the above equations, yielding the final expression of the expansion reported in the Appendix, where terms up to the 9th-order time derivative have been included (Equation (A2)).
In the next section, the error related to the truncation of the U-expansions (Equation (A2)) will be calculated for different values of t and τ and for different orders of truncation n t , and will also be compared with the truncation error of the corresponding Taylor series ( t = 0 ).

3. Results

In the following, we assume that time, and consequently the time instant t 0 , and the time increments τ and t are normalized to an arbitrary time constant, so that they can be considered dimensionless quantities. Thus, consistency of notation with Equations (1)–(14) can be maintained in the Taylor series of the exponential and sine functions:
e t 0 + τ = e t 0 + e t 0 · τ 1 ! + e t 0 · τ 2 2 ! + e t 0 · τ 3 3 ! + e t 0 · τ 4 4 ! +
sin ( t 0 + τ ) = sin ( t 0 ) + cos ( t 0 ) · τ 1 ! sin ( t 0 ) · τ 2 2 ! cos ( t 0 ) · τ 3 3 ! + sin ( t 0 ) · τ 4 4 ! +
and in the corresponding U-expansions (11):
e t 0 + τ = e t 0 + e ( t 0 t ) τ 1 ! + e ( t 0 2 t ) [ τ 2 2 ! + ( t ) τ ] + e ( t 0 3 t ) [ τ 3 3 ! + ( 2 t ) τ 2 2 ! + ( 3 2 t 2 ) τ ] + e ( t 0 4 t ) [ τ 4 4 ! + ( 3 t ) τ 3 3 ! + ( 4 t 2 ) τ 2 2 ! + ( 8 3 t 3 ) τ ] +
sin ( t 0 + τ ) = sin ( t 0 ) + cos ( t 0 t ) · τ 1 ! sin ( t 0 2 t ) [ τ 2 2 ! + ( t ) τ ] cos ( t 0 3 t ) [ τ 3 3 ! + ( 2 t ) τ 2 2 ! + ( 3 2 t 2 ) τ ] + sin ( t 0 4 t ) [ τ 4 4 ! + ( 3 t ) τ 3 3 ! + ( 4 t 2 ) τ 2 2 ! + ( 8 3 t 3 ) τ ] +
Figure 1 and Figure 2 display, for different values of t ( t = 0.001 ,   0.01 ,   0.05 ,   0.1 ) and different orders of truncation n t ( n t = 2 ,   3 ,   4 ) , the dependence on the increment τ of the error ε U , n t related to the truncation of the exponential U-expansion (Equation (17)) about t 0 = 0 (Figure 1a and Figure 2a) and the sine U-expansion (Equation (18)) about t 0 = π / 4 (Figure 1b and Figure 2b). For comparison, the figures also display the error ε T , n t related to the truncation ( n t = 1 ,   2 ,   3 , 4 ) of the corresponding Taylor series expansions (15) and (16) about t 0 = 0 and t 0 = π / 4 , respectively.
For τ t , the error of the U-expansion is nearly coincident with the error of the corresponding Taylor series with the same order of truncation ( ε U , n t = ε T , n t ) , as long as t 0.001 (Figure 1). Conversely, with a gradual increase of t from 0.001 to 0.1, the error of the U-expansion becomes progressively higher than the error of the corresponding Taylor series with the same order of truncation ( ε U , n t > ε T , n t ) . However, still with t = 0 .01 and t = 0 .05, the error of the U-expansion truncated at order n t remains considerably smaller than the error of the corresponding Taylor series truncated at order n t 1 ( ε U , n t < ε T , n t 1 ) .
For τ t or τ < t , with a progressive decrease in τ and increase in t , the error ε U , n t tends to drift towards the error of the Taylor series truncated at progressively lower orders (Figure 2). For example, for the exponential function, ε U , 3 = ε T , 2 when t = τ = 0.05 , whereas ε U , 4 = ε T , 2 when t = 0.1 and τ = 0.05 (Figure 2a). Nevertheless, for small values of t ( t 0.01 ) and 0 < τ t , the error ε U , n t   becomes negligible, yet at the second-order n t of truncation ( ε U , n t is smaller than about 10−5, 10−7, and 10−9 for n t = 2 ,   3 , and 4, respectively). A nearly identical trend is displayed by the sine function (Figure 2b).

4. Discussion

We have derived a power series expansion (named the U-expansion) to predict the time evolution of a function f given the value f ( t 0 ) of the function at a time instant t 0 and the values f ( n ) ( t n ) of the derivatives f ( n ) of f at arbitrarily different times t n (n = 1, 2, …). The U-expansion can potentially constitute the analytical background for the development of numerical algorithms designed for the fast and accurate feedback control of nonlinear systems. This relies on the possibility that the controlled process variable f and its derivatives can be directly measured. Indeed, when only the controlled process variable f is recorded over time with a given sampling period T, all the derivatives f ( n ) can be estimated, at the same time instant t 0 and at any order of approximation, from the recorded values of the variable   f , by means of backward finite difference approximations [24]. The standard Taylor series (1) can then be used to estimate the f ( t 0 + τ ) value. However, the nth-order backward finite difference approximation to the nth-order derivative f ( n ) ( t 0 ) requires preventive recording of 2n values of the function f at times t 0   , t 0 T ,   t 0 2 T , …, t 0 ( 2 n 1 ) T . With this degree of approximation, prediction of the time evolution of the variable f can only be attained after a time lag ( 2 n 1 ) T . Moreover, further processing and delay is needed to avoid noise amplification due to differentiation.
The sensorimotor system is provided by a variety of different sensory receptors that can directly detect not only the intensity of a stimulus (slow-adapting receptors), but also its rate of change and the higher-order time derivatives (fast-adapting receptors). The slow-adapting receptors also exhibit the adaptation phenomenon: the continuous persistence of a constant stimulus is accompanied by a progressive decrease in the discharge frequency of the afferent sensory neuron. This reflects the fact that in nature, it is more important to feel the change of a condition rather than to be continuously informed that the condition has not changed. Direct measurement of higher-order derivatives, with no delay for their approximate computation, enables the sensorimotor system to make more accurate and fast predictions, and ultimately, optimal efferent responses acting with minimum latency. Nevertheless, the fundamental property of the central nervous system that only relevant sensory information (including higher-order derivatives) is readily transmitted to the integration and processing centers has the drawback that afferent information originating from different sensory receptors is not synchronized in time.
The U-expansion actually allows the prediction of the time evolution of a function from the values of the function and its time derivatives detected at different times, with no delay for computation. Thus, the U-expansion can be used to optimize the feedback control of a physiological parameter f, enabling, at the same time, a high degree of accuracy and the minimization of the latency of the control response. Ultimately, the U-expansion constitutes an unanalytical framework to simulate the fast and accurate prediction strategy of the sensorimotor system.
The U-expansion has been numerically applied to the ideal problem of the calculation of f ( t 0 + τ ) from the value f ( t 0 ) and the values of the derivatives f ( n ) detected at progressively earlier times t n = t 0 n t   ( t > 0 ) as the derivative order n increases ( n   =   1 ,   2 ,   ) . This particular case is of relevance when accurate values of lower-order derivatives may be retrieved earlier, compared to higher-order derivatives, which typically require a more demanding detection process. For sufficiently small values of t and increments of τ significantly greater than t , the error ε U , n t associated with the truncation of the U-expansion at a given order n t closely equalizes the error ε T , n t of the corresponding Taylor series ( t = 0 ) truncated at the same order (Figure 1). Small values of the t increment and higher values of the τ increment actually correspond to the high-frequency discharge of sensory neurons and the need for longer-term prediction, respectively. With a progressive increase in t , the error ε U , n t associated with the truncation of the U-expansion at order n t drifts towards the error of the corresponding Taylor series truncated at progressively lower orders (Figure 1 and Figure 2). Nevertheless, n t can be progressively increased to render ε U , n t equal to the error of the Taylor series truncated at a specific lower order, with no increase in the delay for the calculation of f ( t 0 + τ ) .
Although the previous findings have been derived for a particular regular set of detection times t n ( t n = t 0 n t ), they nevertheless have a broad validity. Indeed, the same findings also result from any arbitrary set of detection times t n , provided t represents the maximum value among the differences | t i t i 1 | ( i   =   1 ,   2 ,   ) relative to the detection times of two successive derivatives. Among these infinite sets of detection times, that defined by the selected condition ( t n = t 0 n t ) clearly corresponds to the most unfavorable condition for making predictions.
The present study provides a general analytical algorithm for the simulation of the fast prediction strategy of the sensorimotor system. Detailed neurophysiological models are needed when the specific organizational principles and coding mechanisms of the sensorimotor system are considered. Indeed, the incoming stream of sensory signals in the CNS is encoded as trains of action potentials; processed in stages in the sequential relay nuclei of the spinal cord, brain stem, thalamus, and cerebral cortex; and modulated by superspinal centers through descending pathways, according to its current (context-dependent) functional relevance [4,18,25,26]. The rigorous experimental investigation of the neuronal mechanisms underlying the fast prediction strategy of the sensorimotor system was beyond the scope of this study. Nonetheless, this study unveils, for the first time, a seminal plausible algorithm (U-expansion) that enables fast and accurate sensorimotor predictions and accounts for the experimental evidence that the sensory receptors can collectively sense the unsynchronized values of a physiological parameter and its time derivatives.

5. Conclusions

The U-expansion derived in this paper determines the time evolution of a physiological parameter from the value of the parameter and the values of its successive time derivatives detected at different times by different sensory receptors. This new series expansion constitutes a generalization of the Taylor series that potentially provides an analytical background for the study of the fast prediction strategies of the sensorimotor system, as well as for the development of numerical algorithms designed for the feedback control of nonlinear systems.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

The following equation constitutes the explicit expression of the U-expansion, including terms up to the 6th order:
f ( t 0 + τ ) = f ( t 0 ) + f ( 1 ) ( t 1 ) τ + f ( 2 ) ( t 2 ) { τ 2 2 ! + τ ( t 0 t 1 ) } + f ( 3 ) ( t 3 ) { τ 3 3 ! + τ 2 2 ! ( t 0 t 2 ) + τ [ ( t 0 t 1 ) 2 2 ! + ( t 0 t 1 ) ( t 1 t 2 ) ] } + f ( 4 ) ( t 4 ) { τ 4 4 ! + τ 3 3 ! ( t 0 t 3 ) + τ 2 2 ! [ ( t 0 t 2 ) 2 2 ! + ( t 0 t 2 ) ( t 2 t 3 ) ] + τ [ ( t 0 t 1 ) 3 3 ! + ( ( t 0 t 1 ) ( t 1 t 2 ) 2 2 ! + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) ) + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) ] } + f ( 5 ) ( t 5 ) { τ 5 5 ! + τ 4 4 ! ( t 0 t 4 ) + τ 3 3 ! [ ( t 0 t 3 ) 2 2 ! + ( t 0 t 3 ) ( t 3 t 4 ) ] + τ 2 2 ! [ ( t 0 t 2 ) 3 3 ! + ( ( t 0 t 2 ) ( t 2 t 3 ) 2 2 ! + ( t 0 t 2 ) 2 2 ! ( t 2 t 4 ) ) + ( t 0 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) ] + τ [ ( t 0 t 1 ) 4 4 ! + ( ( t 0 t 1 ) ( t 1 t 2 ) 3 3 ! + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) 2 2 ! + ( t 0 t 1 ) 3 3 ! ( t 1 t 4 ) ) + ( ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) 2 2 ! + ( t 0 t 1 ) ( t 1 t 2 ) 2 2 ! ( t 2 t 4 ) + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) ( t 3 t 4 ) ) + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) ] } + f ( 6 ) ( t 6 ) { τ 6 6 ! + τ 5 5 ! ( t 0 t 5 ) + τ 4 4 ! [ ( t 0 t 4 ) 2 2 ! + ( t 0 t 4 ) ( t 4 t 5 ) ] + τ 3 3 ! [ ( t 0 t 3 ) 3 3 ! + ( ( t 0 t 3 ) ( t 3 t 4 ) 2 2 + ( t 0 t 3 ) 2 2 ! ( t 3 t 5 ) ) + ( t 0 t 3 ) ( t 3 t 4 ) ( t 4 t 5 ) ] + τ 2 2 ! [ ( t 0 t 2 ) 4 4 ! + ( ( t 0 t 2 ) ( t 2 t 3 ) 3 3 ! + ( t 0 t 2 ) 2 2 ! ( t 2 t 4 ) 2 2 ! + ( t 0 t 2 ) 3 3 ! ( t 2 t 5 ) ) + ( ( t 0 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) 2 2 ! + ( t 0 t 2 ) ( t 2 t 3 ) 2 2 ! ( t 3 t 5 ) + ( t 0 t 2 ) 2 2 ! ( t 2 t 4 ) ( t 4 t 5 ) ) + ( t 0 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) ( t 4 t 5 ) ] + τ [ ( t 0 t 1 ) 5 5 ! + ( ( t 0 t 1 ) ( t 1 t 2 ) 4 4 ! + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) 3 3 ! + ( t 0 t 1 ) 3 3 ! ( t 1 t 4 ) 2 2 ! + ( t 0 t 1 ) 4 4 ! ( t 1 t 5 ) ) + ( ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) 3 3 ! + ( t 0 t 1 ) ( t 1 t 2 ) 2 2 ! ( t 2 t 4 ) 2 2 ! + ( t 0 t 1 ) ( t 1 t 2 ) 3 3 ! ( t 3 t 5 ) + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) ( t 3 t 4 ) 2 2 ! + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) 2 2 ! ( t 3 t 5 ) + ( t 0 t 1 ) 3 3 ! ( t 1 t 4 ) ( t 4 t 5 ) ) + ( ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) 2 2 ! + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) 2 2 ! ( t 3 t 5 ) + ( t 0 t 1 ) ( t 1 t 2 ) 2 2 ! ( t 2 t 4 ) ( t 4 t 5 ) + ( t 0 t 1 ) 2 2 ! ( t 1 t 3 ) ( t 3 t 4 ) ( t 4 t 5 ) ) + ( t 0 t 1 ) ( t 1 t 2 ) ( t 2 t 3 ) ( t 3 t 4 ) ( t 4 t 5 ) ] } +
Under the ideal condition that the derivatives f ( n ) are detected at regularly earlier times t n = t 0 n t as the derivative order n increases ( t > 0 ) , Equation (A1) becomes
f ( t 0 + τ ) = f ( t 0 ) + f ( 1 ) ( t 0 t ) τ + f ( 2 ) ( t 0 2 t ) [ τ 2 2 ! + ( t ) τ ] + f ( 3 ) ( t 0 3 t ) [ τ 3 3 ! + ( 2 t ) τ 2 2 ! + ( 3 2 t 2 ) τ ] + f ( 4 ) ( t 0 4 t ) [ τ 4 4 ! + ( 3 t ) τ 3 3 ! + ( 4 t 2 ) τ 2 2 ! + ( 8 3 t 3 ) τ ] + f ( 5 ) ( t 0 5 t ) [ τ 5 5 ! + ( 4 t ) τ 4 4 ! + ( 15 2 t 2 ) τ 3 3 ! + ( 25 3 t 3 ) τ 2 2 ! + ( 125 24 t 4 ) τ ] + f ( 6 ) ( t 0 6 t ) [ τ 6 6 ! + ( 5 t ) τ 5 5 ! + ( 12 t 2 ) τ 4 4 ! + ( 18 t 3 ) τ 3 3 ! + ( 18 t 4 ) τ 2 2 ! + ( 54 4 t 5 ) τ ] + f ( 7 ) ( t 0 7 t ) [ τ 7 7 ! + ( 6 t ) τ 6 6 ! + ( 35 2 t 2 ) τ 5 5 ! + ( 98 3 t 3 ) τ 4 4 ! + ( 343 8 t 4 ) τ 3 3 ! + ( 2401 60 t 5 ) τ 2 2 ! + ( 16807 720 t 6 ) τ ] + f ( 8 ) ( t 0 8 t ) [ τ 8 8 ! + ( 7 t ) τ 7 7 ! + ( 24 t 2 ) τ 6 6 ! + ( 160 3 t 3 ) τ 5 5 ! + ( 256 3 t 4 ) τ 4 4 ! + ( 512 5 t 5 ) τ 3 3 ! + ( 4096 45 t 6 ) τ 2 2 ! + ( 16384 315 t 7 ) τ ] + f ( 9 ) ( t 0 9 t ) [ τ 9 9 ! + ( 8 t ) τ 8 8 ! + ( 63 2 t 2 ) τ 7 7 ! + ( 81 t 3 ) τ 6 6 ! + ( 1215 8 t 4 ) τ 5 5 ! + ( 2187 10 t 5 ) τ 4 4 ! + ( 19683 80 t 6 ) τ 3 3 ! + ( 59049 280 t 7 ) τ 2 2 ! + ( 531441 4480 t 8 ) τ ] +

References

  1. Cosentino, C.; Bates, D. Feedback Control in Systems Biology; CRC Press: Boca Raton, FL, USA, 2011; p. 1. [Google Scholar]
  2. Franklin, G.F.; Powell, J.D.; Emami-Naeini, A. Feedback Control of Dynamic Systems, 7th ed.; Pearson: New York, NY, USA, 2015; p. 21. [Google Scholar]
  3. Adams, R.A.; Shipp, S.; Friston, K.J. Predictions not commands: Active inference in the motor system. Brain Struct. Funct. 2012, 218, 611–643. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  4. Kandel, E.R. Principles of Neural Science, 5th ed.; McGraw-Hill: New York, NY, USA, 2013; pp. 472, 743–767, 797. [Google Scholar]
  5. Enoka, R.M. Neuromechanics of Human Movement; Human Kinetics: Champaign, IL, USA, 2015. [Google Scholar]
  6. Biscarini, A.; Contemori, S.; Busti, D.; Botti, F.M.; Pettorossi, V.E. Knee flexion with quadriceps cocontraction: A new therapeutic exercise for the early stage of ACL rehabilitation. J. Biomech. 2016, 49, 3855–3860. [Google Scholar] [CrossRef] [PubMed]
  7. Nava, J.; Kreinovich, V.; Restrepo, G.; Klein, D.J. Discrete Taylor series as a simple way to predict properties of chemical substances like benzenes and cubanes. J. Uncertain Syst. 2010, 4, 270–290. [Google Scholar]
  8. Carballido-Landeira, J.; Escribano, B. Nonlinear Dynamics in Biological Systems; Springer: London, UK, 2016. [Google Scholar]
  9. Biscarini, A.; Botti, F.M.; Pettorossi, V.E. Second-order correction to the classical doppler and eco-doppler formulas. Acta Acust. United Acust. 2014, 100, 816–822. [Google Scholar] [CrossRef]
  10. Hoffman, J.D.; Frankel, S. Numerical Methods for Engineers and Scientists; CRC Press: Boca Raton, FL, USA, 2018. [Google Scholar]
  11. Hangos, K.M.; Bokor, J.; Szederkényi, G. Analysis and Control of Nonlinear Process Systems; Springer: London, UK, 2004. [Google Scholar]
  12. Arfken, G. Taylor’s Expansion, Mathematical Methods for Physicists, 3rd ed.; Academic Press: Orlando, FL, USA, 1985; pp. 303–313. [Google Scholar]
  13. Whittaker, E.T.; Watson, G.N. Forms of the Remainder in Taylor’s Series: A Course in Modern Analysis, 4th ed.; Cambridge University Press: Cambridge, UK, 1990; pp. 95–96. [Google Scholar]
  14. Benson, A.J.; Spencer, M.B.; Stott, J.R. Thresholds for the detection of the direction of whole-body, linear movement in the horizontal plane. Aviat. Space Environ. Med. 1986, 57, 1088–1096. [Google Scholar] [PubMed]
  15. Riemann, B.L.; Lephart, S.M. The sensorimotor system, part I: The physiologic basis of functional joint stability. J. Athl. Train. 2002, 37, 71–79. [Google Scholar] [PubMed]
  16. Riemann, B.L.; Lephart, S.M. The sensorimotor system, part II: The role of proprioception in motor control and functional joint stability. J. Athl. Train. 2002, 37, 80–84. [Google Scholar] [PubMed]
  17. Jones, T.A.; Jones, S.M.; Vijayakumar, S.; Brugeaud, A.; Bothwell, M.; Chabbert, C. The adequate stimulus for mammalian linear vestibular evoked potentials (VsEPs). Hear. Res. 2011, 280, 133–140. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  18. Proske, U.; Gandevia, S.C. The proprioceptive senses: Their roles in signaling body shape, body position and movement, and muscle force. Physiol. Rev. 2012, 92, 1651–1697. [Google Scholar] [CrossRef] [PubMed]
  19. Willis, W.D. Sensory Mechanisms of the Spinal Cord; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013; p. 19. [Google Scholar]
  20. Loeb, G.E.; Brown, I.E.; Cheng, E.J. A hierarchical foundation for models of sensorimotor control. Exp. Brain Res. 1999, 126, 1–18. [Google Scholar] [CrossRef] [PubMed]
  21. Todorov, E. Optimality principles in sensorimotor control. Nat. Neurosci. 2004, 7, 907–915. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  22. Wolpert, D.M. Probabilistic models in human sensorimotor control. Hum. Mov. Sci. 2007, 26, 511–524. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  23. Franklin, D.W.; Wolpert, D.M. Computational mechanisms of sensorimotor control. Neuron 2011, 72, 425–442. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  24. Khan, I.R.; Ohba, R. Closed-form expressions for the finite difference approximations of first and higher derivatives based on Taylor series. J. Comput. Appl. Math. 1999, 107, 179–193. [Google Scholar] [CrossRef] [Green Version]
  25. Contemori, S.; Biscarini, A. Shoulder position sense in volleyball players with infraspinatus atrophy secondary to suprascapular nerve neuropathy. Scand. J. Med. Sci. Sports 2018, 28, 267–275. [Google Scholar] [CrossRef] [PubMed]
  26. Biscarini, A.; Benvenuti, P.; Botti, F.M.; Brunetti, A.; Brunetti, O.; Pettorossi, V.E. Voluntary enhanced contraction of hamstring muscles during open kinetic chain leg extension exercise: Its potential unloading effect on the anterior cruciate ligament. Am. J. Sports Med. 2014, 42, 2103–2112. [Google Scholar] [CrossRef] [PubMed]
Figure 1. (a) Dependence on the increment τ of the error ε U , n t related to the truncation of the U-expansion of e t 0 + τ (Equation (17)) for t 0 = 0 , different values of t ( t = 0.001 ,   0.01 ,   0.05 ,   0.1 ) , and different orders of truncation n t ( n t = 2 ,   3 ,   4 ) . The error ε T , n t related to the truncation ( n t = 1 ,   2 ,   3 , 4 ) of the corresponding Taylor series (Equation (15)) is also reported for comparison. (b) Dependence on the increment τ of the error ε U , n t related to the truncation of the U-expansion of sin ( t 0 + τ ) (Equation (18)) for t 0 = π / 4 , different values of t ( t = 0.001 ,   0.01 ,   0.05 ,   0.1 ) , and different orders of truncation n t ( n t = 2 ,   3 ,   4 ) . The error ε T , n t related to the truncation ( n t = 1 ,   2 ,   3 , 4 ) of the corresponding Taylor series (Equation (16)) is also reported for comparison. The error is defined as the difference between the exact value of the function and the value of the truncated series expansion.
Figure 1. (a) Dependence on the increment τ of the error ε U , n t related to the truncation of the U-expansion of e t 0 + τ (Equation (17)) for t 0 = 0 , different values of t ( t = 0.001 ,   0.01 ,   0.05 ,   0.1 ) , and different orders of truncation n t ( n t = 2 ,   3 ,   4 ) . The error ε T , n t related to the truncation ( n t = 1 ,   2 ,   3 , 4 ) of the corresponding Taylor series (Equation (15)) is also reported for comparison. (b) Dependence on the increment τ of the error ε U , n t related to the truncation of the U-expansion of sin ( t 0 + τ ) (Equation (18)) for t 0 = π / 4 , different values of t ( t = 0.001 ,   0.01 ,   0.05 ,   0.1 ) , and different orders of truncation n t ( n t = 2 ,   3 ,   4 ) . The error ε T , n t related to the truncation ( n t = 1 ,   2 ,   3 , 4 ) of the corresponding Taylor series (Equation (16)) is also reported for comparison. The error is defined as the difference between the exact value of the function and the value of the truncated series expansion.
Biomimetics 06 00014 g001
Figure 2. (a) Detail of Figure 1a in the range 0 < τ 0.2 ; (b) detail of Figure 1b in the range 0 < τ 0.3 .
Figure 2. (a) Detail of Figure 1a in the range 0 < τ 0.2 ; (b) detail of Figure 1b in the range 0 < τ 0.3 .
Biomimetics 06 00014 g002
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Biscarini, A. Simulating the Fast Prediction Strategy of the Sensorimotor System. Biomimetics 2021, 6, 14. https://0-doi-org.brum.beds.ac.uk/10.3390/biomimetics6010014

AMA Style

Biscarini A. Simulating the Fast Prediction Strategy of the Sensorimotor System. Biomimetics. 2021; 6(1):14. https://0-doi-org.brum.beds.ac.uk/10.3390/biomimetics6010014

Chicago/Turabian Style

Biscarini, Andrea. 2021. "Simulating the Fast Prediction Strategy of the Sensorimotor System" Biomimetics 6, no. 1: 14. https://0-doi-org.brum.beds.ac.uk/10.3390/biomimetics6010014

Article Metrics

Back to TopTop