A model for learning human reaching movements.

A Karniel; G F Inbar

doi:10.1007/s004220050378

Home/Archive/PubMed

PubMed · 9352631

A model for learning human reaching movements.

A Karniel·G F Inbar

View original source ↗Export metadata ↓

Abstract

Reaching movement is a fast movement towards a given target. The main characteristics of such a movement are straight path and a bell-shaped speed profile. In this work a mathematical model for the control of the human arm during ballistic reaching movements is presented. The model of the arm contains a 2 degrees of freedom planar manipulator, and a Hill-type, non-linear mechanical model of six muscles. The arm model is taken from the literature with minor changes. The nervous system is modeled as an adjustable pattern generator that creates the control signals to the muscles. The control signals in this model are rectangular pulses activated at various amplitudes and timings, that are determined according to the given target. These amplitudes and timings are the parameters that should be related to each target and initial conditions in the work-space. The model of the nervous system consists of an artificial neural net that maps any given target to the parameter space of the pattern generator. In order to train this net, the nervous system model includes a sensitivity model that transforms the error from the arm end-point coordinates to the parameter coordinates. The error is assessed only at the termination of the movement from knowledge of the results. The role of the non-linearity in the muscle model and the performance of the learning scheme are analysed, illustrated in simulations and discussed. The results of the present study demonstrate the central nervous system's (CNS) ability to generate typical reaching movements with a simple feedforward controller that controls only the timing and amplitude of rectangular excitation pulses to the muscles and adjusts these parameters based on knowledge of the results. In this scheme, which is based on the adjustment of only a few parameters instead of the whole trajectory, the dimension of the control problem is reduced significantly. It is shown that the non-linear properties of the muscles are essential to achieve this simple control. This conclusion agrees with the general concept that motor control is the result of an interaction between the nervous system and the musculoskeletal dynamics.

Explore related subjects

Algorithms Arm Biomechanical Phenomena Central Nervous System Cybernetics Humans Joints Learning Models, Biological Movement Muscle, Skeletal Nonlinear Dynamics Journal Article

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

A Karniel, G F Inbar. 1997. A model for learning human reaching movements.. https://doi.org/10.1007/s004220050378

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2026

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

PubMed2026

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

PubMed2026

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗