Introduces DGBA for submodular task allocation in MAS under q-independence constraints, claiming polynomial-time feasibility with approximation guarantees and better performance than benchmarks in simulations.
Leader selection in networks under switching topologies with antagonistic interactions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MA 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Task Allocation for Multi-Agent Systems: A Submodular Optimization Approach
Introduces DGBA for submodular task allocation in MAS under q-independence constraints, claiming polynomial-time feasibility with approximation guarantees and better performance than benchmarks in simulations.