The effect of load on agent-based algorithms for distributed task allocation

  • Authors:
  • Harry Goldingay;Jort Van Mourik

  • Affiliations:
  • Non-linearity and Complexity Research Group, Aston University, Aston Triangle, Birmingham B4 7ET, UK;Non-linearity and Complexity Research Group, Aston University, Aston Triangle, Birmingham B4 7ET, UK

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.07

Visualization

Abstract

Multi-agent algorithms inspired by the division of labour in social insects and by markets, are applied to a constrained problem of distributed task allocation. The efficiency (average number of tasks performed), the flexibility (ability to react to changes in the environment), and the sensitivity to load (ability to cope with differing demands) are investigated in both static and dynamic environments. A hybrid algorithm combining both approaches, is shown to exhibit improved efficiency and robustness. We employ nature inspired particle swarm optimisation to obtain optimised parameters for all algorithms in a range of representative environments. Although results are obtained for large population sizes to avoid finite size effects, the influence of population size on the performance is also analysed. From a theoretical point of view, we analyse the causes of efficiency loss, derive theoretical upper bounds for the efficiency, and compare these with the experimental results.