Decentralised Dynamic Task Allocation: A Practical Game–Theoretic Approach


Chapman, Archie, Micillo, Rosa Anna, Kota, Ramachandra and Jennings, Nick (2009) Decentralised Dynamic Task Allocation: A Practical Game–Theoretic Approach. In, The Eighth International Conference on Autonomous Agents and Multiagent Systems (AAMAS '09), Budapest, Hungary, 10 - 15 May 2009. , 915-922.

Download

[img] PDF - Published Version
Download (146Kb)

Description/Abstract

This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these problems for tasks with 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 solution method for 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. Our 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 range.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: 10-15 May, 2009
Keywords: Multi-agent planning, Game theory
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 267066
Date Deposited: 29 Jan 2009 13:19
Last Modified: 27 Mar 2014 20:12
Contact Email Address: acc@zepler.net
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/267066

Actions (login required)

View Item View Item