Related Experiment Video
Updated: Feb 16, 2026

06:04
Experimental Investigation of the Hierarchical Control in DC Microgrids Using a Real-time Simulator
Published on: February 14, 2025
1.1K
Submovement control processes in discrete aiming as a function of space-time constraints
Tsung-Yu Hsieh1, Yeou-Teh Liu1, Karl M Newell2
1National Taiwan Normal University, Taipei, Taiwan.
Plos One
|December 28, 2017
Summary
Movement control strategies adapt to task demands. Slower aiming movements utilize more post-peak submovements, while faster movements show more overshoots, demonstrating distinct control processes.
Area of Science:
- Motor Control
- Human Movement Science
- Biomechanics
Background:
- Submovements in aiming tasks suggest different control processes and task constraint influences.
- Understanding these submovements is key to deciphering motor control strategies.
Purpose of the Study:
- To investigate how movement space and time constraints affect submovement characteristics in discrete aiming.
- To analyze the prevalence of different submovement types under varying task conditions.
Main Methods:
- Twelve participants performed a target-aiming task across 3 distances and 5 time conditions (15 total conditions, 100 trials each).
- Kinematic analysis of movement trajectories identified and quantified 5 types of submovements (none, pre-peak velocity, post-peak velocity, undershoot, overshoot).
Main Results:
- The total number of submovements increased under slower space-time conditions.
- Post-peak trajectory submovements were more prevalent than overshoot submovements in slower conditions.
- Overshoot submovements were more frequent in conditions demanding high average movement velocity and short durations.
Conclusions:
- Discrete aiming tasks exhibit distinct submovement distribution patterns.
- These patterns are modulated by average movement velocity, reflecting adaptive motor control processes to meet space-time task constraints.
Related Concept Videos
Discrete-time Fourier transform
1.2K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
1.2K
Basic Discrete Time Signals
747
The unit step sequence is defined as 1 for zero and positive values of the integer n. This sequence can be graphically displayed using a set of eight sample points, showing a step function starting from n=0 and remaining constant thereafter.
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
747
Discrete-Time Fourier Series
739
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
739
Transfer Function to State Space
820
State-space representation is a powerful tool for simulating physical systems on digital computers, necessitating the conversion of the transfer function into state-space form. Consider an nth-order linear differential equation with constant coefficients, like those encountered in an RLC circuit. The state variables are selected as the output and its n−1 derivatives. Differentiating these variables and substituting them back into the original equation produces the state equations.
In an RLC...
In an RLC...
820
State Space to Transfer Function
598
The conversion of state-space representation to a transfer function is a fundamental process in system analysis. It provides a method for transitioning from a time-domain description to a frequency-domain representation, which is crucial for simplifying the analysis and design of control systems.
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
598
BIBO stability of continuous and discrete -time systems
950
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
950

