{"title":"Performances analysis in collective systems","authors":"Olivier Simonin, J. Ferber, Vincent Decugis","doi":"10.1109/ICMAS.1998.699290","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699290","url":null,"abstract":"The multi agent approach has been used for several years to study complex systems and to give new techniques of resolution both in artificial life to simulate and to analyse insect societies (E. Bonabean and G. Theraulaz, 1994; J.-L. Deneubourg and S. Goss, 1989; 1991), and in robotics to solve problems such as the collecting or the sorting out of elements in a dynamical environment (R. Brooks, 1986; J.-L. Deneubourg and S. Goss, 1991). The reactive agent architecture is based on a simple process of action-reaction often extended with capabilities of adaptation and learning. However, studies that have been carried out on these systems suffer from a lack of formalism, in particular when performances are evaluated. The experimental approach, based on a direct observation (of real or simulated systems) does not allow for quantitative analysis. Mathematical models have been proposed to analyse the behaviour of action-selection, agent specialization and collective work among insects. But these studies give better results on individual agent behaviour than on global collective performances. The study proposes a method to compute the global performances of collective systems given the behaviour of agents, the environment and the kind of events that can happen. Difficulties lie in the fact that these processes contain a lot of random events. Therefore, the problem consists of modelling the system with the right level of description. Thus we do not study issues that are based on emerging phenomena because, as M. Mataric (1994) emphasizes, it is impossible to determine them without testing the system.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"40 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120920471","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":"Rights and commitment in multi-agent agreements","authors":"T. Norman, C. Sierra, N. Jennings","doi":"10.1109/ICMAS.1998.699053","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699053","url":null,"abstract":"For agents to act in collaboration, they often require an agreement that describes how they are to act, to which they are committed. Typically, agreements are characterised as an explicit course of action or a goal to be achieved. It is argued such agreements may over specify the interaction required. To overcome this problem, a novel formalisation of agreements between agents is presented that is based on rights as well as actions to be performed. Each agent that is involved in an agreement is bound to uphold the rights of others, and the implications of exercising rights and acting for others. It is argued that this approach provides agents with greater flexibility in the agreements they may reach, while retaining the necessary group commitment.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"1 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":"129554879","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":"Agent cloning","authors":"O. Shehory, K. Sycara, P. Chalasani, S. Jha","doi":"10.1109/ICMAS.1998.699287","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699287","url":null,"abstract":"Multi agent systems are subject to performance bottlenecks in cases where agents cannot perform tasks by themselves due to insufficient resources. Solutions to such problems include passing tasks to others or agent migration to remote hosts. We propose agent cloning as a more comprehensive approach to the problem of local agent overloads. According to our paradigm, agents may clone, pass tasks to others, die or merge.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"18 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":"133444372","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}
Ira A. Smith, Philip R. Cohen, J. Bradshaw, M. Greaves, H. Holmback
{"title":"Designing conversation policies using joint intention theory","authors":"Ira A. Smith, Philip R. Cohen, J. Bradshaw, M. Greaves, H. Holmback","doi":"10.1109/ICMAS.1998.699064","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699064","url":null,"abstract":"In this paper we apply the semantics sketched by Smith and Cohen (1996) to the system of conversational policies developed for KAoS. We show that the compositional nature of the speech-acts and their semantics allows us to provide a comprehensive semantics for the conversational policies; and that we can use the generated semantics to analyze policies, to alter policies, and to show how the policies can be combined to form complete dialogues and protocol control strategies. We also show that the semantics provides us with a valuable tool to analyze and to suggest corrections for the conversational policies.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"40 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":"133625534","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":"Multi-agent technology for planning, scheduling, and resource allocation","authors":"V. Gorodetski, A. Lebedev","doi":"10.1109/ICMAS.1998.699247","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699247","url":null,"abstract":"A large number of hot applications are reducible to combinatorial models. Almost all of them are at least NP-hard and cannot be solved in a traditional way. We consider an agent-based approach to solve a set of planning and scheduling applications under real time and temporal constraints. The problem is formalised as a contract allocation task over a set of companies and specified as an auction-based competition of agents managed by a meta-agent. The contributions are: the multi-agent system architecture; knowledge-based specification of real time and temporal constraints; and a knowledge-based auction management model.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"282 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":"133039593","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 modal logic for reasoning about beliefs, desires and intentions of complex agents in a distributed environment","authors":"P. Balbiani, A. E. Seghrouchni","doi":"10.1109/ICMAS.1998.699226","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699226","url":null,"abstract":"Following P. Cohen and H.J. Levesque (1990), R. Fagin et al., 1995, A. Rao M. Georgeff (1991), we agree that modal logic provides a simple but powerful formalism for the representation, the specification and the analysis of the mental attitudes of rational agents: belief, desire and intention (BDI). These approaches underestimate the issue of the formalization of common, distributed and introspective BDI of a group of complex agents. In order to answer to this question, we introduce a propositional modal language that extends existing languages and where various complex agents are considered.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"50 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":"114460532","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":"An agent architecture for dynamic re-design of agents","authors":"F. Brazier, C. Jonker, Jan Treur, N. Wijngaards","doi":"10.1109/ICMAS.1998.699233","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699233","url":null,"abstract":"This paper presents a generic architecture for an agent capable of designing and creating new agents. The design agent is based on an existing generic agent model, and includes a model for design, in which strategic reasoning and dynamic management of requirements are explicitly modelled. The model includes an explicit formal representation of (1) requirements that can be formulated for agents and multi-agent systems, and (2) design object descriptions of a (part of a) multi-agent system.","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":"128695063","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}
J. Rouchier, O. Barreteau, François Bousquet, Hubert Proton
{"title":"Evolution and co-evolution of individuals and groups in environment","authors":"J. Rouchier, O. Barreteau, François Bousquet, Hubert Proton","doi":"10.1109/ICMAS.1998.699062","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699062","url":null,"abstract":"To study the social organisation of sets of agents managing common property goods, we use multi-agent simulations. This paper describes how the idea of group is analysed in this context. On the one hand agents build constantly themselves and the community, through their actions on their common environment and their different interactions with others. On the other hand the group preexists to the agents and compels their actions. To move beyond this dualism we explore different ways to take in account both organisation levels at a same time. Two approaches of that idea have been implemented and are presented here. The first, modelling the potlatch, deals with emerging collective structures that are observed by the model user and by the agents themselves. The second, simulating irrigated systems, defines both organisation levels as autonomous agents that coevolve in their environment. A tool was specially created to stick together these two approaches and is described in the discussion.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"51 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":"116644295","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}
Sen Yoshida, Koji Kamei, M. Yokoo, Takeshi Ohguro, Kaname Funakoshi, F. Hattori
{"title":"Visualizing potential communities: a multiagent approach","authors":"Sen Yoshida, Koji Kamei, M. Yokoo, Takeshi Ohguro, Kaname Funakoshi, F. Hattori","doi":"10.1109/ICMAS.1998.699294","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699294","url":null,"abstract":"The generic term communityware (M. Chalmers and P. Chitson, 1992) has been proposed to represent systems that typically support the formation, activities, and organization of informal groups on open networks such as the Internet or mobile computing systems. Communityware is intended to provide support for a diverse and amorphous group of people who do not yet have a clearly defined goal. We explain the development of an example communityware system that graphically presents a potential community, i.e., people sharing common interests. The proposed system determines the degree of common interests for each pair of people, and it then locates the users in a plane where the distance between the users reflects the relevance between them. A major challenge for implementing this system is distinguishing an appropriate set of keywords to visualize potential communities. The system extracts keywords from the users' profiles and calculates the degree of relevance among the users using those keywords. We use a weight system for keywords as well as a learning mechanism that determines the desired weight from user feedback. It is shown that agents can speed up this learning process by cooperation.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"31 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":"121885426","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":"An adaptive choice of messaging protocol in multi-agent systems","authors":"C. Preist, Siani Pearson","doi":"10.1109/ICMAS.1998.699284","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699284","url":null,"abstract":"There are a variety of choices which need to be made when setting up a multi-agent community. In particular, which agents communicate with which, what protocols they use, and what information flows from one to another. Such design choices will affect the efficiency of the community with respect to several parameters accuracy, speed of solution, and message load. In this paper, we consider one class of problem which multi-agent systems engage in-service provision. Using a simple, abstract, form of this problem, we use a mathematical analysis to show that three different messaging protocols result in varying message loads, depending on certain parameters such as number of agents and frequency of request. If the parameters are fixed, we can conclude which of these three protocols is most efficient. However, these parameters will usually vary over time, and hence the best of the three protocols will vary. We show that the community can adopt the best protocol if each individual agent makes a local decision based on which protocol will minimise its own message load. Hence, local decisions lead to globally good behaviour. We demonstrate this both mathematically and experimentally.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"30 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":"124857716","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}