Scholarlink

In computer networks, Dijkstra’s algorithm is applied to find the shortest route from one node to all other nodes. K-NN is a supervised machine learning algorithm which can be used for classification of similar characteristic elements of a given population. In the present work, both the above algorithms are applied sequentially on a kinematic chain. Initially a kinematic chain is converted as a graph. Any kinematic chain can be shown as a network graph converting links as nodes and connections as paths. Dijkstra’s algorithm is used to find the shortest paths from one node to another node. After that k-NN algorithm is applied to form the Clusters of Nodes (links) to classify the kinematic links into similar characteristic groups (same class) which are eventually called as ‘Inversions’. Results for 8-link 1-dof k-chains are analyzed and presented. The same concept can be extended for higher linkages and dof, i.e., 9-link 1-dof, 10-link 1-dof, 10-link 3-dof etc.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Hybrid Machine Learning Approach to Find Inversions of Planar Kinematic Chains

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Vinjamuri Venkata Kamesh,
  • Masina Venkata Rajesh

摘要

In computer networks, Dijkstra’s algorithm is applied to find the shortest route from one node to all other nodes. K-NN is a supervised machine learning algorithm which can be used for classification of similar characteristic elements of a given population. In the present work, both the above algorithms are applied sequentially on a kinematic chain. Initially a kinematic chain is converted as a graph. Any kinematic chain can be shown as a network graph converting links as nodes and connections as paths. Dijkstra’s algorithm is used to find the shortest paths from one node to another node. After that k-NN algorithm is applied to form the Clusters of Nodes (links) to classify the kinematic links into similar characteristic groups (same class) which are eventually called as ‘Inversions’. Results for 8-link 1-dof k-chains are analyzed and presented. The same concept can be extended for higher linkages and dof, i.e., 9-link 1-dof, 10-link 1-dof, 10-link 3-dof etc.