Avoiding spurious submovement decompositions: a globally optimal algorithm
From MaRDI portal
Publication:1889260
DOI10.1007/s00422-003-0428-4zbMath1105.92306OpenAlexW2060750170WikidataQ48579813 ScholiaQ48579813MaRDI QIDQ1889260
Publication date: 1 December 2004
Published in: Biological Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00422-003-0428-4
Related Items (6)
Avoiding spurious submovement decompositions. II: A scattershot algorithm ⋮ Parabolic movement primitives and cortical states: merging optimality with geometric invari\-ance ⋮ Movement Duration, Fitts's Law, and an Infinite-Horizon Optimal Feedback Control Model for Biological Motor Systems ⋮ Affine differential geometry and smoothness maximization as tools for identifying geometric movement primitives ⋮ Sustained sensorimotor control as intermittent decisions about prediction errors: computational framework and application to ground vehicle steering ⋮ Unnamed Item
This page was built for publication: Avoiding spurious submovement decompositions: a globally optimal algorithm
