Chapman, Archie, Micillo, Rosa Anna, Kota, Ramachandra and Jennings, Nick
Decentralised Dynamic Task Allocation: A Practical Game–Theoretic Approach
At The Eighth International Conference on Autonomous Agents and Multiagent Systems (AAMAS '09), Hungary.
10 - 15 May 2009.
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.
Conference or Workshop Item
||Event Dates: 10-15 May, 2009
|Venue - Dates:
||The Eighth International Conference on Autonomous Agents and Multiagent Systems (AAMAS '09), Hungary, 2009-05-10 - 2009-05-15
||Multi-agent planning, Game theory
||Agents, Interactions & Complexity
||29 Jan 2009 13:19
||17 Apr 2017 18:54
|Further Information:||Google Scholar|
Actions (login required)