Decentralised Dynamic Task Allocation Using Overlapping Potential Games
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 a...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2010-10.
|
| Subjects: | |
| Online Access: | Get fulltext |