Automatic cable routing based on improved pathfinding algorithm and B-spline optimization for collision avoidance

Abstract With the recent growth of electrical and electronic systems such as electric vehicles, the demand for automatic cable routing for electrical wiring design is increasing. However, real industry use cases of automatic cable routing are still rare especially in three-dimensional design. In this study, we propose a new pathfinding algorithm, JPS–Theta*, which combines the existing pathfinding algorithms, Jump Point Search and Theta*, that is better suited for cable routing. In addition, we propose a B-spline optimization algorithm to create natural cable shapes while avoiding collisions. In the experiments, it was found that the proposed pathfinding algorithm complements the existing algorithms and is thought to be more suitable for the purpose of automatic cable routing. Additionally, ant colony optimization for continuous domains, a meta-heuristic algorithm, was successfully used for optimizing the B-spline to obtain cable shapes without collision. Lastly, as a case study, the proposed method was directly applied to the electrical panel design to show its effectiveness. We expect that the proposed method will be able to improve the efficiency and quality of electrical wiring design.

Authors

Institutions

Publication Details

Journal
Journal of Computational Design and Engineering
Published
2024-08-31
DOI
https://doi.org/10.1093/jcde/qwae085
Citations
6
Primary Topic
Railway Engineering and Dynamics
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Automatic cable routing based on improved pathfinding algorithm and B-spline optimization for collision avoidance

Soonjo Kwon, Byung Chul Kim, Soonhung Han, Kunchan Kim et al.
6 citations
Journal of Computational Design and Engineering
Railway Engineering and Dynamics
1.28
article

Automatic cable routing based on improved pathfinding algorithm and B-spline optimization for collision avoidance

Soonjo Kwon, Byung Chul Kim, Soonhung Han, Kunchan Kim, Jongguk Kim, Yeongjun Yoon
article en
6 citations

Abstract

Abstract With the recent growth of electrical and electronic systems such as electric vehicles, the demand for automatic cable routing for electrical wiring design is increasing. However, real industry use cases of automatic cable routing are still rare especially in three-dimensional design. In this study, we propose a new pathfinding algorithm, JPS–Theta*, which combines the existing pathfinding algorithms, Jump Point Search and Theta*, that is better suited for cable routing. In addition, we propose a B-spline optimization algorithm to create natural cable shapes while avoiding collisions. In the experiments, it was found that the proposed pathfinding algorithm complements the existing algorithms and is thought to be more suitable for the purpose of automatic cable routing. Additionally, ant colony optimization for continuous domains, a meta-heuristic algorithm, was successfully used for optimizing the B-spline to obtain cable shapes without collision. Lastly, as a case study, the proposed method was directly applied to the electrical panel design to show its effectiveness. We expect that the proposed method will be able to improve the efficiency and quality of electrical wiring design.

Journal of Computational Design and EngineeringVol. 11(5)
Kumoh National Institute of Technology (KR), Republic of Korea Army (KR), Korea University of Technology and Education (KR), Bucheon University (KR)
Industry, innovation and infrastructure
Openalex Percentile: Top 23%
Railway Engineering and Dynamics
1.28
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.