爱管闲事
发表于 2025-3-25 03:51:56
https://doi.org/10.1057/9781137400826An automatic method is presented to generate non-isomorphic inversions from the atlas of planar non-fractionated simple joint kinematic chains. A complete set of inversions of planar non-fractionated simple joint kinematic chain with up to 19 links are automatically synthesized.
范围广
发表于 2025-3-25 11:29:52
https://doi.org/10.1007/978-1-4612-4368-7An automatic method is presented to synthesize planar kinematic chains with prismatic pairs. A new algorithm based on the parameters of degree, weight, degree-sequence and weight-sequence is developed to resolve the key isomorphism problem. Kinematic chains with prismatic pairs and with up to 14 links are synthesized.
松紧带
发表于 2025-3-25 13:06:50
http://reply.papertrans.cn/17/1665/166453/166453_23.png
得罪人
发表于 2025-3-25 18:02:24
Basic Concepts of Graphs of Kinematic ChainsSome fundamental concepts of graph theory that are necessary for the structurual analysis and synthesis of kinematic chains and mechanisms are introduced.
SLAY
发表于 2025-3-25 22:06:02
http://reply.papertrans.cn/17/1665/166453/166453_25.png
notice
发表于 2025-3-26 00:53:13
Unified Isomorphism Detection for Planar Kinematic ChainsA unified isomorphism detection method that is suitable for simple joint kinematic chains, mimple joint kinematic chains and planetary gear trains is developed.
Infant
发表于 2025-3-26 05:49:11
http://reply.papertrans.cn/17/1665/166453/166453_27.png
诙谐
发表于 2025-3-26 09:56:00
Structural Synthesis of Contracted Graphs of Kinematic ChainsThe relationships between the contracted graphs of planar kinematic chains are revealed first. Then a fully-automatic method is proposed to synthesize the whole family of contracted graphs for planar non-fractionated kinematic chains with all possible DOFs.
骚动
发表于 2025-3-26 15:12:01
http://reply.papertrans.cn/17/1665/166453/166453_29.png
Original
发表于 2025-3-26 18:47:45
Automatic Sketching of Planar Kinematic ChainsA method for the automatic sketching of kinematic chains is presented. First, a layout algorithm based on the move of inner edges is proposed to determine the optimal layouts of topological graphs. Then, these topological graphs are automatically converted into the corresponding kinematic chains via a correction algorithm.