找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Automatic Structural Synthesis and Creative Design of Mechanisms; Huafeng Ding,Wenjian Yang,Andrés Kecskeméthy Book 2022 The Editor(s) (if

[复制链接]
楼主: Weber-test
发表于 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 | 显示全部楼层
发表于 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.
发表于 2025-3-25 22:06:02 | 显示全部楼层
发表于 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.
发表于 2025-3-26 05:49:11 | 显示全部楼层
发表于 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 | 显示全部楼层
发表于 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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 03:25
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表