CafkNet: GNN-Empowered Forward Kinematic Modeling for Cable-Driven Parallel Robots

Cable-driven parallel robots (CDPRs) have gained significant attention due to their promising advantages. When deploying CDPRs in practice, the kinematic modeling is a key question. Unlike serial robots, CDPRs have a simple inverse kinematics problem but a complex forward kinematics (FK) issue. So, the development of accurate and efficient FK solvers has been a prominent research focus in CDPR applications. By observing the topology within CDPRs, in this paper, we propose a graph-based representation to model CDPRs and introduce CafkNet, a fast and general FK solving method, leveraging Graph Neural Network (GNN) to learn the topological structure and yield the real FK solutions with superior generality, high accuracy, and low time cost. CafkNet is extensively tested on 3D and 2D CDPRs in different configurations, both in simulators and real scenarios. The results demonstrate its ability to learn CDPRs' internal topology and accurately solve the FK problem. Then, the zero-shot generalization from one configuration to another is validated. Also, the sim2real gap can be bridged by CafkNet using both simulation and real-world data. To the best of our knowledge, it is the first study that employs the GNN to solve FK problem for CDPRs. Videos and codes are available at https://sites.google.com/view/cafknet/site.

Authors

Institutions

Publication Details

Published
2024-12-10
DOI
https://doi.org/10.1109/robio64047.2024.10907328
Citations
5
Primary Topic
Robotic Mechanisms and Dynamics
Type
article
Field-Weighted Citation Impact
1.64
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CafkNet: GNN-Empowered Forward Kinematic Modeling for Cable-Driven Parallel Robots

Liming Jiang, Zeqing Zhang, Jia Pan, Linhan Yang et al.
5 citations
Robotic Mechanisms and Dynamics
1.64
article

CafkNet: GNN-Empowered Forward Kinematic Modeling for Cable-Driven Parallel Robots

Liming Jiang, Zeqing Zhang, Jia Pan, Linhan Yang, Cong Sun, Weiwei Shang
article en
5 citations

Abstract

Cable-driven parallel robots (CDPRs) have gained significant attention due to their promising advantages. When deploying CDPRs in practice, the kinematic modeling is a key question. Unlike serial robots, CDPRs have a simple inverse kinematics problem but a complex forward kinematics (FK) issue. So, the development of accurate and efficient FK solvers has been a prominent research focus in CDPR applications. By observing the topology within CDPRs, in this paper, we propose a graph-based representation to model CDPRs and introduce CafkNet, a fast and general FK solving method, leveraging Graph Neural Network (GNN) to learn the topological structure and yield the real FK solutions with superior generality, high accuracy, and low time cost. CafkNet is extensively tested on 3D and 2D CDPRs in different configurations, both in simulators and real scenarios. The results demonstrate its ability to learn CDPRs' internal topology and accurately solve the FK problem. Then, the zero-shot generalization from one configuration to another is validated. Also, the sim2real gap can be bridged by CafkNet using both simulation and real-world data. To the best of our knowledge, it is the first study that employs the GNN to solve FK problem for CDPRs. Videos and codes are available at https://sites.google.com/view/cafknet/site.

University of Science and Technology of China (CN), Chinese University of Hong Kong (HK), University of Hong Kong (HK), Northeastern University (CN), Wuyi University (CN)
Openalex Percentile: Top 15%
Robotic Mechanisms and Dynamics
1.64
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.