Please use this identifier to cite or link to this item:
|Title:||Optimal task automaton decomposabilization for a class of global specifications|
|Citation:||Karimadini, M.,Lin, H. (2010). Optimal task automaton decomposabilization for a class of global specifications. 2010 8th IEEE International Conference on Control and Automation, ICCA 2010 : 2042-2047. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCA.2010.5524201|
|Abstract:||This paper addresses the optimal task automaton decomposabilization applicable in top-down cooperative control of multi-agent systems. In , we proposed a divide-and-conquer approach for task automaton decomposition. In that result, given the global specification, represented as an automaton, and the logical behavior of the multi-agent system, modeled as a parallel distributed system, we proposed a necessary and sufficient condition for task automaton decomposition for two agents, such that the parallel composition of subtask automata is bisimilar to the original task automaton. This work completes the decomposition result of , by proposing a decomposabi-lization result. In this work, as the main contributions, firstly, we introduce a guideline for the basic design of private and common events, based on the specification. Secondly, after the basic event pattern attribution, the decomposability condition is checked, and if the task automaton is not decomposable, a sufficient condition is given to make it decomposable by assigning some of the private events to be common. The method is then proven to be optimal in the sense of minimum number of event conversions leading to minimum increment in the required communication capacity. An example is given to illustrate the concept and significance of optimal task decomposabilization. © 2010 IEEE.|
|Source Title:||2010 8th IEEE International Conference on Control and Automation, ICCA 2010|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.