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

Multi-agent simulation of complex heterogeneous models in scientific computing

MATHEMATICS AND COMPUTERS IN SIMULATION 1997年第1期44卷 43-59页

作者： Joshi, A Drashansky, T Rice, J Weerawarana, S Houstis, E PURDUE UNIV DEPT COMP SCI W LAFAYETTE IN 47907 USA

Electronic prototyping is becoming a part of every scientific inquiry and product design, and is the focus of research in the new scientific field of Computational Science and Engineering. The new grand challenge here is the rapid prototyping of manufactured artifacts and the rapid solution to problems with numerous interrelated elements. This, in turn, requires the fast, accurate simulation of physical processes and design optimization using knowledge and computational models from multiple disciplines in science and engineering. In this paper, we formulate a mathematical and software framework for complex rapid prototyping. Its design utilizes the current computer network infrastructures and high performance computation technologies. Its functionality includes adaptability and intelligence with respect to end-users and hardware platforms. We present the architecture of this framework, named SciAgents, using a multi-agent software model encapsulating a collaborating mathematical method. We also briefly discuss some issues related to legacy software reuse that we faced in the implementation. The design of SciAgents allows wholesale reuse of scientific software and provides a natural approach to parallel and distributed problem solving.

关键词： distributed problem solving agent-based computing simulation heterogeneous models software reuse and evolution

来源：评论

学校读者我要写书评

暂无评论

Application of an autonomous agent network to support the architecture of a holonic manufacturing system

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2002年第12期20卷 931-942页

作者： Tiwari, MK Mondal, S Natl Inst Foundry & Forge Technol Dept Mfg Engn Ranchi 834003 Bihar India Natl Inst Foundry & Forge Technol Dept Met & Mat Engn Ranchi 834003 Bihar India

To remain a competitive force in the world market, manufacturing enterprises must design and produce new products in an effective way. To reduce the product launching time, manufacturing enterprises must be versatile, open to changes, and capable of designing and modifying their own facilities and processes efficiently for the design of new products. In this context, the concept of autonomous, adaptive, cognitive and cooperating entities known as "holons" is conceived which leads to the evolution of a holonic manufacturing system (HMS) where highly distributed control paradigms are adopted to alleviate the problems related to frequent process disturbances. In order to streamline the functioning of an HMS, it is necessary to form an efficient, flexible and responsive network of agents, which are intra-holonic entities that inherit the same characteristics as the holons. This network of agents can be termed an autonomous agent network. The agent is formed by the parties, which are the functional units of the holonic manufacturing system. The aim of this paper is to specify the communication protocols and subsequently synthesise and cluster the individual parties into autonomous agents in accordance with the basic constraints of a holonic manufacturing system. Here a fuzzy c-means clustering algorithm is proposed to club the parties to capture effectively the uncertainty and imprecision associated with them. Besides the grouping of the parties to form agents, the proposed fuzzy-based clustering algorithm ensures that the agents formed are more amenable to the dynamic environment prevailing on the shop floor of present day automated manufacturing systems and thus makes the essence of a holonic manufacturing system successful. Keeping in mind the imprecision, uncertainty, and conflicting nature of objectives, the proposed approach aptly models the problem, and its applicability is exemplified by a test problem.

关键词： communication protocol distributed problem solving holonic manufacturing system quick response manufacturing

来源：评论

学校读者我要写书评

暂无评论

Every team deserves a second chance: an extended study on predicting team performance

引用

AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2017年第5期31卷 1003-1054页

作者： Marcolino, Leandro Soriano Lakshminarayanan, Aravind S. Nagarajan, Vaishnavh Tambe, Milind Univ Lancaster Lancaster LA1 4WA Lancs England Indian Inst Technol Madras Madras 600036 Tamil Nadu India Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Southern Calif Los Angeles CA 90089 USA

Voting among different agents is a powerful tool in problem solving, and it has been widely applied to improve the performance in finding the correct answer to complex problems. We present a novel benefit of voting, that has not been observed before: we can use the voting patterns to assess the performance of a team and predict their final outcome. This prediction can be executed at any moment during problem-solving and it is completely domain independent. Hence, it can be used to identify when a team is failing, allowing an operator to take remedial procedures (such as changing team members, the voting rule, or increasing the allocation of resources). We present three main theoretical results: (1) we show a theoretical explanation of why our prediction method works;(2) contrary to what would be expected based on a simpler explanation using classical voting models, we show that we can make accurate predictions irrespective of the strength (i.e., performance) of the teams, and that in fact, the prediction can work better for diverse teams composed of different agents than uniform teams made of copies of the best agent;(3) we show that the quality of our prediction increases with the size of the action space. We perform extensive experimentation in two different domains: Computer Go and Ensemble Learning. In Computer Go, we obtain high quality predictions about the final outcome of games. We analyze the prediction accuracy for three different teams with different levels of diversity and strength, and show that the prediction works significantly better for a diverse team. Additionally, we show that our method still works well when trained with games against one adversary, but tested with games against another, showing the generality of the learned functions. Moreover, we evaluate four different board sizes, and experimentally confirm better predictions in larger board sizes. We analyze in detail the learned prediction functions, and how they change according to each te

关键词： Teamwork Collective intelligence distributed problem solving Social choice theory Single and multiagent learning

来源：评论

学校读者我要写书评

暂无评论

problem-solving STRATEGIES FOR OPEN INFORMATION-SYSTEMS

引用

KNOWLEDGE-BASED SYSTEMS 1995年第5期8卷 235-248页

作者： KAULA, R Computer Information Systems Department College of Business Administration Southwest Missouri State University 901 South National Avenue Springfield MO 65804 USA

Open information systems based on the open intelligent information systems architecture require appropriate strategies for problem solving. The problem solving strategies are the inferencing and control strategies that should exist in a knowledge-based type environment. The paper outlines the necessary strategies. The proposed strategies essentially augment the existing problem solving strategies, such as backward chaining, forward chaining and mixed chaining. The strategies are implemented in Prolog, and demonstrated using a prototype case.

关键词： OPEN INFORMATION SYSTEMS distributed problem solving INFERENCE CONTROL MECHANISMS

来源：评论

学校读者我要写书评

暂无评论

Asynchronous backtracking without adding links:: a new member in the ABT family

引用

ARTIFICIAL INTELLIGENCE 2005年第1-2期161卷 7-24页

作者： Bessière, C Maestre, A Brito, I Meseguer, P CSIC IIIA Bellaterra 08193 Spain CNRS LIRMM F-34392 Montpellier France

Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constraint networks. They differ in the way they store nogoods, but they all use additional communication links between unconnected agents to detect obsolete information. In this paper, we propose a new asynchronous backtracking algorithm which does not need to add links between initially unconnected agents. To make the description simpler and to facilitate the comparisons between algorithms, we present a unifying framework from which the new algorithm we propose, as well as existing ones, are derived. We provide an experimental evaluation of these algorithms. (C) 2004 Elsevier B.V. All rights reserved.

关键词： distributed problem solving constraint satisfaction search

来源：评论

学校读者我要写书评

暂无评论

Performance enhancement of a contract net protocol based system through instance-based learning

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 2005年第2期35卷 345-358页

作者： Deshpande, U Gupta, A Basu, A VNIT Nagpur Maharashtra India Indian Inst Technol Kharagpur 721302 W Bengal India

The contract net protocol (CNP) is a widely used coordination mechanism in multiagent systems. It has a lot of communication overhead due to the broadcast of the task announcements. The performance of the CNP degrades drastically when the number of communicating agents and the number of tasks announced increases. Hence, it has problems of scalability. In order to overcome this limitation, an instance-based learning (IBL) mechanism is designed that uses previously stored instances in order to select a target agent. This avoids the expensive bidding process. The scheme is implemented in a simulated distributed hospital system where the CNP is used for resource sharing across hospitals. Experimental results demonstrate that with the incorporation of the IBL, the system performance improves significantly. The system is better scalable with respect to the number of tasks.

关键词： contract net protocol (CNP) distributed problem solving instance-based learning (IBL) multiagent systems

来源：评论

学校读者我要写书评

暂无评论

Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies

引用

INFORMATION SCIENCES 2008年第4期178卷 1110-1132页

作者： Seow, Kiam Tian Sim, Kwang Mong Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore Hong Kong Baptist Univ Dept Comp Sci Kowloon Hong Kong Peoples R China

In this paper, we propose a distributed agent model that applies belief-desire-intention (BDI) reasoning and negotiation for addressing the linear assignment problem (LAP) collaboratively. In resource allocation, LAP is viewed as seeking a concurrent allocation of one different resource for every task to optimize a linear sum objective function. The proposed model provides a basic agent-based foundation needed for efficient resource allocation in a distributed environment. A distributed agent algorithm that has been developed based on the BDI negotiation model is examined both analytically and experimentally. To improve performance in terms of average negotiation speed and solution quality, two initialization heuristics and two different reasoning control strategies are applied, with the latter yielding different variants of the basic algorithm. Extensive simulations suggest that all the heuristic-algorithm combinations can produce a near optimal solution soon enough in some specific sense. The significance and applicability of the research work are also discussed. (c) 2007 Elsevier Inc. All rights reserved.

关键词： distributed problem solving belief-desire-intention (BDI) negotiation model reasoning control collaborative linear assignment

来源：评论

学校读者我要写书评

暂无评论

DP: A paradigm for anonymous remote computation and communication for cluster computing

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2001年第10期12卷 1052-1065页

作者： Johnson, BK Karthikeyan, R Ram, DJ Indian Inst Technol Dept Comp Sci & Engn Distributed & Object Syst Grp Madras 600036 Tamil Nadu India

This paper explores the transparent programmability of communicating parallel tasks in a Network of Workstations (NOW). Programs which are tied up with specific machines will not be resilient to the changing conditions of a NOW. The distributed Pipes (DP) model enables location independent intertask communication among processes across machines. This approach enables migration of communicating parallel tasks according to runtime conditions. A transparent programming model for a parallel solution to Iterative Grid Computations using DP is also proposed. Programs written using the model are resilient to the heterogeneity of nodes and changing conditions in the NOW. They are also devoid of any network related code. The design of runtime support and function library support are presented. An engineering problem, namely, the Steady State Equilibrium problem, is studied over the model. The performance analysis shows the speedup due to parallel execution and scaled down memory requirements. We present a case where the effect of communication overhead can be nullified to achieve a linear to super-linear speedup. The analysis discusses performance resilience of Iterative Grid Computations and characterizes synchronization delay among subtasks;and the effect of network overhead and load fluctuations on performance. The performance saturation characteristics of such applications are also studied.

关键词： parallel programming data parallelism task parallelism network of workstations loosely coupled distributed systems distributed problem solving distributed pipes steady state distribution

来源：评论

学校读者我要写书评

暂无评论

Cooperative multiagent systems: A personal view of the state of the art

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1999年第1期11卷 133-142页

作者： Lesser, VR Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA

Scientific research and practice in multiagent systems focuses on constructing computational frameworks, principles, and models for how both small and large societies of intelligent, semiautonomous agents can interact effectively to achieve their goals. This article provides a personal view of the key application areas for cooperative multiagent systems, the major intellectual problems in building such systems, the underlying principles governing their design, and the major directions and challenges for future developments in this field.

关键词： multiagent systems coordination cooperation distributed problem solving distributed artificial intelligence computational organizations

来源：评论

学校读者我要写书评

暂无评论

Integrating task parallelism in data parallel languages for parallel programming on NOWs

引用

CONCURRENCY-PRACTICE AND EXPERIENCE 2000年第13期12卷 1291-1315页

作者： Binu, KJ Ram, DJ Indian Inst Technol Dept Comp Sci & Engn Distributed & Object Syst Grp Madras 600036 Chennai India

A number of high-level parallel programming platforms for networks of workstations (NOWs) have been developed in recent times. Most of these platforms target the exploitation of data parallelism in applications. They do not allow expressibility of applications as a collection of tasks along with their precedence relationships, As a result, the control or task parallelism in an application cannot be expressed or exploited. The current work aims at integrating the notion of task parallelism and precedence relationships among constituting tasks to such high-level data parallel platforms for NOWs, Our model of integration provides for arbitrary nesting of data and task parallel modules. Also, the precedence relationships are clearly reflected from the program structure. The model relieves the programmer from the need to design applications for non-determinism in the order of completion of constituting tasks. The design of the runtime support as well as system-level book keeping is discussed, The model is general enough to be applied to a wide range of data parallel platforms. A specific case of integrating the model into anonymous remote computing (ARC), a data parallel programming platform, is presented. The performance related aspects are also discussed. Copyright (C) 2000 John Wiley & Sons, Ltd.

关键词： parallel programming data parallelism task parallelism network of workstations loosely coupled distributed systems distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：