Multi-AGV path planning method for the textile industry based on improved ant colony optimization algorithm and R-tree line-segment bilayer conflict detection
Wei Xie, Xiangle Zheng, Jiachen Ma, Jun Chen, Bin Du, Xiaoli Wang, Reza Rostamzadeh, Reza Rostamzadeh, Reza Rostamzadeh · 2025
Read Multi-AGV path planning method for the textile industry based on improved ant colony optimization algorithm and R-tree line-segment bilayer conflict detection by Wei Xie, Xiangle Zheng, Jiachen Ma, Jun Chen, Bin Du, Xiaoli Wang, Reza Rostamzadeh, Reza Rostamzadeh, Reza Rostamzadeh (2025) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-12753090.txt.
Description
Wei Xie and co-authors present a method for guiding many driverless carts in textile workshops without crashes. Carts move cloth and goods in tight halls packed with machines, so paths often cross. Older checks for clashes were slow when many carts ran at once.
Their design pairs a fast spatial index that spots possible clashes on path lines with an improved ant colony method that picks routes. In tests, the clash check cut comparisons by more than three quarters against two rival methods. The full method also ran faster and turned less than a baseline plan. The work offers a practical route to safe, large scale cart fleets in smart factories.
Catalog record
| CREATOR | Wei Xie, Xiangle Zheng, Jiachen Ma, Jun Chen, Bin Du, Xiaoli Wang, Reza Rostamzadeh, Reza Rostamzadeh, Reza Rostamzadeh |
|---|---|
| YEAR | 2025 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 92 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |