Cooperative task allocation is one of the critical enablers for multi-Autonomous Underwater Vehicle (AUV) missions, but existing approaches often assume reliable communication that rarely holds in real underwater acoustic environments. We study here the performance and robustness of the Consensus-Based Bundle Algorithm (CBBA) for multi-AUV task allocation under realistically degraded underwater communication conditions with dynamically appearing tasks. An integrated simulation framework that incorporates a Dubins-based kinematic model with minimum turning radius constraints, a configurable underwater acoustic communication model (range, delay, packet loss, and bandwidth), and a full implementation of improved CBBA with new features, complemented by 3D trajectory and network-topology visualization. We define five communication regimes, from ideal fully connected networks to severe conditions with short range and high packet loss. Within these regimes, we assess CBBA based on task allocation quality (total bundle value and task completion rate), convergence behavior (iterations and convergence rate), and communication efficiency (message delivery rate, average delay, and network connectivity), with additional metrics on the number of conflicts during dynamic task reallocation. Our simulation results indicate that CBBA maintains performance close to the optimum when the conditions are good and moderate but degrades significantly when connectivity becomes intermittent. We then introduce a local-communication-based conflict resolution strategy in the face of frequent task conflicts under very poor conditions: neighborhood-limited information exchange, negotiation within task areas, and decentralized local decisions. The proposed conflict resolution strategy significantly reduces the occurrence of conflicts and improves task completion under stringent communication constraints. This provides practical design insights for deploying multi-AUV systems under weak underwater acoustic networks.
Wang et al. (Fri,) studied this question.