Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342944
Mehmet Kaya, R. Alhajj
This study proposes novel multiagent learning approach based on utilizing fuzzy mining for modular cooperative learning systems. It incorporates fuzziness and online analytical processing (OLAP) based mining to effectively process the information reported by agents. First, we describe a fuzzy data cube OLAP architecture to facilitate effective storage and processing of the state information reported by agents. This way, the action of the other agent, even not in the visual environment of the agent under consideration, can simply be predicted by extracting online association rules from the constructed data cube. Second, we present a new action selection model, also based on association rules mining. Finally, we generalize not sufficiently experienced states, by mining multi-level association rules from the proposed fuzzy data cube. Experimental results obtained on a well-known pursuit domain show the robustness and effectiveness of the proposed approach.
{"title":"Utilizing fuzzy OLAP mining towards novel approach to multiagent modular reinforcement learning","authors":"Mehmet Kaya, R. Alhajj","doi":"10.1109/IAT.2004.1342944","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342944","url":null,"abstract":"This study proposes novel multiagent learning approach based on utilizing fuzzy mining for modular cooperative learning systems. It incorporates fuzziness and online analytical processing (OLAP) based mining to effectively process the information reported by agents. First, we describe a fuzzy data cube OLAP architecture to facilitate effective storage and processing of the state information reported by agents. This way, the action of the other agent, even not in the visual environment of the agent under consideration, can simply be predicted by extracting online association rules from the constructed data cube. Second, we present a new action selection model, also based on association rules mining. Finally, we generalize not sufficiently experienced states, by mining multi-level association rules from the proposed fuzzy data cube. Experimental results obtained on a well-known pursuit domain show the robustness and effectiveness of the proposed approach.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114694338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342926
L. Penserini, Manuel Kolp, L. Spalazzi, M. Panti
The area of multiagent system is promising in order to help complex system development, indeed, currently, several agent oriented software methodologies have been proposed. Such methodologies mainly focus on their abstraction ability in order to both easily manage the system complexity and easily isolate the stakeholders' requirements that affect the system architecture. On the contrary, this paper also deals with the above issues, but it pays more attention to the characterization of 'intelligent' agent capabilities. Specifically, to deliver on such a task, the paper focuses on the socially-driven approach of Tropos software design methodology in order to build up an agent-based information system prototype.
{"title":"Socially-based design meets agent capabilities","authors":"L. Penserini, Manuel Kolp, L. Spalazzi, M. Panti","doi":"10.1109/IAT.2004.1342926","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342926","url":null,"abstract":"The area of multiagent system is promising in order to help complex system development, indeed, currently, several agent oriented software methodologies have been proposed. Such methodologies mainly focus on their abstraction ability in order to both easily manage the system complexity and easily isolate the stakeholders' requirements that affect the system architecture. On the contrary, this paper also deals with the above issues, but it pays more attention to the characterization of 'intelligent' agent capabilities. Specifically, to deliver on such a task, the paper focuses on the socially-driven approach of Tropos software design methodology in order to build up an agent-based information system prototype.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129934807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342961
Tingting Wang, Jiming Liu, Xiaolong Jin
In a team-based competitive game, agents cooperate to enhance their collective performance in winning the game. An interesting research problem in a team-based game is the role assignment problem (RAP). The problem requires agents to decide their respective roles based on real-time feedback from a dynamically changing environment. The minority game (MG), as used in modeling financial marketing problems, has shown similar characteristics that meet the fundamental requirements of RAP. We propose a formulation of MG strategies for studying RAP in a specific team-based game: RoboCup simulation league (RSL). Through experimentation, we demonstrate that MG strategies improve the effectiveness of role assignment among agents. The improvement validates some characteristics, e.g., the phase transition phenomenon on the memory size, as discovered in the theoretical MG model.
{"title":"Minority game strategies in dynamic multi-agent role assignment","authors":"Tingting Wang, Jiming Liu, Xiaolong Jin","doi":"10.1109/IAT.2004.1342961","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342961","url":null,"abstract":"In a team-based competitive game, agents cooperate to enhance their collective performance in winning the game. An interesting research problem in a team-based game is the role assignment problem (RAP). The problem requires agents to decide their respective roles based on real-time feedback from a dynamically changing environment. The minority game (MG), as used in modeling financial marketing problems, has shown similar characteristics that meet the fundamental requirements of RAP. We propose a formulation of MG strategies for studying RAP in a specific team-based game: RoboCup simulation league (RSL). Through experimentation, we demonstrate that MG strategies improve the effectiveness of role assignment among agents. The improvement validates some characteristics, e.g., the phase transition phenomenon on the memory size, as discovered in the theoretical MG model.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130789890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342951
G. Boella, L. Sauro, Leendert van der Torre
We present a formal model of multiagent systems to analyze the relations of power and dependence underlying group behaviors such as cooperation. Inspired by the work of Castelfranchi we define these relations by means of a description of goals and skills of single agents. We show how our framework can be used to describe social and organizational structures as emergent properties of a collection of individuals.
{"title":"Power and dependence relations in groups of agents","authors":"G. Boella, L. Sauro, Leendert van der Torre","doi":"10.1109/IAT.2004.1342951","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342951","url":null,"abstract":"We present a formal model of multiagent systems to analyze the relations of power and dependence underlying group behaviors such as cooperation. Inspired by the work of Castelfranchi we define these relations by means of a description of goals and skills of single agents. We show how our framework can be used to describe social and organizational structures as emergent properties of a collection of individuals.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131962049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342972
Kai Gao, Yongcheng Wang, Zhiqi Wang
We propose a dynamic cooperation model for different agents' message exchanging. Besides, we propose a new algorithm, which makes it easy to transform a traditional Boolean logical query statement into a matrix. This method allows a document might be retrieved in a clear Boolean view even it matches the query partially. On the base of them, we implement an agent-based selective information retrieval. Parallel crawlers make the prototype scalability and network-load reduction. The focused crawler makes it easy to find as many relevant pages and as few irrelevant pages as possible. Through experiments, we show the results.
{"title":"Agent dynamic cooperation based information retrieval","authors":"Kai Gao, Yongcheng Wang, Zhiqi Wang","doi":"10.1109/IAT.2004.1342972","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342972","url":null,"abstract":"We propose a dynamic cooperation model for different agents' message exchanging. Besides, we propose a new algorithm, which makes it easy to transform a traditional Boolean logical query statement into a matrix. This method allows a document might be retrieved in a clear Boolean view even it matches the query partially. On the base of them, we implement an agent-based selective information retrieval. Parallel crawlers make the prototype scalability and network-load reduction. The focused crawler makes it easy to find as many relevant pages and as few irrelevant pages as possible. Through experiments, we show the results.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128752190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342956
J. Wang, M. Vanninen
We propose a simple and efficient mechanism to self-configure semi-structured overlay networks for heterogeneous peer-to-peer systems with no global knowledge. The overlay network is constructed as a hierarchical graph based on peer power which is an aggregate measure of available resources. We use index based, random walk JOIN and LEAVE protocols to build the overlay network in which node degree and workload correspond to its peer power. We also propose an index based query scheme for peers to search documents in the network. Performance studies demonstrate that the proposed self-configuration protocol and search scheme are efficient and viable. The self-configured P2P network has significantly lower query cost than traditional Gnutella-like P2P systems. We further propose a caching assisted query mechanism where query results are cached by intermediate nodes along the search path, thereby exploiting the surplus storage power of the peers and further improving query efficiency. Caching assisted query permits a quicker response to subsequent queries for popular data without incurring the excessive overhead of globally replicated directory information. Our experimental study reveals that the caching assisted query provides an additional reduction of up to 40% in messages needed per query.
{"title":"A novel self-configuration mechanism for heterogeneous P2P networks","authors":"J. Wang, M. Vanninen","doi":"10.1109/IAT.2004.1342956","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342956","url":null,"abstract":"We propose a simple and efficient mechanism to self-configure semi-structured overlay networks for heterogeneous peer-to-peer systems with no global knowledge. The overlay network is constructed as a hierarchical graph based on peer power which is an aggregate measure of available resources. We use index based, random walk JOIN and LEAVE protocols to build the overlay network in which node degree and workload correspond to its peer power. We also propose an index based query scheme for peers to search documents in the network. Performance studies demonstrate that the proposed self-configuration protocol and search scheme are efficient and viable. The self-configured P2P network has significantly lower query cost than traditional Gnutella-like P2P systems. We further propose a caching assisted query mechanism where query results are cached by intermediate nodes along the search path, thereby exploiting the surplus storage power of the peers and further improving query efficiency. Caching assisted query permits a quicker response to subsequent queries for popular data without incurring the excessive overhead of globally replicated directory information. Our experimental study reveals that the caching assisted query provides an additional reduction of up to 40% in messages needed per query.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127628593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342955
Dongmo Zhang, K. Zhao
This work presents an economic model to the problem of supply chain management in trading agent competition (TAC SCM). The TAC SCM marketplace is characterized by the combination of quantity competition and price competition between manufacturers (agents). We specify the quantity competition by a variation of Cournot model and view the price competition as an extension of Bertrand game. An approach of smooth-regression is introduced to copy with the non-linear fluctuation of product price by using linear price model. The results of the paper provide the solutions to the decision-making problems in TAC SCM trading agent design, including daily production, product pricing and component procuring.
{"title":"Economic model of TAC SCM game","authors":"Dongmo Zhang, K. Zhao","doi":"10.1109/IAT.2004.1342955","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342955","url":null,"abstract":"This work presents an economic model to the problem of supply chain management in trading agent competition (TAC SCM). The TAC SCM marketplace is characterized by the combination of quantity competition and price competition between manufacturers (agents). We specify the quantity competition by a variation of Cournot model and view the price competition as an extension of Bertrand game. An approach of smooth-regression is introduced to copy with the non-linear fluctuation of product price by using linear price model. The results of the paper provide the solutions to the decision-making problems in TAC SCM trading agent design, including daily production, product pricing and component procuring.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114300875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342928
Raymond So, L. Sonenberg
This work outlines a computational model of situation awareness. This model serves two purposes. First, it provides a detailed description for our everyday notion of situation awareness. Second, it offers an alternative perspective of looking into the nature and characteristics of proactive behavior in intelligent agent systems. Most of the existing definitions of proactiveness do not possess the relevant details to encourage rigorous studies of enhancing an agent's capability to anticipate and deal with foreseeable situations. This work intends to fill this gap by suggesting a working definition of proactiveness, which place additional emphasis on its underpinning cognitive process and its role in directing an agent's attention. A brief discussion of using situation awareness as meta-level control to direct a resource-bounded agent's attention is also included.
{"title":"Situation awareness in intelligent agents: foundations for a theory of proactive agent behavior","authors":"Raymond So, L. Sonenberg","doi":"10.1109/IAT.2004.1342928","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342928","url":null,"abstract":"This work outlines a computational model of situation awareness. This model serves two purposes. First, it provides a detailed description for our everyday notion of situation awareness. Second, it offers an alternative perspective of looking into the nature and characteristics of proactive behavior in intelligent agent systems. Most of the existing definitions of proactiveness do not possess the relevant details to encourage rigorous studies of enhancing an agent's capability to anticipate and deal with foreseeable situations. This work intends to fill this gap by suggesting a working definition of proactiveness, which place additional emphasis on its underpinning cognitive process and its role in directing an agent's attention. A brief discussion of using situation awareness as meta-level control to direct a resource-bounded agent's attention is also included.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116467414","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342940
Haizheng Zhang, V. Lesser
The organization and collaborative protocols of agent societies are becoming increasingly important with the growing size of agent networks. Particularly, in a multi-agent based content sharing system, a flat, peer-to-peer (P2P) agent organization is not the most efficient organization for locating relevant agents for queries. This work develops and analyzes a hierarchical agent group formation protocol to build a hybrid organization for large-scale content sharing system as well as a content-aware distributed search algorithm to take advantage of such an organization. During the organization formation process, the agents manage their agent-view structures to form a hierarchical topology in an incremental fashion. The algorithm aims to place those agents with similar content in the same group. We evaluate the system performance based on TREC VLC 921 datasets. The results of the experiment demonstrate a significant increase in the cumulative recall ratio (CRR) measure compared to the flat agent organization and structure.
{"title":"A dynamically formed hierarchical agent organization for a distributed content sharing system","authors":"Haizheng Zhang, V. Lesser","doi":"10.1109/IAT.2004.1342940","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342940","url":null,"abstract":"The organization and collaborative protocols of agent societies are becoming increasingly important with the growing size of agent networks. Particularly, in a multi-agent based content sharing system, a flat, peer-to-peer (P2P) agent organization is not the most efficient organization for locating relevant agents for queries. This work develops and analyzes a hierarchical agent group formation protocol to build a hybrid organization for large-scale content sharing system as well as a content-aware distributed search algorithm to take advantage of such an organization. During the organization formation process, the agents manage their agent-view structures to form a hierarchical topology in an incremental fashion. The algorithm aims to place those agents with similar content in the same group. We evaluate the system performance based on TREC VLC 921 datasets. The results of the experiment demonstrate a significant increase in the cumulative recall ratio (CRR) measure compared to the flat agent organization and structure.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132357487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1343004
Yu Ren, Y. Luqing, F. Chuang
In order to make the maintenance activities in modern industrial enterprise become more and more agile, adaptable, rapid reflect, and low cost, a multi-agent-based remote maintenance support and management system is introduced in the paper. The system tries to integrate the agents distributed in difference lays by cooperation and negotiation, so as to fully utilize the knowledge of the experts from different domains, and make the maintenance decision satisfy the global target of the enterprise. The architecture and the principle of the system are explained in detail, the model of the agents in the system and the technique to realize them is illustrated also.
{"title":"A multi-agent-based, remote maintenance support and management system","authors":"Yu Ren, Y. Luqing, F. Chuang","doi":"10.1109/IAT.2004.1343004","DOIUrl":"https://doi.org/10.1109/IAT.2004.1343004","url":null,"abstract":"In order to make the maintenance activities in modern industrial enterprise become more and more agile, adaptable, rapid reflect, and low cost, a multi-agent-based remote maintenance support and management system is introduced in the paper. The system tries to integrate the agents distributed in difference lays by cooperation and negotiation, so as to fully utilize the knowledge of the experts from different domains, and make the maintenance decision satisfy the global target of the enterprise. The architecture and the principle of the system are explained in detail, the model of the agents in the system and the technique to realize them is illustrated also.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128383626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：