China Mechanical Engineering ›› 2026, Vol. 37 ›› Issue (8): 1947-1955.DOI: 10.3969/j.issn.1004-132X.2026.08.014

Previous Articles     Next Articles

Automatic Sketching of Kinematic Chain Topology Graphs Based on Optimized Branch-chain Matrices

XUE Yu, SUN Liangbo(), ZHANG Bohou, ZHOU Huaxi, WANG Xiaoyi   

  1. School of Mechanical Engineering,Wuhan Polytechnic University,Wuhan,430023
  • Received:2025-05-12 Online:2026-08-25 Published:2026-09-17
  • Contact: SUN Liangbo

基于优化支链矩阵的运动链拓扑图自动绘制

薛钰, 孙亮波(), 张博厚, 周华西, 王晓艺   

  1. 武汉轻工大学机械工程学院, 武汉, 430023
  • 通讯作者: 孙亮波
  • 作者简介:薛 钰,女,1999年生,硕士研究生。研究方向为机构型综合。
  • 基金资助:
    国家自然科学基金(51875418);湖北省自然科学基金(2025AFB126);湖北省自然科学基金(2025AFC004)

Abstract:

This paper presents a novel method for the automatic plotting of kinematic chain topological graphs, based on an optimally arranged branch-chain matrix. The structural information of a kinematic chain is first represented using a dendrogram. Branch chains are then extracted according to the connectivity of components and multiple joints, forming a branch-chain matrix. To minimize or eliminate crossings in the final graph, the row order of this matrix is optimized using the concept of intimacy between branch chains and the corresponding crossover-determination theorem, yielding an optimized branch-chain matrix with no or minimal crossings. Subsequently, a bicolored topological graph with minimal or no crossings is generated through a series of operations, including deletion of duplicate elements, element repositioning, insertion of new columns, and element translation. Case studies and comparative analyses demonstrate that the proposed method provides clear procedural rules and preserves distinct loop information. The method effectively resolves line-crossing issues and enables direct generation of topological graphs from the optimized branch-chain matrix.

Key words: topological graph sketching, optimized branch-chain matrix, intimacy, crossover determination

摘要:

提出了一种基于优化排列的支链矩阵进行运动链拓扑图连线绘制的新方法。利用树状结构图描述运动链结构信息,根据各构件及复铰的连接关系分离出各支链,生成支链矩阵。运用支链间的亲密度概念和对应的图的交叉判定定理进行支链矩阵的行排列优化,获得无交叉或最少交叉的优化支链矩阵。在此基础上,通过删除重复元素、调整元素位置、新增列和元素平移等操作,生成无交叉或最少交叉的双色拓扑图。案例分析和对比结果表明,所提绘制方法规则简单、环路信息清晰,能有效解决线条交叉问题,并可直接在优化支链矩阵的基础上生成运动链拓扑图。

关键词: 拓扑图绘制, 优化支链矩阵, 亲密度, 交叉判定

CLC Number: