A novel hexagonal grid map model and regenerated heuristic factor based strategy for intelligent manufacturing system’s AGV path planning problem solving

•Innovatively applied hexagonal grid map modeling, enhancing connectivity, sampling frequency, and safety.•Improved regenerated heuristic factor in ant colony algorithm to solve local optima issues.•Employed bidirectional search strategy in ant colony algorithm to boost global exploration. In modern...

Full description

Saved in:
Bibliographic Details
Published inComputers & industrial engineering Vol. 192; p. 110154
Main Authors Zhang, Zhongyu, Zhang, Jinsheng, Zhao, Yunlong, Zhu, Zhenjie, Guo, Jing
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.06.2024
Subjects
Online AccessGet full text
ISSN0360-8352
1879-0550
DOI10.1016/j.cie.2024.110154

Cover

More Information
Summary:•Innovatively applied hexagonal grid map modeling, enhancing connectivity, sampling frequency, and safety.•Improved regenerated heuristic factor in ant colony algorithm to solve local optima issues.•Employed bidirectional search strategy in ant colony algorithm to boost global exploration. In modern industry, flexible manufacturing systems play an indispensable role, and the precision and connectivity of map modeling are crucial for improving the efficiency and flexibility of AGV (Automated Guided Vehicle) transportation systems. Facing challenges such as spatial constraints, equipment failures, and unexpected task changes in real manufacturing environments, this paper proposes an innovative AGV path planning method based on hexagonal grid map modeling. This method significantly enhances the connectivity, sampling frequency, and safety of AGV path planning by replacing traditional square grids with hexagonal ones. Additionally, this study employs an improved ant colony algorithm combined with the hexagonal grid map for AGV path planning. The algorithm incorporates heuristic factors to effectively avoid local optima. Furthermore, by dividing the ant colony into odd and even groups and implementing a bidirectional search strategy, the comprehensive exploration capability of the algorithm is further enhanced. Experimental results show that compared to traditional square grids, the hexagonal grid reduces the optimal path length by 11.1%, and the application of heuristic factors further shortens the path length by 18.6%. The bidirectional search strategy also significantly reduces the number of iterations required by the algorithm, with a maximum reduction of 46.46%. In summary, this paper provides a new, efficient, stable, and energy-saving solution for AGV path planning systems, with thorough optimizations and improvements made in every aspect from map modeling to path planning algorithms.
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2024.110154