Adaptive Coordination Ant Colony Optimization for Multipoint Dynamic Aggregation

Area of Science:

• Operations Research
• Robotics
• Artificial Intelligence

Background:

• Multipoint dynamic aggregation is crucial for real-world applications like disaster relief and resource scheduling.
• Existing methods struggle with dynamic task demands and multi-robot collaboration.

Purpose of the Study:

• To develop an efficient metaheuristic algorithm for multipoint dynamic aggregation.
• To address challenges posed by time-varying task demands and robot-task interdependencies.

Main Methods:

• Developed adaptive coordination ant colony optimization (ACO).
• Implemented a multi-ant, multi-pheromone matrix approach for coordinated pathfinding.
• Introduced adaptive heuristic information and a pheromone-based repair mechanism.

Main Results:

• The proposed adaptive coordination ACO significantly improved solution effectiveness.
• The algorithm demonstrated superior efficiency compared to state-of-the-art methods.
• Experimental results validated the algorithm's performance on complex scheduling problems.

Conclusions:

• Adaptive coordination ACO offers a powerful solution for multipoint dynamic aggregation.
• The algorithm effectively handles complex robot-task collaborations and dynamic environments.
• This approach enhances optimization for critical real-world applications.