2 research outputs found
Analysis of Evolved Response Thresholds for Decentralized Dynamic Task Allocation
We investigate the application of a multi-objective genetic algorithm to the
problem of task allocation in a self-organizing, decentralized, threshold-based
swarm. Each agent in our system is capable of performing four tasks with a
response threshold for each, and we seek to assign response threshold values to
all of the agents a swarm such that the collective behavior of the swarm is
optimized. Random assignment of threshold values according to a uniform
distribution is known to be effective; however, this method does not consider
features of particular problem instances. Dynamic response thresholds have some
flexibility to address problem specific features through real-time adaptivity,
often improving swarm performance.
In this work, we use a multi-objective genetic algorithm to evolve response
thresholds for a simulated swarm engaged in a dynamic task allocation problem:
two-dimensional collective tracking. We show that evolved thresholds not only
outperform uniformly distributed thresholds and dynamic thresholds but achieve
nearly optimal performance on a variety of tracking problem instances (target
paths). More importantly, we demonstrate that thresholds evolved for one of
several problem instances generalize to all other problem instances eliminating
the need to evolve new thresholds for each problem to be solved. We analyze the
properties that allow these paths to serve as universal training instances and
show that they are quite natural.Comment: 22 pages, 12 figure
An Ant Based Algorithm for Task Allocation in Large-Scale and Dynamic Multiagent Scenarios
This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating in dynamic environments with possible inter-task constraints. We present eXtreme-Ants, an approximate algorithm for task allocation in extreme teams. The algorithm is inspired by the division of labor in social insects and in the process of recruitment for cooperative transport observed in ant colonies. Division of labor offers fast and efficient decision-making, while the recruitment ensures the allocation of tasks that require simultaneous execution. We compare eXtreme-Ants with two other algorithms for task allocation in extreme teams and we show that it achieves balanced efficiency regarding quality of the solution, communication, and computational effort. Categories andSubject Descriptor