Modern Manufacturing Engineering ›› 2024, Vol. 523 ›› Issue (4): 43-48.doi: 10.16731/j.cnki.1671-3133.2024.04.006

Previous Articles     Next Articles

Path planning of aviation harness based on joint point routing algorithm

WU Mingyu1, LEI Lu1, HUANG Huiping2, LIU Gongping2, QIAO Xiaoli1,3   

  1. 1 College Mechanical and Electrical Engineering,Changchun University of Science and Technology, Changchun 130022,China;
    2 AVIC Xi'an Aircraft Industry Group Co.,Ltd.,Xi'an 710089,China;
    3 Chongqing Research Institute,Changchun University of Science and Technology,Chongqing 401135,China
  • Received:2023-10-12 Online:2024-04-18 Published:2024-05-31

Abstract: Aiming at the problem of aviation cable path planning,a joint point routing algorithm with non-rasterization processing was proposed. The concept of ″baseline″ was introduced. Firstly,the initial joint point set was obtained by baseline and routing environment information,and the path planning problem was transformed into the optimal selection problem of joint point set. Then the redundant joint points were screened and optimized according to the obstacle information. Then,the set of joint points with redundant points removed was iteratively optimized,and joint points were added and deleted under the convergence condition of optimal path. Finally,the joint point was used as the routing path node to obtain the cable path. The experimental results show that the joint point routing algorithm can effectively reduce the bending times and cable length of cable routing,and the routing time is better.

Key words: path planning, joint point routing algorithm, screening optimization, iterative optimization

CLC Number: 

Copyright © Modern Manufacturing Engineering, All Rights Reserved.
Tel: 010-67126028 E-mail: 2645173083@qq.com
Powered by Beijing Magtech Co. Ltd