Algorithm design for grabbing parameters based on the segment filling insertion technique
Source abstract
Abstract
Abstract 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.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Robotic Path Planning Algorithms · Advanced Measurement and Detection Methods · Advanced Numerical Analysis Techniques
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Donghua University
Technische Universität Dresden, Institute of Textile Machinery and High Performance Material Technology (ITM), Germany
Technische Universität Dresden, Institute of Software and Multimedia Technology, Germany
Funding
China Scholarship Council
References (36)
Show source-provided references
1. Zhang Y, Cheng LD. The origin and heritage of Kesi technique. Adv Mater Res 2013; 821: 382–386. doi:10.4028/www.scientific.net/AMR.821-822.382.10.4028/www.scientific.net/AMR.821-822.382 ↗
2. Lizhao W Louhapensang C Seviset S. 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. Fortes DJ, Li Y, Moura A. Research on Chinese intangible cultural heritage: the case of Nanjing handmade brocade. Diálogos com a Arte – Revista de Arte, Cultura e Educação 2022; 12: 105–112.
4. 10.4028/www.scientific.net/AMR.175-176.54910.4028/www.scientific.net/AMR.175-176.549 ↗
5. He Z, Mayusoh C. Research on the development strategy of Hainan Li brocade cultural and creative products. Humanities and Social Sciences Nakhonsawan Rajabhat University Academic Journal 2024; 11: 198–216.
6. Fang J Ma Y Li Y 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.10.1088/1742-6596/1790/1/012032 ↗
7. Lin W, Meng M, Wang J, et al. Digitizing and recovering the knowledge of traditional Chinese colour of the Nanjing brocade. SCIRES-IT 2022; 12: 95–110.
8. 10.5604/01.3001.0014.823710.5604/01.3001.0014.8237 ↗
9. 10.2478/ftee-2022-003310.2478/ftee-2022-0033 ↗
10. Fan Z Zhou B Zhang S 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.10.1109/CYBER.2017.8446525 ↗
11. Abdel-Fattah MS. ITMA technology: weaving and weaving preparation. Textile World 20 January 2012 pp. 35–40.
12. Li Y Zhang R Wu J et al. Rapier loom and filling insertion method. Patent 201810336929.X China 2018.
13. Cai Z, Fang J, Ma Y, et al. Research and development of automatic segment filling insertion technology. Technol Textiles 2021; 39: 20–23+43.
14. Fang J Kyosev Y Li Y 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.10.15240/tul/008/2023-1-004 ↗
15. 10.1177/004051751560926110.1177/0040517515609261 ↗
16. 10.1007/978-3-319-14705-5_110.1007/978-3-319-14705-5_1 ↗
17. 10.1016/j.comcom.2019.10.01410.1016/j.comcom.2019.10.014 ↗
18. 10.1109/TSMCA.2003.81259910.1109/TSMCA.2003.812599 ↗
19. Warren CW. 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.10.1109/ROBOT.1993.291883 ↗
20. 10.1016/j.protcy.2016.03.01010.1016/j.protcy.2016.03.010 ↗
21. 10.1016/j.robot.2018.04.00710.1016/j.robot.2018.04.007 ↗
22. 10.1109/JAS.2021.100425210.1109/JAS.2021.1004252 ↗
23. 10.3390/biomimetics804037410.3390/biomimetics8040374 ↗
24. Ferguson D Stentz A. 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.10.1109/ROBOT.2005.1570414 ↗
25. Stentz A. 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. Elshamli A Abdullah HA Areibi S. 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.10.1109/CCECE.2004.1345203 ↗
27. 10.1016/j.procs.2018.01.11310.1016/j.procs.2018.01.113 ↗
28. Fan DK Shi P. 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.10.1109/FSKD.2010.5569452 ↗
29. Rachmawati D Gustin L. 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.10.1088/1742-6596/1566/1/012061 ↗
30. 10.1016/j.robot.2024.10463010.1016/j.robot.2024.104630 ↗
31. 10.1109/ACCESS.2021.307005410.1109/ACCESS.2021.3070054 ↗
32. 10.3390/vehicles303002710.3390/vehicles3030027 ↗
33. 10.1007/978-3-030-02541-010.1007/978-3-030-02541-0 ↗
34. 10.1177/1528083722113925010.1177/15280837221139250 ↗
35. Sheng C, He G, Hu Z, et al. Yarn-on-yarn abrasion failure mechanism of ultrahigh molecular weight polyethylene fiber. J Eng Fibers Fabr 2021; 16: 1–9.
36. He G, Sheng C, He H, et al. Mathematical and geometrical modeling of braided ropes bent over a sheave. J Eng Fibers Fabr 2020; 15: 1–13.