Behavioral evidence for the hierarchical execution of sequential movements.
The 5 matches
- [1] § Methods › Simulation parameters ↔ paper_conf.py, lines 1–50 · score 0.62 · Lotka Volterra, paper conf, py, simulations, hierarchical
- [2] § Methods › Models › Via-point stochastic optimal control (vpSOC) ↔ single.py, lines 467–614 · score 0.62 · control matrix, optimal control, Kalman, Kt, filter, SOC
- [3] § Methods › Models › Dynamical system of an arm ↔ import_data.py, lines 45–136 · score 0.57 · low pass filter, arm model, motor, speed
- [4] § Methods › Simulation parameters ↔ paper_conf.py, lines 1–50 · score 0.56 · monitor_distance, monitor_sd, vpSOC, simulations, hierarchical, models
- [5] § Methods › Models › Via-point stochastic optimal control (vpSOC) ↔ single.py, lines 191–220 · score 0.52 · longer movements, weights, Todorov, noise, stochastic, optimal
Paper
Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
Python · 289 lines · 11 KB · CC-BY-4.0 · 2 matches
- """Configuration parameters for the manuscript.
- The first section comprises general parameters for fonts and colors, followed
- by the sign-flipping rules for halfway and transitional coarticulations.
- The second section are the figue-specific parameters for simulations with vpSOC
- and HiSeq. Here we list only those parameters that are crucial for the
- figures. All others are left as the default parameters that can be found in
- each model:
- 1. The base class for SOC can be found in models/single.py: SOC. Its default
- parameters are:
- def_pars = {'sigma_c': 0.3,
- 'p_scaling': 1,
- 'm': 1.0,
- 'omega_nu': 0.2, # Adapted for longer movements
- 'omega_f': 0.3, # Adapted for longer movements
- 'N': 5,
- 'M': 3,
- 'Nc': 1,
- 'tau1': 0.04,
- 'tau2': 0.04,
- 'delta': 0.01,
- 'sigma_s': 0.5,
- 'r': 1e-5, # Weight of the energy term for cost
- 'obs_noises': [0.02, 0.02, 1],
- 'dt': 0.01,
- 't_end': 1,
- 'add_noise': 1000, # Additive noise for dynamics
- }
- 2. The class for vpSOC can be found in models/hierarchical.py:vpSOC. Besides
- parameters pertaining to the experimental task (targets, sequences, etc.), as
- well as those from SOC (using the same default values), it introduces
- h_scaling. h_scaling and r are systematically changed for simulations and
- defined differently for each figure.
- 3. The HiSeq class can be found in models/hierarchical.py:HiSeq. It uses the
- parameters from SOC and vpSOC, with the same defaults. In addition, it
- introduces a number of parameters for the dynamical system (Lotka-Volterra
- equations) which are left unchanged throughout simulations. It also introduces
- the monitor_distance parameter, which determines how close to the target (the
- center of the target circle) a trajectory has to get before the next element of
- the sequence is triggered. Related, the monitor_sd parameter controls the speed
- with which new elements are activated. These are varied throughout simulations.
- """
- from itertools import product
- import numpy as np
- from src.model import hierarchical as hie
- ####################################################
- # ------- General configuration for plots -------
- ####################################################
- # Data stuff
- all_parts = np.arange(401, 421)
- hiseq_parts = np.array([402, 403, 404, 418, 413])
- # Plotting stuff
- subplot_label_font = {'size': 12}
- colors_seq = np.array([[150, 150, 255], [150, 0, 255], [0, 150, 255],
- [255, 150, 150], [255, 150, 0], [255, 0, 150]]) / 256
- colors_sin = np.array([[0, 0, 255], [255, 0, 0]]) / 256
- # Analysis parameters
- # Depending on the function (trajectory_variance vs trajvar_all_segments),
- # different rules apply.
- # Flipping sign for trajectory_variance
- flip_rule_trans = {(0, 'sequential'): -1,
- (3, 'sequential'): -1,
- (5, 'sequential'): -1}
- flip_rule_half = {(1, 'sequential'): -1,
- (2, 'sequential'): -1,
- (4, 'sequential'): -1} # Flips crosses for readability
- # Flipping signs for trajvar_all_segments
- flip_rule_all = {(0, 'sequential', 0): -1,
- (4, 'sequential', 0): -1,
- (0, 'sequential', 1): -1,
- (1, 'sequential', 1): -1,
- (2, 'sequential', 1): -1,
- (3, 'sequential', 1): -1,
- (4, 'sequential', 1): -1,
- (5, 'sequential', 1): -1,
- (5, 'sequential', 2): -1}
- # Models parameters
- ref_vpsoc = {'soc_pars': {'add_noise': 10_000},
- 't_end': 0.7,
- 'h_scaling': 1
- }
- ref_sims = {}
- ####################################################
- # ------- For Figures 2 and 3, with data -------
- ####################################################
- good_part = 404 # Participant A
- bad_part = 406 # Participant B
- ####################################################
- # --------- For Figure 4 and 5, classification -----
- ####################################################
- # Selected participants for the classification of trajectories:
- parts_hiseq_class = [412, 414]
- # Model parameters for vpSOC(3)
- _r_values = [1e-8, 5e-8, 1e-7, 2e-7, 3e-7, 4e-7, 5e-7, 6e-7, 8e-7, 1e-6,
- 1.2e-6, 2e-6, 3e-6, 5e-6, 8e-6, 1e-5, 5e-5]
- # _r_values = [1e-8, 1e-7]
- _h1 = [0.6, 1, 1.3, 1.7, 2, 18]
- _h2 = [1, 2, 18]
- _h3 = [5]
- vpsoc3_pars = {'r': _r_values,
- 'h': list(product(_h1, _h2, _h3))}
- # Model parameters for HiSeq simulations
- dd = 10 # Dummy value; unused by models but may be expected
- h_sec = 10
- hs = [1.1, 1.2, 1.5, 1.8]
- all_h = [np.array([[dd, dd], *[[h_prot, 20, 0]] * 6, *[[h_sec, dd]] * 3],
- dtype=object)
- for h_prot in hs]
- all_r = [1.0e-07, 5.0e-07, 7.0e-07, 9.0e-07, 1.0e-06, 1.2e-06, 1.5e-06,
- 1.8e-06, 2.0e-06, 2.2e-06, 2.5e-06, 3.0e-06, 4.0e-06, 5.0e-06,
- 6.0e-06, 7.0e-06, 8.0e-06, 1.0e-05, 2.0e-05, 3.0e-05, 5.0e-05,
- 1.0e-04, 5.0e-04, 1.0e-03]
- all_r = all_r[-2:]
- all_mondis = [0.1, 0.4, 0.5, 0.7, 1, 1.5, 2]
- # all_mondis = [0.05, 0.5, 2]
- hiseq_total = len(all_h) * len(all_r) * len(all_mondis)
- hiseq_parprod = enumerate(product(all_h, all_r, all_mondis))
- # # Other (fixed) Model parameters for HiSeq simulations
- # tau23 = 3
- # monitor_sd = 10
- # monitor_distance = 1.2
- # mondis_abs = False
- # transitions = [[0, 0], [0, 1], [1, 3], [3, 6], # all SOC
- # [0, 1, 3], # vpSOC(2) + SOC
- # [1, 3, 6]] # SOC + vpSOC(2)
- # # All seqs. are idmove 0, with three "models", repeated to make 6:
- # sequences = np.array([[0, 1, 2, 3], [0, 4, 3], [0, 1, 5]] * 2, dtype=object)
- # t_ends = 1.7 # [1, 1, 1, 1, 2, 2]
- # r = [1e-4]
- # soc_pars = {'r': r, 'add_noise': 10}
- # h_scalings = []
- # for ch1 in [10, 30, 50]:
- # h_scalings.append([[1], [1], [1], [1], [ch1, 1], [ch1, _h3[0]]])
- # hiseq_pars = {'tau23': tau23, 'monitor_sd': monitor_sd,
- # 'monitor_distance': monitor_distance, 'transitions': transitions,
- # 'sequences': sequences, 't_ends': t_ends, 'r': r,
- # 'h': h_scalings, 'soc_pars': soc_pars,
- # 'mondis_abs': mondis_abs}
- ####################################################
- ####################################################
- ############# Supplementary figures ################
- ####################################################
- ####################################################
- # Note that some of these are no longer used.
- ####################################################
- # --------- For Supp. Figure, cost of planning------
- ####################################################
- cost_num_targets = np.arange(1, 5)
- cost_durations = np.arange(0.5, 20, 0.5)
- cost_reps = 1000
- ####################################################
- # ------- For Figure 5, with vpSOC simulations -----
- ####################################################
- r_low_high = [4e-6, 8e-6]
- # For vpSOC(3):
- hs_first = np.array([0.9, 10])
- hs_second = np.array([1.5, 18])
- hs_third = np.array([15])
- hs_vpsoc3 = list(product(hs_first, hs_second, hs_third))
- # For vpSOC(2):
- hs_first = np.array([0.4, 3])
- hs_second = np.array([3])
- hs_vpsoc2 = list(product(hs_first, hs_second))
- ####################################################
- # ------- For Figure 8, with data and models -------
- ####################################################
- # Models and parameters
- hiseq_ts = np.array([1, 2, 1]) * 1
- tau23 = 3
- monitor_sd = 5
- monitor_distance = 30
- r_high = 2e-5
- r_low = 2e-7
- mods = {'vpSOC(3)+': (hie.vpSOC,
- [{'h_scaling': [15, 15, 6],
- 't_ends': 1.6,
- 'soc_pars': {'add_noise': 0,
- 'r': r_high}},
- {'h_scaling': [6, 10, 15],
- 't_ends': 1.6,
- 'soc_pars': {'add_noise': 0,
- 'r': r_high}},
- {'h_scaling': [2, 8, 15],
- 't_ends': 1.6,
- 'soc_pars': {'add_noise': 0,
- 'r': r_high}},
- ]
- ),
- 'vpSOC(3)-': [hie.vpSOC,
- [{'h_scaling': [1, 7, 15],
- 't_ends': 1.6,
- 'soc_pars': {'add_noise': 8_000,
- 'r': r_low}
- },
- {'h_scaling': [1, 7, 15],
- 't_ends': 1.6,
- 'soc_pars': {'add_noise': 0,
- 'r': r_low}
- },
- {'h_scaling': [1, 7, 15],
- 't_ends': 1.6,
- 'soc_pars': {'add_noise': 0,
- 'r': r_low}
- },
- ]
- ],
- 'HiSeq (vpSOC(2)+vpSOC(1))': [hie.HiSeq,
- [{'transitions': [[0, 0], [0, 1, 3], [3, 6]],
- 'sequences': [[0, 1, 2]] * 6,
- 't_ends': hiseq_ts, # TODO: fix this
- 'h_scaling': 5,
- 'tau23': tau23,
- 'monitor_sd': monitor_sd,
- 'monitor_distance': monitor_distance,
- 'soc_pars': {'add_noise': 90,
- 'r': 5e-5}},
- {'transitions': [[0, 0], [0, 1, 4], [4, 6]],
- 'sequences': [[0, 1, 2]] * 6,
- 't_ends': hiseq_ts, # TODO: fix this
- 'h_scaling': np.array([[1, 1], [15, 3],
- [2, 1]]),
- 'tau23': tau23,
- 'monitor_sd': monitor_sd,
- 'monitor_distance': monitor_distance,
- 'soc_pars': {'add_noise': 90,
- 'r': 5e-5}},
- {'transitions': [[0, 0], [0, 2, 3], [3, 6]],
- 'sequences': [[0, 1, 2]] * 6,
- 't_ends': hiseq_ts, # TODO: fix this
- 'h_scaling': np.array([10, 5]),
- 'tau23': tau23,
- 'monitor_sd': monitor_sd,
- 'monitor_distance': monitor_distance,
- 'soc_pars': {'add_noise': 90,
- 'r': 5e-5}},
- ]
- ]
- }
- # Selected participant data (part, id_move)
- example_trajs = {'vpSOC(3)+': [(406, 0),
- (414, 2),
- (420, 3)],
- 'vpSOC(3)-': [(413, 0),
- (413, 2),
- (413, 3)],
- 'HiSeq (vpSOC(2)+vpSOC(1))': [(418, 0),
- (403, 2),
- (412, 3)]
- }
paper_conf.py, under CC-BY-4.0 · at the source
Overview
- Faculty of Psychology, Technische Universität Dresden,Dresden, Germany
- Centre for Tactile Internet with Human-in-the-Loop (CeTI),Dresden, Germany
Abstract
Movements in humans and other animals are known to be hierarchically organized, with simple movements forming the building blocks to more complex, sequential movements, a phenomenon often referred to as chunking. Neuroimaging studies have highlighted this layered structure, implicating the primary motor cortex in simple movements, and pre-motor and parietal areas in sequences of movements. Behavioral experiments designed to study this hierarchy have required extensive training of simple movement sequences, such as key presses, using error rates and reaction times as indirect markers of chunking. In this work, we provide kinematic evidence that the hierarchical organization of movements naturally emerges during reaching movements toward large targets, without the need for extensive training. Through model-based analyses of the observed trajectories’ geometry in a sequential pointing task (N = 20 participants), we infer the underlying hierarchy of the mechanism guiding movement generation. Our results show that most participants adapt their strategy dynamically using hierarchical planning, depending on the sequence. These findings offer insights into the process of chunking, as well as the conditions on how and when humans switch between flat and hierarchical planning during movement.
Reproduced under the paper's license (CC BY), from the paper cited above.
Repository
Its files are read in the Code ↔ Paper reader above, with 5 matches between paragraphs and lines of code.
figshare 31169632
Availability: 1 check, the latest on 30 September 2026: the link answers (HTTP 200)
- 30 September 2026: the link answers (HTTP 200)
22 files
- __init__.py, Python, 1 line
- analyses.py, Python, 1,356 lines
- config_sound.py, Python, 68 lines
- example_advanced.py, Python, 72 lines
- figures.py, Python, 614 lines
- hierarchical.py, Python, 1,494 lines
- import_data.py, Python, 630 lines, 1 match
- main.py, Python, 903 lines
- make_sounds.py, Python, 53 lines
- paper_conf.py, Python, 289 lines, 2 matches
- parameters.py, Python, 6 lines
- plot.py, Python, 492 lines
- results.py, Python, 158 lines
- simulations.py, Python, 405 lines
- single.py, Python, 964 lines, 2 matches
- statistics.py, Python, 542 lines
- supp_figs.py, Python, 385 lines
- test_asyncio.py, Python, 52 lines
- test_experiment.py, Python, 283 lines
- tests.py, Python, 261 lines
- utils.py, Python, 259 lines
- README.md, Text, 160 lines
Code availability
The code used to generate the figures and results in this work can be found in an online repository (link to repository (https://
Reproduced under the paper's license (CC BY), from the paper cited above.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 21 scripts, each with its path and the digest of its content;
- 5 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
Datasets cited
- figshare:31188148, at figshare; found in “Data availability”
Data availability
The raw behavioral data were published in an online repository (link to repository (https://
Reproduced under the paper's license (CC BY), from the paper cited above.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 1, 30 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 2 authors, 3 keywords, 53 references.
Cite
This paper
Cuevas Rivera, D., & Kiebel, S. J. (2026). Behavioral evidence for the hierarchical execution of sequential movements. Communications psychology, 4(1), 52. https://
BibTeX
@article{cuevasrivera202
author = {Cuevas Rivera, Darío and Kiebel, Stefan J.},
title = {{Behavioral evidence for the hierarchical execution of sequential movements}},
journal = {Communications psychology},
year = {2026},
month = mar,
volume = {4},
number = {1},
pages = {52},
publisher = {Nature Publishing Group},
issn = {2731-9121},
doi = {10.1038/
url = {https://
pmid = {41807720},
pmcid = {PMC13009195}
}
RIS
TY - JOUR
AU - Cuevas Rivera, Darío
AU - Kiebel, Stefan J.
TI - Behavioral evidence for the hierarchical execution of sequential movements
T2 - Communications psychology
J2 - Commun Psychol
PY - 2026
DA - 2026/
VL - 4
IS - 1
SP - 52
SN - 2731-9121
PB - Nature Publishing Group
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "Behavioral evidence for the hierarchical execution of sequential movements",
"container-title": "Communications psychology",
"author": [
{
"family": "Cuevas Rivera",
"given": "Darío"
},
{
"family": "Kiebel",
"given": "Stefan J."
}
],
"container-title-short":
"volume": "4",
"issue": "1",
"page": "52",
"DOI": "10.1038/
"PMID": "41807720",
"PMCID": "PMC13009195",
"ISSN": "2731-9121",
"publisher": "Nature Publishing Group",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
3,
11
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.1002/hbm.70562 [code]
- Distinct Physiological Mechanisms Drive Grey Matter Plasticity in Complex Versus Simple Sequence Learning.Journal: Human brain mappingIn common: seaborn, pandas, SciPy, 2 other tools, 5 references
- [2] doi:10.1167/jov.26.8.4 [code]
- The neural processes of illusory occlusion in object recognition.Journal: Journal of visionIn common: PsychoPy, seaborn, pandas, 3 other tools, 1 reference
- [3] doi:10.1038/s41598-026-53525-0 [code]
- Timing-induced illusory percepts of pitch.Journal: Scientific reportsIn common: PsychoPy, seaborn, pandas, 3 other tools, 1 reference
- [4] doi:10.34133/csbj.0042 [code]
- Using Steady-State Visual Evoked Potentials to Characterize Wide-Ranging Retinopathy Linked to &
lt;i& gt;CRB1& lt;/ i& gt;: Implications for Clinical Trials. Journal: Computational and structural biotechnology journalIn common: PsychoPy, seaborn, pandas, 3 other tools, 1 reference - [5] doi:10.1162/nol.a.271 [code]
- Compositional Complexity in Text and Images.Journal: Neurobiology of language (Cambridge, Mass.)In common: PsychoPy, seaborn, pandas, 3 other tools, 1 reference
- [6] doi:10.3390/biomimetics11080569 [code]
- Pretraining of Embodied Recurrent Networks Bridges the Gap Between Artificial and Cortical Neural Activities.Journal: Biomimetics (Basel, Switzerland)In common: SciPy, Matplotlib, NumPy, 3 references
- [7] doi:10.7554/elife.111876 [code]
- Distinct sensorimotor encoding in tuft dendrites and somata associated with action, correction, and learning.Journal: eLifeIn common: seaborn, pandas, SciPy, 2 other tools, 2 references
- [8] doi:10.1016/j.dcn.2026.101791 [code]
- Age-related differences in hippocampal network engagement during safety processing in adolescents.Journal: Developmental cognitive neuroscienceIn common: PsychoPy, seaborn, pandas, 3 other tools
- [9] doi:10.1038/s41467-026-73865-9 [code]
- Histamine shapes the neurocomputational dynamics of human learning.Journal: Nature communicationsIn common: PsychoPy, seaborn, pandas, 3 other tools
- [10] doi:10.1038/s41598-026-50946-9 [code]
- Fixation-related potentials reveal that confusing program code elicits a late frontal positivity.Journal: Scientific reportsIn common: PsychoPy, seaborn, pandas, 3 other tools
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 1 repository of the authors' code, each at its verified commit and with its license, 21 scripts, and 5 matches between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:297529a0bef219c3…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[.
Discussion, reproductions, activity
Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.
Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
