{"title":"Computer aided multi-agent system engineering","authors":"Soe-Tsyr Yuan","doi":"10.1109/ICMAS.1998.699296","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699296","url":null,"abstract":"Currently, multi-agent systems (MAS) are being used in an increasingly wide variety of application areas, ranging from operational support and diagnosis, electronic commerce, manufacturing, information finding and filtering, planning and resource allocation, and service integration. Observing from these developed MAS that show great achievements, we could have the following realizations: A lot of design efforts have to be paid varying from communication and cooperation to configuration between agents. Such efforts are often in common with respect to the ideas or methodologies. Such efforts are also becoming 'entrance barrier' of the development of MAS for general system developers. In case not managing such effort well, the resulting MAS might not do as the developers expect. As a result, an engineering approach is necessary for better managing of the development of MAS. This study describes the concept of computer aided/automated multi-agent system engineering and its need on the life cycle of MAS, and then presents Eureka, a computer aided/automated multi-agent system engineering tool, which is implemented at our institution and aims to simplify the configuration of MAS as possibly as it can.","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":"129524167","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":"Interaction protocols in Agentis","authors":"M. d'Inverno, D. Kinny, M. Luck","doi":"10.1109/ICMAS.1998.699039","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699039","url":null,"abstract":"Agentis is a framework for building interactive multiagent applications which is based upon a model of agent interaction whose key elements are services and tasks. Central to the operation of the system is the set of protocols that permit reliable, concurrent request and provision of services and tasks from and to agents, using an underlying asynchronous point-to-point messaging infrastructure. In this paper we focus on this aspect of the Agentis system and provide a detailed description of these protocols, together with a formal specification in Z. The specification can be seen as part of a more complete formal specification of the entire system, which provides an integrated and coherent way of describing the system at different levels. In so specifying the Agentis protocols, however we also provide some general guidelines which may be applied to the specification of other protocols for agent interaction.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"11 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":"128488952","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":"Task allocation: a group self-design approach","authors":"Eric Malville, F. Bourdon","doi":"10.1109/ICMAS.1998.699046","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699046","url":null,"abstract":"This paper focuses on distributed task allocation mechanisms in Open Multi-Agents Systems. Our aim is to provide task allocation protocols for building Multi-Agents Systems in distributed environments. The mechanism we propose is based on a Group Self-Design (GSD) approach. From a global point of view the GSD protocols enable the search space to be organised into a tree-structure in which nodes are agent groups. From a local point of view they enable a group to be sub-divided autonomously and independently of the others. The purpose of GSD is to limit the network load created by the management of the system dynamic and by the search of task solvers. We put forward an evaluation of our approach in terms of network load in relation to the contract net protocol of R.G. Smith (1980) and to the agent group model of B. Dillenseger and F. Bourdon (1995).","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":"130383198","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":"Implementation issues on market-based QoS control","authors":"H. Yamaki, Yutaka Yamauchi, T. Ishida","doi":"10.1109/ICMAS.1998.699220","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699220","url":null,"abstract":"We discuss two major tradeoffs, spatial and temporal tradeoffs, that appear when applying market-based computing to multimedia network applications. The former appears between computation and communication cost, depending on how agents are distributed over a network. The latter appears between reactiveness and correctness of a result, depending on how the network environment dynamically changes. By implementing a market-based resource allocation mechanism to a desktop conferencing system, we clarified that: as for spatial tradeoff the centralized computation becomes profitable in proportion to the number of clients; and that as for temporal tradeoff the merit to respond quickly to the change of the environment by prematurely terminating the computation supersedes the merit to improve the accuracy of the resource allocation by performing the calculation until the market perfectly clears. It has also been proved that the market-based mechanism can achieve efficient allocation in an actual network environment.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"46 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":"115781574","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":"Poaching and distraction in asynchronous agent activities","authors":"M. Chia, D. Neiman, V. Lesser","doi":"10.1109/ICMAS.1998.699036","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699036","url":null,"abstract":"We investigate coordination issues in a distributed jobshop scheduling system in which agents schedule potentially contentious activities asynchronously in parallel. Agents in such a system will in general have a limited view of the global state of resources and must exchange appropriate state information with other agents in order to schedule effectively. However, even given perfect instantaneous knowledge of other agents' resource requirements, agents still may not be able to schedule effectively if they do not also model the possible future actions of other agents and the effects of their own actions. We formally describe two types of agent behaviors, poaching and distraction, arising from the asynchronous nature of distributed systems that decrease scheduling effectiveness, and we present experimental results from a distributed airport resource management system demonstrating a significant improvement in scheduling performance when coordination mechanisms are used to prevent such behaviors.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"10 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":"132467767","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":"Simulating value chain coordination with artificial life agents","authors":"Torsten Eymann, B. Padovan, D. Schoder","doi":"10.1109/ICMAS.1998.699244","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699244","url":null,"abstract":"The increasing use of information technology within and between companies yields changes in the predominant coordination mechanisms. On one hand it is argued that we witness an overall shift towards market-like coordination of business transactions, whereas others argue that we face more hierarchy-like coordination. In this paper a multi-agent system is described that globally coordinates a multiple step value chain either way by using local optimization rules of self-interested autonomous agents. In further research it will be analyzed how changes in setup parameters (e.g. transaction costs, cooperational behavior) will effect the predominant coordination mechanism among the artificial life agents.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"58 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":"130198977","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":"Dynamics in transition mental activity","authors":"Milton Corrêa, R. Vicari, H. Coelho","doi":"10.1109/ICMAS.1998.699237","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699237","url":null,"abstract":"The scene is set now for computer modelers to rake over and highlight the shape and accessibility of the reactive mental sites. Until recently, attempts to model artificial agents had to rake account of every functional unit in every architecture. The dynamics of mental states events is crucial to design agents because we need to rethink the role of mental states when tuning behaviours. Tiny changes to the shapes of these states make a big difference to what agents do, and only by inspecting how states interact we may find the most suitable structures and mechanisms for the mental activities. The paper presents how dynamics in transition mental states to agents' behaviour results from a set of properties and laws governing combinations of mental states. These agents can have mental states (beliefs, desires, intentions, expectations) and the activities of these mental states occur in the context of an agent architecture. This architecture, called SEM (Society of Mental States), is a nest of four sub-agents built around beliefs, desires, intentions and expectations. The characteristics of such agents are defined from the beginning as a basic set of desires, expectations, actions and beliefs, which is also made of strategies to interact with other agents and the world, as well. The interactions of such agents are the result of their mental states' dynamics and their actions, as we show in the paper. Namely, in order to have a pair of agents with tutor and learner behaviours it is only necessary to specify their mental states.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"75 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":"132670610","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":"Distributed constraint satisfaction: foundation and applications","authors":"Makoto Yokoo","doi":"10.1109/ICMAS.1998.699026","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699026","url":null,"abstract":"When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. The research on constraint satisfaction problems has a long and distinguished history in AI as a general framework that can formalize various application problems. Similarly, a distributed CSP is a fundamental problem for achieving coordination among agents and can formalize various application problems in multi-agent systems.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"66 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":"127660682","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 meta-model for the analysis and design of organizations in multi-agent systems","authors":"J. Ferber, O. Gutknecht","doi":"10.1109/ICMAS.1998.699041","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699041","url":null,"abstract":"This paper presents a generic meta-model of multi-agent systems based on organizational concepts such as groups, roles and structures. This model, called AALAADIN, defines a very simple description of coordination and negotiation schemes through multi-agent systems. Aalaadin is a meta-model of artificial organization by which one can build multi-agent systems with different forms of organizations such as market-like and hierarchical organizations. We show that this meta-model allows for agent heterogeneity in languages, applications and architectures. We also introduce the concept of organizational reflection which uses the same conceptual model to describe system level tasks such as remote communication and migration of agents. Finally, we briefly describe a platform, called MADKIT, based on this model. It relies on a minimal agent kernel with platform-level services implemented as agents, groups and roles.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"55 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":"131685679","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":"Plan generation, plan management, and the design of computational agents","authors":"M. Pollack","doi":"10.1109/ICMAS.1998.699023","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699023","url":null,"abstract":"A significant amount of prior research effort in the field of artificial intelligence has gone into the design and analysis of planning algorithms. For the most part, the work has been guided by several strong, simplifying assumptions, most notably, that the plans will be performed in static, deterministic environments. Although these assumptions have made rigorous formal analysis possible, they make sense only for a limited number of applications, in which planning is done more or less in isolation of other reasoning tasks, and also in isolation of plan execution. Once one turns attention to agents that perform autonomously in dynamic, uncertain environments-including multi-agent environments-the assumptions made by traditional planners are violated, and it becomes necessary to rethink the traditional AI approaches to planning.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"47 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":"125089570","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}