A Distributed Anytime Algorithm for Dynamic Task Allocation in Multi-Agent Systems

Our approach Multi-agent task allocation is an important and challenging yields significant reductions in both run-time and communication, problem, which involves deciding how to assign a set thereby increasing real-world applicability. of agents to a set of tasks, both of which may change over In more detail, in this paper we advance the state-ofthe-art time (i.e., it is a dynamic environment). Moreover, it is often in the following ways: first, we present a novel, necessary for heterogeneous agents to form teams (known as online domain pruning algorithm specifically tailored to coalitions) to complete certain tasks in the environment. In dynamic task allocation environments to reduce the number coalitions, agents can often complete tasks more efficiently of potential solutions that need to be considered.