检索结果-内蒙古大学图书馆

distributed Intelligence Systems for FMS Control Using Objects Modelled with Petri Nets (Scope Blackboard)

IFAC Proceedings Volumes 1991年第5期24卷 73-77页

作者： D.S. Devapriya B. Descotes-Genon P. Ladet Laboratoire d’Automatique de Grenoble E.N.S.I E.G. B.P. 46 38402 St. Martin d'Hères France

A flexible framework for the resolution of FMS control problems is developed based on the definition of problem solving nodes cooperating according to the opportunistic paradigm. This approach is unique in its node structure constructed using Petri nets interpreted as objects in Prolog and the generic representation of Knowledge Sources. Further, our strategy facilitates the use of the token player in real-time situations by effectively reducing the compilation difficulties arising from its non-incrementality.

关键词： distributed problem solving FMS Control Knowledge sources Real-time Blackboard systems Object-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Overcoming Communication Bottlenecks in distributed Intelligent Control of FMS

引用

IFAC Proceedings Volumes 1992年第7期25卷 257-261页

作者： D.S. Devapriya B. Descotes-Genon P. Ladet Laboratoire d’Automatique de Grenoble E.N.S.I.F.G. BP. 46 38402 St. Martin d’Hères France

An approach to reduce the effect of problems related to inter-node communication in distributed problem Solvers (DPS) is presented for the special case of real-time control of Computer Integrated Manufacturing Systems (CIMS). Some techniques based on the distribution of control and VLSI implementations of control Petri nets were presented in (DEVAPRIYA, 91c; 92a). The present paper discusses the necessity for furnishing the system with a panoplie of diverse communication techniques and letting the system learn to use the best technique for a given situation. This permits a high degree of flexibility of the system without sacrificing unduely on communication efficiency while avoiding bottleneck situations in the DPS network.

关键词： distributed problem solving distributed Artificial Intelligence Open Systems Blackboard Actors Petri Nets Object-Oriented Programming Manufacturing Systems SCOPE

来源：评论

学校读者我要写书评

暂无评论

Topology of large-scale engineering problem-solving networks

引用

Physical Review E 2004年第1期69卷 016113-016113页

作者： Dan Braha Yaneer Bar-Yam []Faculty of Engineering Sciences Ben-Gurion University P.O. Box 653 Beer-Sheva 84105 Israel[]New England Complex Systems Institute Cambridge Massachusetts 02138 USA

The last few years have led to a series of discoveries that uncovered statistical properties that are common to a variety of diverse real-world social, information, biological, and technological networks. The goal of the present paper is to investigate the statistical properties of networks of people engaged in distributed problem solving and discuss their significance. We show that problem-solving networks have properties (sparseness, small world, scaling regimes) that are like those displayed by information, biological, and technological networks. More importantly, we demonstrate a previously unreported difference between the distribution of incoming and outgoing links of directed networks. Specifically, the incoming link distributions have sharp cutoffs that are substantially lower than those of the outgoing link distributions (sometimes the outgoing cutoffs are not even present). This asymmetry can be explained by considering the dynamical interactions that take place in distributed problem solving and may be related to differences between each actor’s capacity to process information provided by others and the actor’s capacity to transmit information over the network. We conjecture that the asymmetric link distribution is likely to hold for other human or nonhuman directed networks when nodes represent information processing and using elements.

关键词： .distributions large-scale topology Asymmetric cutoffs regimes outgoing asymmetry cance statistical properties real-world problem-solving Bar-Yam technological networks distributed problem solving distribution of incoming actor

来源：评论

学校读者我要写书评

暂无评论

Effect of asynchronous execution and imperfect communication on max-sum belief propagation

引用

AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2023年第2期37卷 40-40页

作者： Zivan, Roie Rachmut, Ben Perry, Omer Yeoh, William Ben Gurion Univ Negev Ind Engn & Management David Ben Gurion Blvd IL-8410501 Beer Sheva Israel Washington Univ Comp Sci & Engn Dept 1 Brookings Dr St Louis MO 63130 USA

Max-sum is a version of belief propagation that was adapted for solving distributed constraint optimization problems. It has been studied theoretically and empirically, extended to versions that improve solution quality and converge rapidly, and is applicable to multiple distributed applications. The algorithm was presented both as synchronous and asynchronous algorithms. However, neither the differences in the performance of the two execution versions nor the implications of imperfect communication (i.e., massage delay and message loss) on the two versions have been investigated to the best of our knowledge. We contribute to the body of knowledge on Max-sum by: (1) Establishing the theoretical differences between the two execution versions of the algorithm, focusing on the construction of beliefs;(2) Empirically evaluating the differences between the solutions generated by the two versions of the algorithm, with and without message delay or loss;and (3) Establishing both theoretically and empirically the positive effect of damping on reducing the differences between the two versions. Our results indicate that, in contrast to recent published results indicating that message latency has a drastic (positive) effect on the performance of distributed local search algorithms, the effect of imperfect communication on Damped Max-sum (DMS) is minor. The version of Max-sum that includes both damping and splitting of function nodes converges to high quality solutions very fast, even when a large percentage of the messages sent by agents do not arrive at their destinations. Moreover, the quality of solutions in the different versions of DMS is dependent of the number of messages that were received by the agents, regardless of the amount of time they were delayed or if these messages are only a portion of the total number of messages that was sent by the agents.

关键词： Belief propagation distributed constraints distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

Cooperative problem solving by Intelligent Actors

引用

IFAC Proceedings Volumes 1983年第20期16卷 121-126页

作者： I. Futó T. Gergely Institute for Coordination of Computer Techniques Budapest PO Box 224 H-1368 Hungary Research Institute for Applied Computer Science Budapest PO Box 146 H-1502 Hungary

Cooperative problem solving is concerned where intelligent actors are organized into a unique system to understand and solve the given problem. The approach followed here is based on the theory of activity from cognitive psychology and also on a parallel computation model. An appropriate descriptive language is given based on logic simulation (TS-PROLOG). A medical diagnosis and therapy problem is considered to illustrate the developed methodology of dealing with cooperative l-actors.

关键词： distributed problem solving logic programming

来源：评论

学校读者我要写书评

暂无评论

A HYBRID BAYESIAN NETWORK-BASED MULTI-AGENT SYSTEM AND A distributed SYSTEMS ARCHITECTURE FOR THE DRUG CRIME KNOWLEDGE MANAGEMENT

引用

International Journal of Information Technology & Decision Making 2003年第4期2卷 557-576页

作者： PARAG C. PENDHARKAR RAHUL BHASKAR School of Business Administration Pennsylvania State University at Harrisburg 777 W. Harrisburg Pike Middletown PA 17078 USA Information Systems School of Business CSU-Fullerton 800 California State University at Fullerton North College Blvd. Fullerton CA 92831 USA

In this paper, we describe an approach for building a hybrid Bayesian network-based multi-agent system for drug crime knowledge management. We use distributed artificial intelligence architecture to create a multi-agent information system that integrates distributed knowledge sources and information to aid decision-making. Our comparison of the hybrid system with a previously developed stand-alone expert system Sherpa , which was in use at a large drug crime investigation facility, shows that the current system compares similar to the existing system in terms of efficiency and effectiveness of knowledge management. We illustrate how the proposed hybrid bayesian network-based can be implemented in the distributed computing network environment.

关键词： distributed artificial intelligence multi-agent information systems distributed problem solving distributed computing

来源：评论

学校读者我要写书评

暂无评论

An investigation of the vulnerabilities of scale invariant dynamics in large teams 11

An investigation of the vulnerabilities of scale invariant d...

引用

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

作者： Robin Glinton Paul Scerri Katia Sycara Carnegie Mellon University Pittsburgh PA

ISBN: (纸本)9780982657164

Large heterogeneous teams in a variety of applications must make joint decisions using large volumes of noisy and uncertain data. Often not all team members have access to a sensor, relying instead on information shared by peers to make decisions. These sensors can become permanently corrupted through hardware failure or as a result of the actions of a malicious adversary. Previous work showed that when the trust between agents was tuned to a specific value the resulting dynamics of the system had a property called scale invariance which led to agents reaching highly accurate conclusion with little communication. In this paper we show that these dynamics also leave the system vulnerable to most agents coming to incorrect conclusions as a result of small amounts of anomalous information maliciously injected in the system. We conduct an analysis that shows that the efficiency of scale invariant dynamics is due to the fact that large number of agents can come to correct conclusions when the difference between the percentage of agents holding conflicting opinions is relatively small. Although this allows the system to come to correct conclusions quickly, it also means that it would be easy for an attacker with specific knowledge to tip the balance. We explore different methods for selecting which agents are Byzantine and when attacks are launched informed by the analysis. Our study reveals global system properties that can be used to predict when and where in the network the system is most vulnerable to attack. We use the results of this study to design an algorithm used by agents to effectively attack the network, informed by local estimates of the global properties revealed by our investigation.

关键词： self-organisation distributed problem solving emergent behavior

来源：评论

学校读者我要写书评

暂无评论

Agreeing on plans through iterated disputes 10

Agreeing on plans through iterated disputes

引用

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

作者： Alexandros Belesiotis Michael Rovatsos Iyad Rahwan The University of Edinburgh Edinburgh UK Masdar Institute of Science & Technology Abu Dhabi UAE and MIT and The University of Edinburgh UK

ISBN: (纸本)9780982657119

Autonomous agents transcend their individual capabilities by cooperating towards achieving shared goals. The different viewpoints agents have on the environment cause disagreements about the anticipated effects of plans. Reaching agreement requires the resolution of such inconsistencies and the alignment of the agents' *** present a dialogue protocol that enables agents to discuss candidate plans and reach agreements. The dialogue is based on an argumentation process in the language of situation calculus. Agreement is reached through persuasion, thereby aligning the planning beliefs of the *** describe our abstract iterated dialogue protocol, and extend it for the specific problem of arguing about plans. We show that our method always terminates and produces sound results. Furthermore, we detail a set of extensions to simplify reasoning and reduce the exchanged information.

关键词： argumentation communication protocols planning distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

A general, fully distributed multi-agent planning algorithm 10

A general, fully distributed multi-agent planning algorithm

引用

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

作者： Raz Nissim Ronen I. Brafman Carmel Domshlak Ben-Gurion University Israel Technion Israel

ISBN: (纸本)9780982657119

We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure the consistency of these coordination points. To solve the distributed CSP efficiently, we must modify existing methods to take advantage of the structure of the underlying planning problem, m multi-agent planning domains with limited agent interaction, our algorithm empirically shows scalability beyond state of the art centralized solvers. Our work also provides a novel, real-world setting for testing and evaluating distributed constraint satisfaction algorithms in structured domains and illustrates how existing techniques can be altered to address such structure.

关键词： distributed constraint satisfaction multi-agent planning distributed problem solving single-agent planning

来源：评论

学校读者我要写书评

暂无评论

AED: An Anytime Evolutionary DCOP Algorithm 20

AED: An Anytime Evolutionary DCOP Algorithm

引用

Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems

作者： Saaduddin Mahmud Moumita Choudhury Md. Mosaddek Khan Long Tran-Thanh Nicholas R. Jennings University of Dhaka Dhaka Bangladesh University of Southampton Southampton United Kingdom Imperial College London London United Kingdom

ISBN: (纸本)9781450375184

Evolutionary optimization is a generic population-based metaheuristic that can be adapted to solve a wide variety of optimization problems and has proven very effective for combinatorial optimization problems. However, the potential of this metaheuristic has not been utilized in distributed Constraint Optimization problems (DCOPs), a well-known class of combinatorial optimization problems prevalent in Multi-Agent Systems. In this paper, we present a novel population-based algorithm, Anytime Evolutionary DCOP (AED), that uses evolutionary optimization to solve DCOPs. In AED, the agents cooperatively construct an initial set of random solutions and gradually improve them through a new mechanism that considers an optimistic approximation of local benefits. Moreover, we present a new anytime update mechanism for AED that identifies the best among a distributed set of candidate solutions and notifies all the agents when a new best is found. In our theoretical analysis, we prove that AED is anytime. Finally, we present empirical results indicating AED outperforms the state-of-the-art DCOP algorithms in terms of solution quality.

关键词： dcops distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：