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

FORS - A GRAPH BASED DESIGN ENVIRONMENT

COMPUTERS IN INDUSTRY 1990年第4期15卷 303-315页

作者： PAPANIKOLOPOULOS, NP CARNEGIE MELLON UNIV DEPT ELECT & COMP ENGNPITTSBURGHPA 15213 CARNEGIE MELLON UNIV INST ROBOTPITTSBURGHPA 15213

Introduces flexible organizations (FORS), a design environment based on a network representation of a design. Components of the design network; Provision of icon based interface; Use of the system in the mechanical de... 详细信息

关键词： Concurrent design distributed problem solving Flexible organizations Object-oriented programming Simultaneous engineering

来源：评论

学校读者我要写书评

暂无评论

An agent-based approach to solve dynamic meeting scheduling problems with preferences

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2007年第6期20卷 857-873页

作者： BenHassine, Ahlem Ho, Tu Bao Knowledge Creating Commun Res Ctr Computat Linguist Grp Language Grid Project Kyoto 6190289 Japan JAIST Sch Knowledge Sci Knowledge Creating Methodol Lab Nomi Ishikawa 9231292 Japan

Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is defined by a variety of features. The MS problem is naturally distributed and especially subject to many alterations. In addition, this problem is characterized by the presence of users' preferences that turn it into a search for an optimal rather than a feasible solution. However, in real-world applications users usually have conflicting preferences, which makes the solving process an NP-hard problem. Most research efforts in the literature, adopting agent-based technologies, tackle the MS problem as a static problem. They often share some common properties: allowing the relaxation of any user's time restriction, not dealing with achieving any level of consistency among meetings to enhance the efficiency of the solving process, not tackling the consequences of the dynamic environment, and especially not addressing the real difficulty of distributed systems which is the complexity of message passing operations. In an attempt to facilitate and streamline the process of scheduling meetings in,my organization, the main contribution of this work is a new scalable agent-based approach for any dynamic MS problem (that we called MSRAC, for Meeting Scheduling with Reinforcement of Arc Consistency). In this approach we authorize only the relaxation of users' preferences while maintaining arc-consistency on the problem. The underlying protocol can efficiently reach the optimal solution (satisfying some predefined optimality criteria) whenever possible, using only minimum localized asynchronous communications. This purpose is achieved with minimal message passing while trying to preserve at most the privacy of involved users. Detailed experimental results on randomly generated MS problems show that MSRAC is scalable and it leads to speed up over other approaches, especially for large problems with strong

关键词： dynamic valued constraint satisfaction problems meeting scheduling problems local consistency multi-agent system distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

Optimal configuration of assembly supply chains using analytical target cascading

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2010年第23期48卷 6883-6907页

作者： Qu, Ting Huang, George Q. Cung, Van-Dat Mangione, Fabien Univ Hong Kong Dept Ind & Mfg Syst Engn Hong Kong Hong Kong Peoples R China UJF Grenoble INP CNRS Lab G SCOPUMR 5272 Grenoble 1 France

This paper proposes to apply analytical target cascading (ATC) for configuring assembly supply chains with convergent structures. Individual enterprises in a supply chain are represented as separate elements in an ATC hierarchy. They are able to maintain autonomous and heterogeneous decision systems for optimising their private decision variables and objectives. They collaborate vertically and laterally along the ATC hierarchy through their common decisions to achieve the overall consistency and optimality. ATC offers a competitive balance between computational efficiency and effectiveness while providing an opportunity for parallel computation to further improve the efficiency. This paper also investigates the feasibility for individual enterprises to set local targets while participating in the supply chain configuration (SCC). SCC usually involves discrete decision variables, causing significant difficulties for existing ATC techniques to achieve system consistency. Therefore, a new consistency scheme has to be proposed in this paper, including two techniques: importance weighting factor (IWF) and dynamic constraints (DC). A case study is used to demonstrate the application of the ATC method for solving typical SCC problems. A series of comparative analyses are conducted to identify the strengths of the ATC method and demonstrate the effectiveness of the proposed consistency scheme.

关键词： analytical target cascading supply chain configuration autonomous decision systems distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

BIDIRECTIONAL RING-BASED TERMINATION DETECTION ALGORITHMS FOR distributed COMPUTATIONS

引用

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1989年第5期136卷 415-422页

作者： ARORA, RK GUPTA, MN Computer Services Center Indian Institute of Technology New Delhi India

An interesting and difficult problem in the area of distributed problem solving is that of detecting the termination of distributed programs soon after their assigned task is over. In a distributed environment, processes of a distributed program communicate only through exchange of messages and no process maintains complete information about the state of other processes. Additional efforts are, therefore, required to detect the situation when the processes of a distributed program complete their assigned task. The problem of detection of such a situation was first brought into prominence by N. Francez (1980). The problem requires taking snapshots over the states of the processes and then testing the termination criterion over these states. So far, reported algorithms can be broadly categorised into classes depending upon the topology employed namely a unidirectional ring, a spanning tree, and an arbitrary network. The authors explore yet another alternative in the form of bidirectional control communication around a ring. This type of communication potentially offers selective advantages of all the earlier approaches and depicts an approach lying between unidirectional communication and communication in all directions.

关键词： Communication Research less-favoured region Messages prominences Bidirectional termination criteria Detection algorithms distributed software distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

A multi-agent architecture for cooperative inter-jurisdictional traffic congestion management

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2002年第5-6期10卷 507-527页

作者： Logi, F Ritchie, SG Tech Univ Munich Fachgebiet Verkehrstech & Verkehrsplanung D-80290 Munich Germany Univ Calif Irvine Inst Transport Studies Dept Civil & Environm Engn Irvine CA 92697 USA

This paper describes CARTESIUS, an innovative multi-agent architecture for the provision of real-time decision support to Traffic, Operations Center personnel for coordinated, inter-jurisdictional traffic congestion management on freeway and surface street (arterial) networks. CARTESIUS is composed of two interacting knowledge-based systems that perform cooperative reasoning and resolve conflicts, for the analysis of non-recurring congestion and the on-line formulation of integrated control plans. The two agents support incident management operations for a freeway and an adjacent arterial subnetwork and interact with human operators, - determining control recommendations in response to the occurrence of incidents. The multi-decision maker approach. adopted by CARTESIUS reflects the spatial and administrative organization of traffic management agencies in US cities, providing a cooperative solution that exploits the agencies' willingness to cooperate and unify their problem-solving capabilities, yet preserves the different levels of authority and the inherent distribution of data and expertise. The interaction between the agents is based on the functionally accurate, cooperative paradigm, a distributed problem solving approach aimed at producing consistent solutions without requiring the agents to have shared access to all globally available information. The cornerstone of this approach is the assumption that effective solutions can be efficiently obtained even when complete and up-to-date information is not directly available to the agents, thus reducing the need for complex data communication networks and synchronization time delays. The simulation-based evaluation of the system performance validates this assumption. The paper focuses on the distributed architecture of the agents and on their communication and decision making characteristics. (C) 2002 Elsevier Science Ltd. All rights reserved.

关键词： incident management decision support distributed problem solving functionally accurate cooperation traffic control

来源：评论

学校读者我要写书评

暂无评论

Modeling interaction strategies using POS: An application to soccer robots

引用

APPLIED INTELLIGENCE 2006年第1期25卷 7-21页

作者： Koning, Jean-Luc Oudeyer, Pierre-Yves INP Grenoble Grenoble Natl Inst Technol F-25902 Valence 9 France Sony CSL Paris F-75005 Paris France

As seen earlier POS is a general agent conversation protocol engineering formalism that has proved efficient when used in communities of software information agents. The aim of this paper is to show how much POS is simple, easy to use, and very appropriate for implementing interaction protocols in a collaborative agent setting. In order to exemplify our approach we focus on an application domain with real time constraints such as soccer robots and show how an inherently symbolic abstract system like POS can be neatly integrated with agents whose internal architecture is reactive and relies on bottom-up behavior-based techniques. First, we shortly discuss aspects of heterogeneity with respect to soccer robots and present the RoboCup experimental setting. Then we sketch the difficulties that arise when trying to coordinate an heterogeneous team with conventional methods. In response, we introduce some elements of the POS (Protocol Operational Semantics) model. The following sections examine several basic behaviors of the JavaSoccer simulation environment as it is later used along with TeamBots to highlight POS' capabilities, demonstrate how POS is a suited theoretical tool and leads to extremely compact and modular code due to its high expressive power, and discuss the obtained results. Finally we conclude the article with a comparison to related works as well as some perspectives about the engineering of interaction protocols.

关键词： distributed problem solving operational semantics soccer-robot agent conversation protocols

来源：评论

学校读者我要写书评

暂无评论

A DPS-based system modelling method for 3D-structures simulation in manufacturing processes

引用

SIMULATION MODELLING PRACTICE AND THEORY 2009年第5期17卷 935-954页

作者： Iribarne, Luis Ayala, Rosa Antonio Torres, Jose Univ Almeria Appl Comp Grp Almeria 04120 Spain Univ Almeria Comp & Environm Grp Almeria 04120 Spain

In the field of engineering, guidelines and computerisation are important to facilitate the resolution of complex problems. Engineers apply computer techniques of distributed problem solving (DPS) to design and simulation tasks, such as in industrial manufacture (e.g., simulation of aircraft, modelling of structures and mass customization). An important application of these and other computer-aided techniques is the design and manufacture of industrial greenhouses in south-eastern Spain. The importance of greenhouses in this region led to the establishment of European Standard UNE-EN 13031-1 for the design and construction of structures for commercial production. Computer-assisted techniques are helping to put this European Manufacturing Standard into effect. This article discusses how DPS techniques help to solve problems in industrial manufacturing processes, and presents the case of modelling and simulation of 3D-structures used in greenhouse construction. (C) 2009 Elsevier B.V. All rights reserved

关键词： Simulation modelling distributed problem solving Systems modelling 3D-structures modelling Software engineering

来源：评论

学校读者我要写书评

暂无评论

THE CONTRACT NET PROTOCOL - HIGH-LEVEL COMMUNICATION AND CONTROL IN A distributed problem SOLVER

引用

IEEE TRANSACTIONS ON COMPUTERS 1980年第12期29卷 1104-1113页

作者： SMITH, RG Defence Research Establishment Atlantic Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions

The contract net protocol has been developed to specify problem-solving communication and control for nodes in a distributed problem solver. Task distribution is affected by a negotiation process, a discussion carried... 详细信息

关键词： Artificial Intelligence (AI) connection cooperation distributed problem solving focus high-level protocols negotiation resource allocation task-sharing

来源：评论

学校读者我要写书评

暂无评论

Multi-party negotiation with preferences rather than utilities

引用

MULTIAGENT AND GRID SYSTEMS 2016年第2期12卷 139-165页

作者： Delecroix, Fabien Morge, Maxime Nachtergaelle, Thomas Routier, Jean-Christophe Univ Lille CNRS Cent Lille F-59000 Lille France

We propose here a multi-party negotiation game where agents exchange offers over a single issue. Contrary to most of existing works, we capture the agents' rationality with incomplete ( weak and partial) preferences rather than with utility functions. We prove that our negotiation process is always successful and reach fair agreements when the agents are cooperative. In order to illustrate how our negotiation game can tackle distributed problem solving, we introduce a toy problem: two or more agents are paratroopers landed in an unknown maze. Since they aim to meet as soon as possible, they negotiate a rendezvous during their exploration. Our experimentations show that the added value of negotiation is a fast resolution since this adaptive heuristic shares the efforts performed by the agents.

关键词： Conflict handling negotiation distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

COPS: cooperative problem solving using DCOM

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2002年第2期63卷 79-90页

作者： Darwish, N King Fahd Univ Petr & Minerals Coll Comp Sci & Engn Dept Informat & Comp Sci Dhahran 31261 Saudi Arabia

We present a framework that utilizes distributed Component Object Model (DCOM) for distributed problem solving. The Cooperative problem solving (COPS) system provides for the coding and execution of a parallel algorithm by a number of networked computers running Microsoft Windows. We show the effectiveness of the COPS system by implementing parallel breadth-first search used in conjunction with a branch-and-bound algorithm for the Traveling Salesman problem. (C) 2001 Elsevier Science Inc. All rights reserved.

关键词： DCOM COPS parallel systems distributed problem solving parallel breadth-first search branch-and-bound Traveling Salesman problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：