Complex Task Allocation for Delegation : From Theory to Practice
2011 (English)Licentiate thesis, monograph (Other academic)
The problem of determining who should do what given a set of tasks and a set of agents is called the task allocation problem. The problem occurs in many multi-agent system applications where a workload of tasks should be shared by a number of agents. In our case, the task allocation problem occurs as an integral part of a larger problem of determining if a task can be delegated from one agent to another.
Delegation is the act of handing over the responsibility for something to someone. Previously, a theory for delegation including a delegation speech act has been specified. The speech act specifies the preconditions that must be fulfilled before the delegation can be carried out, and the postconditions that will be true afterward. To actually use the speech act in a multi-agent system, there must be a practical way of determining if the preconditions are true. This can be done by a process that includes solving a complex task allocation problem by the agents involved in the delegation.
In this thesis a constraint-based task specification formalism, a complex task allocation algorithm for allocating tasks to unmanned aerial vehicles and a generic collaborative system shell for robotic systems are developed. The three components are used as the basis for a collaborative unmanned aircraft system that uses delegation for distributing and coordinating the agents' execution of complex tasks.
Place, publisher, year, pages
Linköping: Linköping University Electronic Press, 2011. , 139 p.
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1506
Multi-agent systems, task allocation, distributed constraint satisfaction, delegation, UAV
National CategoryComputer Vision and Robotics (Autonomous Systems)
IdentifiersURN: urn:nbn:se:liu:diva-70536ISBN: 978-91-7393-048-2OAI: oai:DiVA.org:liu-70536DiVA: diva2:444066
2011-10-25, Alan Turing, hus E, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)