A group task allocation strategy in open and dynamic grid environments

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

Abstract

Against the problem of group task allocation with time constraints in open and dynamic grid environments, this paper proposes a decentralised indicator-based combinatorial auction strategy for group task allocation. In the proposed strategy, both resource providers and consumers are modeled as intelligent agents. All the agents are limited to communicating with their neighbour agents, therefore, the proposed strategy is decentralised. In addition, the proposed strategy allow agents to enter and leave the grid environments freely, and is robust to the dynamism and openness of the grid environments. Tasks in the proposed strategy have deadlines and might need the collaboration of a group of self-interested providers to be executed. The experimental results demonstrate that the proposed strategy outperforms a well-known decentralised task allocation strategy in terms of success rate, individual utility of the involved agents and the speed of task allocation.

Cite

CITATION STYLE

APA

Kong, Y., Zhang, M., & Ye, D. (2016). A group task allocation strategy in open and dynamic grid environments. In Studies in Computational Intelligence (Vol. 638, pp. 121–139). Springer Verlag. https://doi.org/10.1007/978-3-319-30307-9_8

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