发布求助
文献互助 智能选刊 最新文献

Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)最新文献

筛选
英文 中文
Building integrated robots for soccer competition 为足球比赛打造一体化机器人
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699288
Wei-Min Shen, Jafar Adibi, Rogelio Adobbati, Bonghan Cho, Ali Erdem, H. Moradi, B. Salemi, S. Tejada
{"title":"Building integrated robots for soccer competition","authors":"Wei-Min Shen, Jafar Adibi, Rogelio Adobbati, Bonghan Cho, Ali Erdem, H. Moradi, B. Salemi, S. Tejada","doi":"10.1109/ICMAS.1998.699288","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699288","url":null,"abstract":"Middle sized robot soccer competition provides an excellent opportunity for distributed robotic systems. In particular, a team of dog sized robot players must perform real time visual recognition, navigate in a dynamic field, track moving objects and collaborate with teammates (R.C. Arkin, 1987). Our design philosophy for the system architecture is that we view each robot as a complete and active physical entity, who can intelligently maneuver and perform in realistic and challenging surroundings. In order to survive the rapidly changing environment in a soccer game, each robot must be physically strong, computationally fast, and behaviorally accurate. Considerable importance is given to an individual robot's ability to perform on its own without any off-board resources such as global, birds eye view cameras or remote computing processors. Each robot's behavior must base on its own sensor data, decision making software, and eventually communication with teammates.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"19 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":"125273291","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}
引用次数: 1
A market protocol for decentralized task allocation 分散任务分配的市场协议
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699077
W. E. Walsh, Michael P. Wellman
{"title":"A market protocol for decentralized task allocation","authors":"W. E. Walsh, Michael P. Wellman","doi":"10.1109/ICMAS.1998.699077","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699077","url":null,"abstract":"We present a decentralized market protocol for allocating tasks among agents that contend for scarce resources. Agents trade tasks and resources at prices determined by an auction protocol. We specify a simple set of bidding policies that, along with the auction mechanism, exhibits desirable convergence properties. The system always reaches quiescence. If the system reaches quiescence below the consumer's reserve price for the high level task, it will be in a solution state. If the system finds a solution it will reach quiescence in a solution state. Experimental evidence supports our conjecture that the system will converge to a solution when one exists and the consumer bids sufficiently high. We describe the system's application to and implementation in an agent-based digital library.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"62 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":"121136080","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}
引用次数: 201
Data Gardens: an artistic proposal towards the representation of distributed and dynamic data using multiagent systems 数据花园:对使用多代理系统表示分布式和动态数据的艺术建议
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699250
G. Hutzler, B. Gortais, A. Drogoul
{"title":"Data Gardens: an artistic proposal towards the representation of distributed and dynamic data using multiagent systems","authors":"G. Hutzler, B. Gortais, A. Drogoul","doi":"10.1109/ICMAS.1998.699250","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699250","url":null,"abstract":"We suggest a new paradigm for the representation of data, which is best suited for the real-time representation (visual and sonorous) of complex systems, real or simulated. The basic idea lies in the use of the garden metaphor to represent the dynamic evolution of interacting and organizing entities. In this proposal, multiagent systems are used to map between given complex systems and their garden-like representation, which we call Data Gardens (DG). The evolution of these Data Gardens is driven both by the real-time arrival of data from the system to represent and by the endogenous reaction of the multiagent system, immersing the user within a visual and sonorous atmosphere from which he can gain an intuitive understanding of the system. The principles exposed may ultimately be applied to the representation of multiagent systems themselves.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"35 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":"121145398","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}
引用次数: 1
Making SharedPlans more concise and easier to reason about 使共享计划更简洁，更容易推理
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699249
Luke Hunsberger
{"title":"Making SharedPlans more concise and easier to reason about","authors":"Luke Hunsberger","doi":"10.1109/ICMAS.1998.699249","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699249","url":null,"abstract":"When a group of agents get together to collaborate on some complex group action, collaboration does not just happen. It requires the existence or formation of mutual beliefs about the capabilities and commitments of agents responsible for doing various actions, the adoption by individual agents of various intentions (not only intentions to do actions, but also intentions that various propositions hold), and a process of plan elaboration whereby a partial plan is expanded toward completion as a full plan. Grosz and Kraus' SharedPlans (1996; 1997) is a general theory of collaborative planning that accommodates multi-level action decomposition hierarchies, models the collaborative support provided by group members to those agents or subgroups responsible for doing constituent actions, specifies what it means for a group of agents to have a partial plan, and explicates the process whereby a partial plan may be elaborated into a full plan. This paper presents a reformulation of SharedPlans that: introduces SharedPlan Trees to make explicit the complex structure of SharedPlans; simplifies and reorganizes the SharedPlan meta-predicate definitions without sacrificing their expressiveness; and enables conditions to be specified under which a set of important theorems about agents and their SharedPlans may be proven.","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":"115149574","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}
引用次数: 20
How to explore your opponent's strategy (almost) optimally 如何(几乎)最佳地探索对手的策略
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699033
D. Carmel, Shaul Markovitch
{"title":"How to explore your opponent's strategy (almost) optimally","authors":"D. Carmel, Shaul Markovitch","doi":"10.1109/ICMAS.1998.699033","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699033","url":null,"abstract":"Presents a lookahead-based exploration strategy for a model-based learning agent that enables exploration of the opponent's behavior during interaction in a multi-agent system. Instead of holding one model, the model-based agent maintains a mixed opponent model, a distribution over a set of models that reflects its uncertainty about the opponent's strategy. Every action is evaluated according to its long run contribution to the expected utility and to the knowledge regarding the opponent's strategy. We present an efficient algorithm that returns an almost optimal exploration strategy against a given mixed model, and a learning method for acquiring a mixed model consistent with the opponent's past behavior. We report experimental results in the Iterated Prisoner's Dilemma game that demonstrate the superiority of the lookahead-based exploration strategy over other exploration methods.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"38 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":"122937420","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}
引用次数: 24
A systematic market approach to distributed constraint problems 分布式约束问题的系统市场方法
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1017/S0890060499133079
H. V. Dyke, Parunak, Allen Ward, Ward Synthesis, John Sauter
{"title":"A systematic market approach to distributed constraint problems","authors":"H. V. Dyke, Parunak, Allen Ward, Ward Synthesis, John Sauter","doi":"10.1017/S0890060499133079","DOIUrl":"https://doi.org/10.1017/S0890060499133079","url":null,"abstract":"MarCon (Market-based Constraints) applies market-based control to distributed constraint problems. It offers a new approach to distributing constraint problems that avoids challenges to current approaches in some domains, and it provides a systematic way to apply markets to many problems. Constraint agents interact with one another via the variable agents in which they share an interest, expressing their preferences over sets of assignments. Each variable integrates this information from the constraints interested in it and provides feedback that enables the constraints to shrink their sets of assignments until they converge on a solution. MarCon has been tested in the domain of mechanical design, in which its set-narrowing process is particularly useful.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"19 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":"131121399","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}
引用次数: 37
Verifiable semantics for agent communication languages 代理通信语言的可验证语义
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699219
M. Wooldridge
{"title":"Verifiable semantics for agent communication languages","authors":"M. Wooldridge","doi":"10.1109/ICMAS.1998.699219","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699219","url":null,"abstract":"This paper examines the issue of developing semantics for agent communication languages. In particular it considers the problem of giving a verifiable semantics for such languages, a semantics where conformance (or otherwise) to the semantics could be determined by an independent observer. These problems are precisely defined in an abstract formal framework. Using this framework, a number of example agent communication frameworks are examined with respect to the problem of verifying conformance. A discussion is then presented of the various options open to designers of agent communication languages, with respect to the problem of verifying conformance.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"32 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":"130556761","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}
引用次数: 85
On social commitment, roles and preferred goals 关于社会承诺、角色和首选目标
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699035
L. Cavedon, L. Sonenberg
{"title":"On social commitment, roles and preferred goals","authors":"L. Cavedon, L. Sonenberg","doi":"10.1109/ICMAS.1998.699035","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699035","url":null,"abstract":"We present a framework for modelling various types of influences on an agent's prioritising of its goals, with emphasis on obligations arising from the agent's roles in designated relationships. The framework is based on work of Bell and Huang on goal hierarchies and intention revision, and incorporates notions related to social goal adoption and social commitment as discussed by Castelfranchi. We use roles as an abstraction to enable the agent designer to scope the sphere of influence of one agent with respect to another. Roles then provide a way to specify how the agent should balance competing obligations from different relationships, and from tensions between personal preferences and social obligations. This approach seems to integrate well with the use of team plans for implementing collaborative behaviour.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"33 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":"130660505","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}
引用次数: 75
Negotiations with inaccurate payoff values 支付价值不准确的谈判
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699280
S. Matsubara, M. Yokoo
{"title":"Negotiations with inaccurate payoff values","authors":"S. Matsubara, M. Yokoo","doi":"10.1109/ICMAS.1998.699280","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699280","url":null,"abstract":"We have developed a new method for negotiation with inaccurate payoff values. It is difficult to know accurate payoff values because the available resources of each agent are limited. The inaccuracy of payoff values can cause negotiation failure. However, if the agents know the correct values, they can reach an agreement. Advising, i.e. giving self-estimation values to the other agent, is one way to recover from a negotiation failure. Simple methods for incorporating advice into evaluation, such as by arithmetic mean, do not work well because the advisee may seriously suffer from deception. In order to overcome this drawback, we propose a method that incorporates advice into evaluation. This method is based on similarity between the adviser's estimation and the advisee's estimation. Our method is efficient and can suppress deception fairly well so agents are motivated to adopt this method. Our experiments use example problems, and the results show that our method is efficient and gives an incentive to adopt itself.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"41 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":"121314250","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}
引用次数: 5
Subsumption and survivability in bidding for bandwidth 带宽竞标中的包容性和生存性
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699229
J. Bigham, A. L. Hayzelden
{"title":"Subsumption and survivability in bidding for bandwidth","authors":"J. Bigham, A. L. Hayzelden","doi":"10.1109/ICMAS.1998.699229","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699229","url":null,"abstract":"Cooperative agents provide layers of competence to control a telecom network. Higher planning layers coordinate lower layers by seeking to globally optimise the survivability of the network. It is shown that the process of finding the best flow in the network can be viewed as a distributed auction where the prices are obtained from the derivatives of the survivability function. In the application, a simple measure of survivability maps into familiar routing heuristics.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"3 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":"123922970","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}
引用次数: 5
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信