Chapman, A., Micillo, R. A., Kota, R. and Jennings, N. (2010) Decentralised Dynamic Task Allocation Using Overlapping Potential Games. The Computer Journal, 53 (9). 1462 -1477.
Download
![[img]](http://eprints.ecs.soton.ac.uk/style/images/fileicons/application_pdf.png)
|
PDF
329Kb |
Abstract
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 | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Creator/Authors: |
| ||||||||
| Research Group: | Old ECS Groups > Intelligence, Agents, Multimedia Current ECS Groups > Agents, Interaction and Complexity | ||||||||
| Alternative Locations: | doi:10.1093/comjnl/bxq023 | ||||||||
| Date: | October 2010 | ||||||||
| Information about this record: | |||||||||
| Citations: | Google Scholar: 1 | ||||||||
| Downloads (2010): | 146 | ||||||||
| ID Code: | 18518 | ||||||||
| Last Modified: | 23 Sep 2011 10:39 | ||||||||
| Deposited On: | 18 Feb 2010 11:22 by Chapman, Archie | ||||||||
Tools & Metadata
Download Statistics
Members of ECS may view the download statistics dashboard for this record.
Corrections
ECS staff and postgraduates may modify this record
