View in EDS

Multi-AGV multitask collaborative scheduling based on an improved ant colony algorithm.

Saved in:
Bibliographic Details
Title: Multi-AGV multitask collaborative scheduling based on an improved ant colony algorithm.
Authors: Zhu, Yazhen, Song, Qing, Li, Meng
Source: International Journal of Advanced Robotic Systems; Jan/Feb2025, Vol. 22 Issue 1, p1-11, 11p
Subject Terms: AUTOMATED guided vehicle systems, METAHEURISTIC algorithms, ANT algorithms, MATHEMATICAL optimization, MATHEMATICAL models, PHEROMONES
Abstract: Research on multitask scheduling systems in factory environments is a popular topic in the field of intelligent manufacturing. Existing research mainly focuses on the optimization of automated guided vehicle (AGV) path planning and scheduling, emphasizing on the minimization of conflicts and deadlocks, multi-objective task scheduling, and metaheuristic algorithm optimization, while ignoring path stability and real-time path planning in dynamic environments. Therefore, this paper aims to address these issues to better handle dynamic changes in actual operating environments. This paper establishes a mathematical model with the optimization objective of minimizing the overall running time of material distribution tasks and proposes an improved ant colony algorithm to optimize the model. First, the concept of prior time is introduced to improve the traditional ant colony algorithm. The path of the ongoing task is introduced with a time calculation, and the occupancy time window of each grid point on the path is calculated. Based on this, the initial pheromone distribution on subsequent paths is altered dynamically, which accelerates the convergence of the ants to a collision-free path. Second, in the pheromone update stage, the method of calculating the pheromone increment in the traditional ant colony algorithm is modified. The original distance influence factor is changed to a time influence factor, which ensures that all tasks still have the minimum running time when calculating a collision-free path. Finally, through 30 sets of simulation experiments on material distribution tasks, it is shown that the proposed algorithm shortens the total running time by 15.14%, 12.87%, and 10.59% compared to two ant colony algorithms and one strategic multi-AGV scheduling algorithm, respectively, thus verifying the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Advanced Robotic Systems is the property of Sage Publications Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract:Research on multitask scheduling systems in factory environments is a popular topic in the field of intelligent manufacturing. Existing research mainly focuses on the optimization of automated guided vehicle (AGV) path planning and scheduling, emphasizing on the minimization of conflicts and deadlocks, multi-objective task scheduling, and metaheuristic algorithm optimization, while ignoring path stability and real-time path planning in dynamic environments. Therefore, this paper aims to address these issues to better handle dynamic changes in actual operating environments. This paper establishes a mathematical model with the optimization objective of minimizing the overall running time of material distribution tasks and proposes an improved ant colony algorithm to optimize the model. First, the concept of prior time is introduced to improve the traditional ant colony algorithm. The path of the ongoing task is introduced with a time calculation, and the occupancy time window of each grid point on the path is calculated. Based on this, the initial pheromone distribution on subsequent paths is altered dynamically, which accelerates the convergence of the ants to a collision-free path. Second, in the pheromone update stage, the method of calculating the pheromone increment in the traditional ant colony algorithm is modified. The original distance influence factor is changed to a time influence factor, which ensures that all tasks still have the minimum running time when calculating a collision-free path. Finally, through 30 sets of simulation experiments on material distribution tasks, it is shown that the proposed algorithm shortens the total running time by 15.14%, 12.87%, and 10.59% compared to two ant colony algorithms and one strategic multi-AGV scheduling algorithm, respectively, thus verifying the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]
ISSN:17298806
DOI:10.1177/17298806241312784