This paper focuses on the algorithm design for essential grabbing parameters based on the segment filling insertion technique. The automatic segment filling insertion weaving loom made a breakthrough in recent years. The field of jacquard computer-aided design (CAD) algorithms for segment filling insertion has not yet been explored, and the parameters required for the weave of this process are significantly different from those in the normal filling insertion process. This study introduces an optimal path algorithm, which provides robust support for the calculation of automated grabbing parameters. The feasibility of the proposed optimal path algorithm is validated through simulation experiments, with implementation carried out in Python. The parameters derived from this algorithm are then used for 3D simulations and visualized in TexMind Viewer, thereby providing significant support for process design in textile manufacturing. The results of this research contribute to the advancement of the segment filling insertion technique and the innovative application of CAD technology in the textile industry.
ZhangYChengLD.The origin and heritage of Kesi technique. Adv Mater Res2013;
821: 382–386. doi:10.4028/www.scientific.net/AMR.821-822.382.
2.
LizhaoWLouhapensangCSevisetS. Study and design products from the cultural heritage of Nanjing Yunjin fabric. In: Proceedings of the 20th International Conference on Cultural Heritage and Design, Nanjing, China, 15–18 October 2022, paper no. 10520, p. 179. Nanjing: NJ Publishing.
3.
FortesDJLiYMouraA.Research on Chinese intangible cultural heritage: the case of Nanjing handmade brocade. Diálogos com a Arte – Revista de Arte, Cultura e Educação2022;
12: 105–112.
4.
LiQMaDL.Creative thinking on world cultural and natural heritage protection: declaration on silk culture protection. Adv Mater Res2011;
175: 549–553.
5.
HeZMayusohC.Research on the development strategy of Hainan Li brocade cultural and creative products. Humanities and Social Sciences Nakhonsawan Rajabhat University Academic Journal2024;
11: 198–216.
6.
FangJMaYLiY, et al. Design and development of urban cultural and creative products with segment filling insertion. In: Journal of Physics: Conference Series, International Conference on Urban Design and Innovation, Beijing, China, 15–17 July 2021, paper no. 012032, pp. 1–8. Bristol: IOP Publishing.
7.
LinWMengMWangJ, et al.
Digitizing and recovering the knowledge of traditional Chinese colour of the Nanjing brocade. SCIRES-IT2022;
12: 95–110.
8.
ChaiJCuiRNiuL.Study on the technological process and artistic characteristics of ancient Chinese Zhuanghua silk fabric. Fibres Textile East Eur2021;
29: 105–111. doi:10.5604/01.3001.0014.8237.
9.
SunYLiuZSilbermanJ, et al.
Fabric composition and wearability analysis of Zhuanghua. Fibres Textile East Eur2022;
30: 9–20. doi:10.2478/ftee-2022-0033.
10.
FanZZhouBZhangS, et al. Computer simulation of brocade based on modeling structures. In: Proceedings of the 7th Annual International Conference on CYBER Technology in Automation, Control, and Intelligent Systems (CYBER), Honolulu, HI, 31 July–4 August 2017, paper no. 0490, pp. 990–995. New York: IEEE.
11.
Abdel-FattahMS. ITMA technology: weaving and weaving preparation. Textile World, 20 January 2012, pp. 35–40.
12.
LiYZhangRWuJ, et al. Rapier loom and filling insertion method. Patent 201810336929.X, China, 2018.
13.
CaiZFangJMaY, et al.
Research and development of automatic segment filling insertion technology. Technol Textiles2021;
39: 20–23+43.
14.
FangJKyosevYLiY, et al. Simulation of the segment filling insertion fabrics at the yarn level. In: Proceedings of the 5th International Conference on Textile Engineering, Prague, Czech Republic, 15–17 March 2023, paper no. 023, pp. 24–29. Prague: Vlakna a Textil.
15.
KyosevY.Generalized geometric modeling of tubular and flat braided structures with arbitrary floating length and multiple filaments. Textile Res J2016;
86: 1270–1279. doi:10.1177/0040517515609261.
16.
GasparettoABoscariolPLanzuttiA, et al. Path planning and trajectory planning algorithms: a general overview. In: CarboneGGomez-BravoF (eds) Motion and operation planning of robotic systems: Background and practical approaches.
Berlin:
Springer, 2015, pp.3–27.
17.
AggarwalSKumarN.Path planning techniques for unmanned aerial vehicles: a review, solutions, and challenges. Comput Commun2020;
149: 270–299. doi:10.1016/j.comcom.2019.10.014.
18.
HwangJYKimJSLimSS, et al.
A fast path planning by path graph optimization. IEEE Trans Syst Man Cybern A Syst Hum2003;
33: 121–129.
19.
WarrenCW. Fast path planning using modified A* method. In: Proceedings of the IEEE International Conference on Robotics and Automation, San Francisco, CA, 8–13 April 1993, paper no. 1050, pp. 662–667. New York: IEEE.
FuBChenLZhouY, et al.
An improved A* algorithm for the industrial robot path planning with high success rate and short length. Rob Auton Syst2018;
106: 26–37. doi:10.1016/j.robot.2018.04.007.
WangLYangXChenZ, et al.
Application of the improved rapidly exploring random tree algorithm to an insect-like mobile robot in a narrow environment. Biomimetics2023;
8: 374. doi:10.3390/biomimetics8040374.
24.
FergusonDStentzA. The delayed D* algorithm for efficient path replanning. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, Barcelona, Spain, 18–22 April 2005, paper no. 2045, pp. 2045–2050. New York: IEEE.
25.
StentzA. The focussed D* algorithm for real-time replanning. In: Smith A (ed), Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, 20–25 August 1995, paper no. 1652, pp.1652–1659. San Francisco: Morgan Kaufmann.
26.
ElshamliAAbdullahHAAreibiS. Genetic algorithm for dynamic path planning. In: IEEE Canadian Conference on Electrical and Computer Engineering, Toronto, Canada, 2–5 May 2004, paper no. CCE04-1234, pp.677–680. New York: IEEE.
27.
LaminiCBenhlimaSElbekriA.Genetic algorithm based approach for autonomous mobile robot path planning. Procedia Comput Sci2018;
127: 180–189. doi:10.1016/j.procs.2018.01.113.
28.
FanDKShiP. Improvement of Dijkstra’s algorithm and its application in route planning. In: Proceedings of the IEEE 7th International Conference on Fuzzy Systems and Knowledge Discovery, Yantai, China, 10–12 August 2010, paper no. 978, pp.1901–1904. New York: IEEE.
29.
RachmawatiDGustinL. Analysis of Dijkstra’s algorithm and A* algorithm in shortest path problem. In: Proceedings of the 2019 5th International Conference on Computing and Artificial Intelligence (ICCAI 2019), Kyoto, Japan, 19–22 April 2019, paper no. 1566, pp. 1–7. Bristol: IOP Publishing.
30.
RedaMOnsyAHaikalAY, et al.
Path planning algorithms in the autonomous driving system: a comprehensive review. Robotics Auton Syst2024;
174: 104630. doi:10.1016/j.robot.2024.104630.
31.
TangGTangCClaramuntC, et al.
Geometric A-star algorithm: an improved A-star algorithm for AGV path planning in a port environment. IEEE Access2021;
9: 59196–59210. doi:10.1109/ACCESS.2021.3070054.
32.
KarurKSharmaNDharmattiC, et al.
A survey of path planning algorithms for mobile robots. Vehicles2021;
3: 448–468.
33.
KyosevY.Topology-based modeling of textile structures and their joint assemblies.
Switzerland:
Springer, 2019, p. 24.
34.
StorckJLGerberDSteenbockL, et al.
Topology based modelling of crochet structures. J Ind Text2022;
52: 1–18.
35.
ShengCHeGHuZ, et al.
Yarn-on-yarn abrasion failure mechanism of ultrahigh molecular weight polyethylene fiber. J Eng Fibers Fabr2021;
16: 1–9.
36.
HeGShengCHeH, et al.
Mathematical and geometrical modeling of braided ropes bent over a sheave. J Eng Fibers Fabr2020;
15: 1–13.
