A modified consensus-based grouping algorithm for multi-agent task allocation in saturation attack scenarios
- 1 December 2023
- conference paper
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12940, 67-753
Abstract
This paper addresses the decentralized simultaneous multi-agent task allocation problem in saturation attack scenarios. This problem arises when multiple agents have to cooperate simultaneously to perform complex and dangerous tasks that may result in their malfunction or damage. A modified consensus-based grouping algorithm with virtual tasks (CBGA-VT) is proposed that considers time windows, different types of tasks, and destroyed agents after performing certain tasks. Virtual tasks are introduced to address the decreased agents problem and the scoring scheme is improved to achieve better performance. Simulation results demonstrate that CBGA-VT can effectively solve the multi-agent simultaneous task allocation considering destroyed agents in saturation attack scenarios.Keywords
This publication has 8 references indexed in Scilit:
- Review on state-of-the-art dynamic task allocation strategies for multiple-robot systemsIndustrial Robot: the international journal of robotics research and application, 2020
- A Bid-Based Grouping Method for Communication-Efficient Decentralized Multi-UAV Task AllocationInternational Journal of Aeronautical and Space Sciences, 2019
- A Consensus-Based Grouping Algorithm for Multi-agent Cooperative Task Allocation with Complex RequirementsCognitive Computation, 2014
- A Cluster-Based Approach to Consensus Based Distributed Task Allocation2014
- An Extension of the Consensus-Based Bundle Algorithm for Multi-agent Tasks with Task Based Requirements2012
- A Multi-Team Extension of the Consensus-Based Bundle Algorithm2011
- Consensus-Based Decentralized Auctions for Robust Task AllocationIEEE Transactions on Robotics, 2009
- A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot SystemsThe International Journal of Robotics Research, 2004