Distributed task selection in multi-agent based swarms using heuristic strategies

5Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Swarm-based systems have emerged as an attractive paradigm for implementing distributed autonomous systems for various applications in commercial, military and business domains. One of the major operations in a swarm-based system is to ensure that the individual swarm units process the tasks in the environment in an efficient manner. This can be achieved using a suitable task selection mechanism that allocates the desired number of swarm units to each task while reducing inter-task latencies and communication overhead, and, ensuring adequate commitment of resources to tasks. In this paper, we describe a multi-agent based distributed task selection mechanism for swarm-based systems. We show that the distributed task selection problem is NP-complete and propose polynomial-time heuristic-based algorithms. Our simulation results show that heuristics in which each swarm unit considers both the effects of other swarm units on tasks and its own relative position to other swarm units achieve better task processing efficiency and improved distribution of swarm units over tasks. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Miller, D., Dasgupta, P., & Judkins, T. (2007). Distributed task selection in multi-agent based swarms using heuristic strategies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4433 LNCS, pp. 158–173). Springer Verlag. https://doi.org/10.1007/978-3-540-71541-2_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free