Loading...
Please wait, while we are loading the content...
Similar Documents
Tasks Decomposition Problem in Multi-Agent Systems (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Skowron, Andrzej Nguyen, Hung Son |
| Description | We consider a synthesis of complex objects by multi-agent system based on rough mereology theory [12]. Any agent can produce complex objects from parts obtained from his sub-agents using some composition rules. Agents are equipped with decision tables describing partial specifications of their synthesis tasks. We investigate some problems of searching for optimal task specifications for sub-agents having task specification for a super-agent. We propose a decomposition scheme (based on rough set and rough mereology theory) consistent with given composition rules. The computational complexity of decomposition problems is discussed by showing that these problems are equivalent to some well known graph theory problems.We also propose some heuristics for considered problems. As an application of multi-agent system we will show an effective decomposition and synthesis scheme for a production process of complex objects. We will show an upper bound of an error rate in synthesis process of our ... |
| File Format | |
| Language | English |
| Publisher Date | 1998-01-01 |
| Publisher Institution | Proceedings of the W8 Workshop at ECAI'98 on Synthesis of Intelligent Agents from Experimental Data. Brighton August 24 |
| Access Restriction | Open |
| Subject Keyword | Multi-agent System Synthesis Process Decomposition Scheme Synthesis Scheme Rough Set Error Rate Decision Table Complex Object Synthesis Task Upper Bound Task Decomposition Problem Task Specification Decomposition Problem Effective Decomposition Composition Rule Optimal Task Specification Graph Theory Problem Production Process Rough Mereology Theory Partial Specification Computational Complexity |
| Content Type | Text |
| Resource Type | Article |
