MULTI-AGENT CROSS-DOMAIN COLLABORATIVE TASK ALLOCATION PROBLEM BASED ON MULTI-STRATEGY IMPROVED DUNG BEETLE OPTIMIZATION ALGORITHM

Multi-Agent Cross-Domain Collaborative Task Allocation Problem Based on Multi-Strategy Improved Dung Beetle Optimization Algorithm

Multi-Agent Cross-Domain Collaborative Task Allocation Problem Based on Multi-Strategy Improved Dung Beetle Optimization Algorithm

Blog Article

Cross-domain cooperative task allocation is a complex and challenging issue in the field of multi-agent task allocation that requires urgent attention.This paper proposes a task allocation method based on the multi-strategy improved dung beetle optimization (MSIDBO) algorithm, aiming to solve the problem of fully distributed multi-agent cross-domain cooperative task allocation.This method integrates two key objective functions: target allocation and control allocation.

We propose a target allocation model based on the optimal comprehensive san jose sharks trucker hat efficiency, cluster load balancing, and economic benefit maximization, and a control allocation model leveraging the radar detection ability and control data link connectivity.To address the limitations of the original dung beetle optimization algorithm disney coco miguel skeleton in solving such problems, four revolutionary strategies are introduced to improve its performance.The simulation results demonstrate that our proposed task allocation algorithm significantly improves the cross-domain collaboration efficiency and meets the real-time requirements for multi-agent task allocation on various scales.

Specifically, our optimization performance was, on average, 32.5% higher compared to classical algorithms like the particle swarm optimization algorithm and the dung beetle optimization algorithm and its improved forms.Overall, our proposed scheme enhances system effectiveness and robustness while providing an innovative and practical solution for complex task allocation problems.

Report this page