Please use this identifier to cite or link to this item:
|Title:||Decomposability of global tasks for multi-agent systems|
|Citation:||Karimadini, M., Lin, H. (2010). Decomposability of global tasks for multi-agent systems. Proceedings of the IEEE Conference on Decision and Control : 4192-4197. ScholarBank@NUS Repository. https://doi.org/10.1109/CDC.2010.5716943|
|Abstract:||Multi-agent system is a rapidly developing research area with strong support from both civilian and military applications. One of the essential problems in multi-agent system research is how to design local interaction rules and coordination principles among agents such that the whole system achieves desired global behaviors. To tackle this problem, a divide-and-conquer approach was proposed in , and the basic idea is to decompose the requested global specification into subtasks for individual agents in such a way that the fulfillment of these subtasks by each individual agent should lead to the satisfaction of the global specification. Then, the design reduces to achieving the assigned subtasks for corresponding individual agents. In , it was shown that not all global tasks can be decomposed, and a necessary and sufficient condition on the decomposability of a task automaton between two agents was presented. For more than two agents, we then proposed a hierarchical algorithm as a sufficient condition for decomposability. This paper aims to extend the necessary and sufficient decomposability conditions for any arbitrary finite number of cooperative agents. A new necessary and sufficient condition on decomposability of a task automaton is proposed, here. Several examples are provided to illustrate the decomposition scheme and conditions. ©2010 IEEE.|
|Source Title:||Proceedings of the IEEE Conference on Decision and Control|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 21, 2019
WEB OF SCIENCETM
checked on Mar 12, 2019
checked on Mar 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.