{"title":"How much should an agent know what other agents are doing in a cooperative team?","authors":"Yiming Ye","doi":"10.1109/ICMAS.1998.699293","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699293","url":null,"abstract":"Cooperation in a task oriented multi agent team is important because a well designed cooperation strategy among a group of cooperating agents can lead to an increase of group performance. A challenging research issue in cooperation is to assess how much and to what extent an agent should consider the actions and effects of other agents. We address this issue in the context of an object search team. We first propose the concept of activity window to capture the view of an agent on the activities of the team. Then we pinpoint some criteria that can be used to determine whether it is beneficial for an agent to put an action of the team into its window. Finally, we present experimental results.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124143235","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}
{"title":"Individual and collaborative behaviors in a team of homogeneous robotic soccer agents","authors":"M. Veloso, P. Stone","doi":"10.1109/ICMAS.1998.699074","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699074","url":null,"abstract":"Robotic soccer is a new challenging multi-agent domain, in which agents need to collaborate in an adversarial environment to achieve specific objectives. We describe CMUnited-97, our team of robotic agents that we developed to enter the RoboCup-97 competition. We first discuss the challenges underlying the robotic soccer domain as a multi-agent system. We then introduce our team architecture, briefly describe the system's perception, and present the robots' actions ranging from low-level individual behaviors to coordinated, strategic team behaviors. The robots can organize themselves in formations, hold specific roles, and pursue their goals. In game situations, they extensively used their role-based behaviors, and demonstrated collaboration on multiple occasions. As homogeneous agents, the robots can also switch roles to maximize the overall performance of the team. CMUnited-97 won the RoboCup-97 small-robot competition at IJCAI in Nagoya, Japan.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116408146","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}
{"title":"Coordinated hospital patient scheduling","authors":"Keith S. Decker, Jinjiang Li","doi":"10.1109/ICMAS.1998.699038","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699038","url":null,"abstract":"Hospital Patient Scheduling is an inherently distributed problem because of the way real hospitals are organized. As medical procedures have become more complex, and their associated tests and treatments have become interrelated, the current ad hoc patient scheduling solutions have been observed to break down. We propose a multi-agent solution using the Generalized Partial Global Planning (GPGP) approach that preserves the existing human organization and authority structures, while providing better system-level performance (increased hospital unit throughput and decreased patient slay time). To do this, we extend GPGP with a new coordination mechanism to handle mutually exclusive resource relationships. Like the other GPGP mechanisms, the new mechanism can be applied to any problem with the appropriate resource relationship. We evaluate the this new mechanism in the context of the hospital patient scheduling problem, and examine the effect of increasing interrelations between tasks performed by different hospital units.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121984241","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}
{"title":"A reconfiguration algorithm for the maintenance of collective commitments","authors":"B. Dunin-Keplicz, R. Verbrugge","doi":"10.1109/ICMAS.1998.699243","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699243","url":null,"abstract":"The objective of this research is to define a rigorous methodology to be of help in cooperative problem solving (CPS) based on the BDI paradigm. We construct an approach sensitive to the variety of features that multiagent systems have to meet in a dynamic environment. We base our analysis on the four-stage model of (Wooldridge and Jennings, 1996), containing the consecutive stages of potential recognition, team formation, plan formation and team action. These stages are viewed as levels of an abstract architecture. This architecture is profitable in clarifying the nature of dependencies between agents involved: some of them do domain problem solving, others are responsible for the proper organization of CPS. Because of the unpredictable environment, all stages have a dynamic character and require application of methods reflecting this. When defining the levels we abstract from particular methods and algorithms that realize level-associated goals, but instead formulate their final results and associate them with the appropriate individual, social, and collective motivational attitudes.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128977130","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}
{"title":"Example-based frame mapping for heterogeneous information agents","authors":"F. Itoh, T. Ueda, Yuji Ikeda","doi":"10.1109/ICMAS.1998.699044","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699044","url":null,"abstract":"Communication among heterogeneous information agents is often difficult because they often use different structures to express the same information. A common ontology could resolve this problem. However, it would be very difficult to build such an ontology for dynamic information spaces such as the WWW. Thus, automatic reconciliation of differences is necessary to permit multiagent communication within an open environment where new expressions tend to emerge in communication. We propose a technique that enables automatic mapping of equivalent slots in different frames. The proposed technique, Example-Based Frame Mapping (EBFM), generates hypotheses of equivalent slots, then selects a plausible hypothesis by comparing similarities within the examples inferred to express the same object. EBFM solves the essential problems that arise in frame mapping (e.g., synonyms and homonyms) by using only the available information without requiring any domain specific heuristic knowledge, and can achieve more than 99% accuracy.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124689307","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}
F. D. C. Gomes, C. N. Meneses, Allan G. Lima, Carlos A. S. Oliveira
{"title":"Asynchronous organizations for solving the point-to-point connection problem","authors":"F. D. C. Gomes, C. N. Meneses, Allan G. Lima, Carlos A. S. Oliveira","doi":"10.1109/ICMAS.1998.699043","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699043","url":null,"abstract":"We present an agent approach to solve the nonfixed point-to-point connection problem. The optimization version of this problem is NP-hard and has numerous applications in circuit switching and VLSI design. We use Asynchronous Teams (or A-Teams) technique to search for an optimal global solution. An A-Team is an organization of agents that communicate with each other by means of shared memories. Each agent is a heuristic strategy that can make its own choices about its inputs, scheduling and resource allocation. Computational results comparing our approach against an exact algorithm are presented.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127244954","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}
Kumiko Tanaka-Ishii, I. Noda, I. Frank, H. Nakashima, K. Hasida, H. Matsubara
{"title":"MIKE: an automatic commentary system for soccer","authors":"Kumiko Tanaka-Ishii, I. Noda, I. Frank, H. Nakashima, K. Hasida, H. Matsubara","doi":"10.1109/ICMAS.1998.699067","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699067","url":null,"abstract":"This paper describes MIKE, an automatic commentary system for the game of soccer. Since soccer is played by teams, describing the course of a game calls for reasoning about multi-agent interactions. Also, events may occur at any point of the field at any time, making it difficult to fix viewpoints. MIKE interprets this domain with six soccer analysis modules that run concurrently within a role-sharing framework. We describe these analysis modules and also discuss how to control the interaction between them so that an explanation of a game emerges reactively from the system. We present and evaluate examples of the match commentaries produced by MIKE in English, Japanese and French.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126926503","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}
{"title":"Towards flexible teamwork in persistent teams","authors":"Milind Tambe, Weixiong Zhang","doi":"10.1109/ICMAS.1998.699065","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699065","url":null,"abstract":"Teamwork is a critical capability in multi-agent environments. Many such environments mandate that the agents and agent-teams mast be persistent i.e., exist over long periods of time. Agents in such persistent teams are bound together by their long-term common interests and goals. This paper focuses on flexible teamwork in such persistent teams. Unfortunately, while previous work has investigated flexible teamwork, persistent teams remain unexplored. For flexible teamwork, one promising approach that has emerged is model-based, i.e., providing agents with general models of teamwork that explicitly specify their commitments in teamwork. Such models enable agents to autonomously reason about coordination. Unfortunately, for persistent teams, such models may lead to coordination and communication actions that while locally optimal, are highly problematic for the team's long-term goals. We present a decision-theoretic technique to enable persistent teams to overcome such limitations of the model-based approach. In particular, agents reason about expected team utilities of future team states that are projected to result from actions recommended by the teamwork model, as well as lower-cost (or higher-cost) variations on these actions. To accommodate real-time constraints, this reasoning is done in an any-time fashion. Implemented examples from an analytic search tree and some real-world domains are presented.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121569297","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}
{"title":"A game-theoretic approach to the socialization of utility-based agents","authors":"Alcino Cunha, J. Neves","doi":"10.1109/ICMAS.1998.699239","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699239","url":null,"abstract":"This paper presents a formal framework in which to study the socialization processes evolving among utility-based agents. These agents are self-interested, being their different social attitudes (cooperativeness, competitiveness or indifference) a consequence of this behavior. The dynamics of the socialization process are captured by a relation that measures the similarities between the desires of two groups of agents. This similitude relation is derived from the system's model, defined as a probabilistic transition system and a set of individual preference relations. Game-theoretic concepts are used in order to determine the rational(or expected) transitions of the system.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115030735","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}
{"title":"Principles of trust for MAS: cognitive anatomy, social importance, and quantification","authors":"C. Castelfranchi, R. Falcone","doi":"10.1109/ICMAS.1998.699034","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699034","url":null,"abstract":"After arguing about the crucial importance of trust for Agents and MAS, we provide a definition of trust both as a mental state and as a social attitude and relation. We present the mental ingredients of trust: its specific beliefs and goals, with special attention to evaluations and expectations. We show the relation between trust and the mental background of delegation. We explain why trust is a bet, and implies some risks, and analyse the most basic forms of non-social trust (reliance on objects and tools) to arrive at the more complex forms of social trust, based on morality and reputation. Finally we present a principled quantification of trust, based on its cognitive ingredients. And use this \"degree of trust\" as the basis for a rational decision to delegate or not to another agent. The paper is intended to contribute both to the conceptual analysis and to the practical use of trust in social theory and MAS.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115113019","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}