scholarly journals Kinematic Chains in Ski Jumping In-run Posture

2013 ◽  
Vol 39 (1) ◽  
pp. 67-73 ◽  
Author(s):  
Eva Janurová ◽  
Miroslav Janura ◽  
Lee Cabell ◽  
Zdeněk Svoboda ◽  
Ivan Vařeka ◽  
...  
Keyword(s):  
Kinematic Chain ◽  
Coefficient Of Determination ◽  
Ground Contact ◽  
Longitudinal Assessment ◽  
Joint Angles ◽  
World Cup ◽  
Kinematic Data ◽  
Kinematic Chains ◽  
Ski Jumping ◽  
Adjacent Segments

Abstract The concept of kinematic chains has been systematically applied to biological systems since the 1950s. The course of a ski jump can be characterized as a change between closed and open kinematic chains. The purpose of this study was to determine a relationship between adjacent segments within the ski jumper’s body’s kinematic chain during the in-run phase of the ski jump. The in-run positions of 267 elite male ski jumpers who participated in the FIS World Cup events in Innsbruck, Austria, between 1992 and 2001 were analyzed (656 jumps). Two-dimensional (2-D) kinematic data were collected from the bodies of the subjects. Relationships between adjacent segments of the kinematic chain in the ski jumper’s body at the in-run position are greater nearer the chain’s ground contact. The coefficient of determination between the ankle and knee joint angles is 0.67. Changes in the segments’ positions in the kinematic chain of the ski jumper’s body are stable during longitudinal assessment. Changes in shank and thigh positions, in the sense of increase or decrease, are the same.

Kinematic Characteristics of the Ski Jump Inrun: A 10-Year Longitudinal Study

2010 ◽  
Vol 26 (2) ◽  
pp. 196-204 ◽  
Author(s):  
Miroslav Janura ◽  
Lee Cabell ◽  
Milan Elfmark ◽  
František Vaverka
Keyword(s):  
Average Velocity ◽  
Joint Angles ◽  
Kinematic Parameters ◽  
Contributing Factors ◽  
World Cup ◽  
Kinematic Data ◽  
Straight Path ◽  
Body Segments ◽  
Ski Jumping ◽  
The World

The athlete’s inrun position affects the outcome for take-off in ski jumping. The purpose of this study was to examine the kinematic parameters between skiers’ adjacent body segments during their first straight path of the inrun. Elite ski jumpers participated in the study at the World Cup events in Innsbruck, Austria, during the years 1992 through 2001. A video image was taken at a right angle to the tracks of the K-110 (meter) jumping hill. Kinematic data were collected from the lower extremities and trunk of the athletes. Findings indicated that jumpers had diminished ankle and knee joint angles and increased trunk and hip angles over the 10 years. In recent years, the best athletes achieved a further length of their jumps, while they experienced slower inrun average velocity. These results are perhaps explained by several possible contributing factors, such as new technique of the jumper’s body kinematics, advancements in equipment technology, and somatotype of the jumpers.

scholarly journals A Recursive Algorithm for the Forward Kinematic Analysis of Robotic Systems Using Euler Angles

Robotics ◽  
2022 ◽  
Vol 11 (1) ◽  
pp. 15
Author(s):  
Fernando Gonçalves ◽  
Tiago Ribeiro ◽  
António Fernando Ribeiro ◽  
Gil Lopes ◽  
Paulo Flores
Keyword(s):  
Recursive Algorithm ◽  
Kinematic Chain ◽  
Robotic Systems ◽  
Mobile Manipulator ◽  
Euler Angles ◽  
Joint Angles ◽  
Main Research ◽  
Kinematic Chains ◽  
Research Fields ◽  
Forward Kinematic

Forward kinematics is one of the main research fields in robotics, where the goal is to obtain the position of a robot’s end-effector from its joint parameters. This work presents a method for achieving this using a recursive algorithm that builds a 3D computational model from the configuration of a robotic system. The orientation of the robot’s links is determined from the joint angles using Euler Angles and rotation matrices. Kinematic links are modeled sequentially, the properties of each link are defined by its geometry, the geometry of its predecessor in the kinematic chain, and the configuration of the joint between them. This makes this method ideal for tackling serial kinematic chains. The proposed method is advantageous due to its theoretical increase in computational efficiency, ease of implementation, and simple interpretation of the geometric operations. This method is tested and validated by modeling a human-inspired robotic mobile manipulator (CHARMIE) in Python.

Structure Based Grading of Kinematic Chains

2014 ◽  
Vol 575 ◽  
pp. 501-506 ◽  
Author(s):  
Shubhashis Sanyal ◽  
G.S. Bedi
Keyword(s):  
Structural Properties ◽  
Structural Property ◽  
Kinematic Chain ◽  
Degree Of Freedom ◽  
Kinematic Chains ◽  
Structural Differences ◽  
The Individual ◽  
Independent Loops

Kinematic chains differ due to the structural differences between them. The location of links, joints and loops differ in each kinematic chain to make it unique. Two similar kinematic chains will produce similar motion properties and hence are avoided. The performance of these kinematic chains also depends on the individual topology, i.e. the placement of its entities. In the present work an attempt has been made to compare a family of kinematic chains based on its structural properties. The method is based on identifying the chains structural property by using its JOINT LOOP connectivity table. Nomenclature J - Number of joints, F - Degree of freedom of the chain, N - Number of links, L - Number of basic loops (independent loops plus one peripheral loop).

Combined Graph Layout Algorithms for Automated Sketching of Kinematic Chains

2012 ◽  
Author(s):  
Martín A. Pucheta ◽  
Nicolás E. Ulrich ◽  
Alberto Cardona
Keyword(s):  
Computational Cost ◽  
Kinematic Chain ◽  
Initial Position ◽  
Graph Representation ◽  
Combinatorial Algorithms ◽  
Graph Layout ◽  
Kinematic Chains ◽  
Aesthetic Characteristics ◽  
Edge Crossings ◽  
Independent Loops

The graph layout problem arises frequently in the conceptual stage of mechanism design, specially in the enumeration process where a large number of topological solutions must be analyzed. Two main objectives of graph layout are the avoidance or minimization of edge crossings and the aesthetics. Edge crossings cannot be always avoided by force-directed algorithms since they reach a minimum of the energy in dependence with the initial position of the vertices, often randomly generated. Combinatorial algorithms based on the properties of the graph representation of the kinematic chain can be used to find an adequate initial position of the vertices with minimal edge crossings. To select an initial layout, the minimal independent loops of the graph can be drawn as circles followed by arcs, in all forms. The computational cost of this algorithm grows as factorial with the number of independent loops. This paper presents a combination of two algorithms: a combinatorial algorithm followed by a force-directed algorithm based on spring repulsion and electrical attraction, including a new concept of vertex-to-edge repulsion to improve aesthetics and minimize crossings. Atlases of graphs of complex kinematic chains are used to validate the results. The layouts obtained have good quality in terms of minimization of edge crossings and maximization of aesthetic characteristics.

A Novel Method for Constructing Multi-Mode Deployable Polyhedron Mechanisms Using Symmetric Spatial RRR Compositional Units

2018 ◽  
Author(s):  
Jieyu Wang ◽  
Xianwen Kong
Keyword(s):  
Kinematic Chain ◽  
Degree Of Freedom ◽  
Single Loop ◽  
Kinematic Chains ◽  
The Third ◽  
Motion Modes ◽  
3D Printed ◽  
Novel Method ◽  
Multi Mode ◽  
Motion Mode

A novel construction method is proposed to construct multimode deployable polyhedron mechanisms (DPMs) using symmetric spatial RRR compositional units, a serial kinematic chain in which the axes of the first and the third revolute (R) joints are perpendicular to the axis of the second R joint. Single-loop deployable linkages are first constructed using RRR units and are further assembled into polyhedron mechanisms by connecting single-loop kinematic chains using RRR units. The proposed mechanisms are over-constrained and can be deployed through two approaches. The prism mechanism constructed using two Bricard linkages and six RRR limbs has one degree-of-freedom (DOF). When removing three of the RRR limbs, the mechanism obtains one additional 1-DOF motion mode. The DPMs based on 8R and 10R linkages also have multiple modes, and several mechanisms are variable-DOF mechanisms. The DPMs can switch among different motion modes through transition positions. Prototypes are 3D-printed to verify the feasibility of the mechanisms.

scholarly journals Structural synthesis of plane kinematic chain inversions without detecting isomorphism

2021 ◽  
Vol 12 (2) ◽  
pp. 1061-1071
Author(s):  
Jinxi Chen ◽  
Jiejin Ding ◽  
Weiwei Hong ◽  
Rongjiang Cui
Keyword(s):  
Mechanism Design ◽  
Adjacency Matrix ◽  
Synthesis Method ◽  
Kinematic Chain ◽  
Degree Of Freedom ◽  
Synthesis Methods ◽  
Creative Design ◽  
Structural Synthesis ◽  
Kinematic Chains

Abstract. A plane kinematic chain inversion refers to a plane kinematic chain with one link fixed (assigned as the ground link). In the creative design of mechanisms, it is important to select proper ground links. The structural synthesis of plane kinematic chain inversions is helpful for improving the efficiency of mechanism design. However, the existing structural synthesis methods involve isomorphism detection, which is cumbersome. This paper proposes a simple and efficient structural synthesis method for plane kinematic chain inversions without detecting isomorphism. The fifth power of the adjacency matrix is applied to recognize similar vertices, and non-isomorphic kinematic chain inversions are directly derived according to non-similar vertices. This method is used to automatically synthesize 6-link 1-degree-of-freedom (DOF), 8-link 1-DOF, 8-link 3-DOF, 9-link 2-DOF, 9-link 4-DOF, 10-link 1-DOF, 10-link 3-DOF and 10-link 5-DOF plane kinematic chain inversions. All the synthesis results are consistent with those reported in literature. Our method is also suitable for other kinds of kinematic chains.

Structure Types Synthesis of Multiloop Spatial Kinematic Chains With General Variable Constraints

1998 ◽  
Author(s):  
Yufeng Luo ◽  
Tingli Yang ◽  
Ali Seireg
Keyword(s):  
Kinematic Chain ◽  
Structure Type ◽  
Type Synthesis ◽  
Kinematic Chains ◽  
Systematic Procedure ◽  
Independent Loops

Abstract A systematic procedure is presented for the structure type synthesis of multiloop spatial kinematic chains with general variable constraints in this paper. The parameters and the structure types of the contracted graphs and the branch chains used to synthesize such kinematic chains are given for kinematic chains with up to four independent loops. The assignments for the constraints values of all the loops in a kinematic chain are discussed. Using these as the basis, the structure types of the multiloop spatial kinematic chains with hybrid constraints could be synthesized.

An Efficient Algorithm for Finding Optimum Code Under the Condition of Incident Degree

1992 ◽  
Author(s):  
T. J. Jongsma ◽  
W. Zhang
Keyword(s):  
Computer Program ◽  
Efficient Algorithm ◽  
Kinematic Chain ◽  
Isomorphism Problem ◽  
Kinematic Chains ◽  
Adjacency Matrices ◽  
Set Up

Abstract This paper deals with the identification of kinematic chains. A kinematic chain can be represented by a weighed graph. The identification of kinematic chains is thereby transformed into the isomorphism problem of graph. When a computer program has to detect isomorphism between two graphs, the first step is to set up the corresponding connectivity matrices for each graph, which are adjacency matrices when considering adjacent vertices and the weighed edges between them. Because these adjacency matrices are dependent of the initial labelling, one can not conclude that the graphs differ when these matrices differ. The isomorphism problem needs an algorithm which is independent of the initial labelling. This paper provides such an algorithm.

PSEUDO PROBABILISTIC APPROACH TO TEST ISOMORPHISM AMONG KINEMATIC CHAINS

1997 ◽  
Vol 21 (2) ◽  
pp. 65-83 ◽  
Author(s):  
S. Shubhashis ◽  
M. Choubey ◽  
A.C. Rao
Keyword(s):  
Numerical Scheme ◽  
Degrees Of Freedom ◽  
Probabilistic Approach ◽  
Kinematic Chain ◽  
Single Degree Of Freedom ◽  
Reliable Test ◽  
Kinematic Chains ◽  
Single Degree ◽  
Unique Method ◽  
P Matrix

There is no dearth of methods to test isomorphism amongst kinematic chains. Search for a computationally easier, logically simple and unique method is still on. Present work is in quest of a reliable test to detect isomorphism among kinematic chains. Work presented here is more versatile as it incorporates more features of the kinematic chain which were not included earlier such as number and type of links, their relative dispositions in the kinematic chain, nature of adjacent links etc. The method proposed is based on the concept of pseudo-probability (pseudo means it appears to be, but not exactly. The approach does not follow in-toto the principles of probability and considerable liberty has been taken in interpreting the word probability hence the word pseudo is used along with the probability schemes). Using the resemblance of different coloured balls in an urn for the number and type of links in a kinematic chain, a matrix (named P-Matrix) representing the kinematic chain in totality is generated. For the sake of comparison a numerical scheme named, pseudo probability scheme, P-Scheme, is developed from the above P-Matrix and is used for testing isomorphism. In fact the method is more powerful in the sense that each row of the proposed P-Matrix is capable of representing the respective kinematic chain distinctly and can be used to compare the kinematic chains with same link assortments, uniquely. The proposed method, besides possessing the potential of testing the isomorphism among simple-joint, single degree of freedom kinematic chains is also capable of multi degrees of freedom and multiple-joint kinematic chains.

Identification of kinematic chains and distinct mechanisms using extended adjacency matrix

2007 ◽  
Vol 221 (1) ◽  
pp. 81-88 ◽  
Author(s):  
A Mohammad ◽  
R A Khan ◽  
V P Agrawal
Keyword(s):  
Adjacency Matrix ◽  
Kinematic Chain ◽  
Theoretic Approach ◽  
Kinematic Chains ◽  
Graph Theoretic ◽  
The Past ◽  
Graph Theoretic Approach ◽  
The Family ◽  
Eigen Value ◽  
Eigen Values

Development of the methods for generating distinct mechanisms derived from a given family of kinematic chains has been persued by a number of researchers in the past, as the distinct kinematic structures provide distinct performance characteristics. A new method is proposed to identify the distinct mechanisms derived from a given kinematic chain in this paper. Kinematic chains and their derived mechanisms are represented in the form of an extended adjacency matrix [EA] using the graph theoretic approach. Two structural invariants derived from the eigen spectrum of the [EA] matrix are the sum of absolute eigen values EA∑ and maximum absolute eigen value EAmax. These invariants are used as the composite identification number of a kinematic chain and mechanism and are tested to identify the all-distinct mechanisms derived from the family of 1-F kinematic chains up to 10 links. The identification of distinct kinematic chains and their mechanisms is necessary to select the best possible mechanism for the specified task at the conceptual stage of design.

Sign in / Sign up

Export Citation Format

Share Document