PubMed Health⌕ Search

PubMed · 11411627

Quantitative examinations for multi joint arm trajectory planning--using a robust calculation algorithm of the minimum commanded torque change trajectory.

Abstract

In previous research, criteria based on optimal theories were examined to explain trajectory features in time and space in multi joint arm movement. Four criteria have been proposed. They were the minimum hand jerk criterion (by which a trajectory is planned in an extrinsic-kinematic space), the minimum angle jerk criterion (which is planned in an intrinsic-kinematic space), the minimum torque change criterion (where control objects are joint links; it is planned in an intrinsic-dynamic-mechanical space), and the minimum commanded torque change criterion (which is planned in an intrinsic space considering the arm and muscle dynamics). Which of these is proper as a criterion for trajectory planning in the central nervous system has been investigated by comparing predicted trajectories based on these criteria with previously measured trajectories. Optimal trajectories based on the two former criteria can be calculated analytically. In contrast, optimal trajectories based on the minimum commanded torque change criterion are difficult to be calculated, even with numerical methods. In some cases, they can be computed by a Newton-like method or a steepest descent method combined with a penalty method. However, for a realistic physical parameter range, the former becomes unstable quite often and the latter is unreliable about the optimality of the obtained solution. In this paper, we propose a new method to stably calculate optimal trajectories based on the minimum commanded torque change criterion. The method can obtain trajectories satisfying Euler-Poisson equations with a sufficiently high accuracy. In the method, a joint angle trajectory, which satisfies the boundary conditions strictly, is expressed by using orthogonal polynomials. The coefficients of the orthogonal polynomials are estimated by using a linear iterative calculation so as to satisfy the Euler-Poisson equations with a sufficiently high accuracy. In numerical experiments, we show that the optimal solution can be computed in a wide work space and can also be obtained in a short time compared with the previous methods. Finally, we perform supplementary examinations of the experiments by Nakano, Imamizu, Osu, Uno, Gomi, Yoshioka et al. (1999). Estimation of dynamic joint torques and trajectory formation from surface electromyography signals using a neural network model. Biological Cybernetics, 73, 291-300. Their experiments showed that the measured trajectory is the closest to the minimum commanded torque change trajectory by statistical examination of many point-to-point trajectories over a wide range in a horizontal and sagittal work space. We recalculated the minimum commanded torque change trajectory using the proposed method, and performed the same examinations as previous investigations. As a result, it could be reconfirmed that the measured trajectory is closest to the minimum commanded torque change trajectory previously reported.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Y Wada, Y Kaneko, E Nakano, R Osu, M Kawato. 2001. Quantitative examinations for multi joint arm trajectory planning--using a robust calculation algorithm of the minimum commanded torque change trajectory.. https://doi.org/10.1016/s0893-6080(01)00026-0

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

KEEP EXPLORING

Related citations

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↗

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↗

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↗