Decentralised Dynamic Task Allocation Using Overlapping Potential Games

Chapman, Archie, Micillo, Rosa Anna, Kota, Ramachandra and Jennings, Nick (2010) Decentralised Dynamic Task Allocation Using Overlapping Potential Games. The Computer Journal, 53, (9), 1462 -1477.


[img] PDF
Download (329Kb)


This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a stochastic game formulation of these problems in which tasks have varying hard deadlines and processing requirements. We then introduce a new technique for approximating this game using a series of static potential games, before detailing a decentralised method for solving the approximating games that uses the distributed stochastic algorithm. Finally, we discuss an implementation of our approach to a task allocation problem in the RoboCup Rescue disaster management simulator. The results show that our technique performs comparably to a centralised task scheduler (within 6% on average), and also, unlike its centralised counterpart, it is robust to restrictions on the agents’ communication and observation ranges.

Item Type: Article
Related URLs:
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 268518
Accepted Date and Publication Date:
October 2010Accepted
Date Deposited: 18 Feb 2010 11:22
Last Modified: 31 Mar 2016 14:16
Decentralised Data and Information Systems
Funded by: EPSRC (EP/C548051/1)
1 October 2005 to 31 March 2011
Further Information:Google Scholar

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics