基于多Agent协商的服务流程定制

针对复杂业务需求,提出了基于多Agent协商的服务流程定制模型、算法和系统．首先介绍了该模型及其支持系统的框架以及服务Agent的结构和工作原理;然后在将业务需求满足定义为分布式柔性约束满足问题的基础上,提出了基于多Agent协商的求解算法并介绍了一个应用案例;最后,给出了一个原型系统．该模型和系统能够对复杂的业务需求进行建模和求解,从而寻找到合适的服务,满足了服务流程定制的需要．     

基于SOA的多Agent协商服务及其应用

在简述一种融合了面向服务架构和多Agent协商系统特点的新的协商模型——基于面向服务架构的多Agent协商模型的基础上,设计了该协商模型的多Agent协商服务端,阐述了Agent中协商推理机在协商中的基本过程。面向服务架构的协商服务端与协商Agent管理平台组合起来,搭建起支持开放环境并开展协商的软件应用环境,实现了基于面向服务架构的多Agent协商模型在电子商务中的 应用。     

Service Discovery and Negotiation With COWS

To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider.     

通用的个性化自动谈判服务框架及其实现

针对目前缺少从用户的个性化服务需求到主体服务实现角度设计的通用框架的问题,给出一个通用的个性化自动谈判框架。提出用户个性化服务需求转换为主体服务实现的方法和主体谈判服务的实现步骤,通过一个典型案例的实现与分析结果表明,该框架具有较好的实用性。     

A Logic-Program-Based Negotiation Mechanism

This paper presents a logic-program-based mechanism of negotiation between two agents.In this mechanism an extended logic program(ELP) is regarded as an agent.The negotiation process between two agents is then modelled as multiple encounters between two ELPs,each of which selects an answer set as its initial demand.Both agents mutually revise the original sets of demands through accepting part of the opponent's demand and/or giving up part of its own demand.The overall dynamics can be regarded as mutual ...     

一种基于上下文协商的动态服务组合方法

普适计算的计算环境和交互信息动态变化,为了提供适时适地的服务,服务组合除了满足用户的需求之外,还要适应环境的变化.以面向普适计算的分布式文档管理系统为例,提出一种基于上下文协商的动态服务组合方法,适应普适计算环境下资源动态变化的特点,同时满足用户对服务的需求.首先定义上下文和带有上下文信息的服务模型;然后给出服务和设备以及服务和用户之间的上下文协商约束条件,根据约束条件提出基本算法实现服务动态组合,并对基本算法进行优化;最后通过原型系统和实验验证算法的性能和有效性,并通过实验数据分析上下文对于服务组合的影响.实验数据说明:提出的方法能够应用在普适计算环境中上下文敏感的服务组合问题上,提高服务组合的动态适应性和网络资源利用率.     

Negotiation support systems: roots, progress and needs

Abstract. This paper identifies game theories and social behavior science as important roots for negotiation support systems (NSS) research. As these are not typically cited in the NSS literature, summary reviews of them are provided with indications of their relevance to NSS study. On the other hand, neither offers a sufficiently general-purpose formal model of negotiation that could serve as a backbone for NSS research. A survey of that research is provided, indicating that prugress to date has been somewhat eclectic and devoid of such a model. Our central contention is that a theoretical foundation for NSS study is much needed. Desirable characteristics of a suitable negotiation model are identified as guidance for future research that will aim to devise (and subsequently apply and test) such a model.     

Negotiation Agents that Make Prudent Compromises and are Slightly Flexible in Reaching Consensus

The contribution of this work is designing and developing enhanced market-driven agents with the flexibility to (1) respond to changing market conditions, and (2) raise and relax trade aspirations. Previous theoretical analyses have shown that market-driven agents ( MDA s) make prudent compromises by reacting to changing market situations by taking into account factors such as competition, deadlines, and trading options. This work augments the design of an MDA with three fuzzy decision controllers that guide the agent in (i) relaxing trade aspiration in face of intense negotiation pressure, and (ii) raising trade aspiration in extremely favorable markets. Results from extensive simulations conducted using an implemented testbed suggest that when compared to MDA s, agents in this work achieved (1) higher success rates in reaching deals, (2) higher average utilities, and (3) higher expected utility.     

基于区间相似度的动态服务协商模型

针对服务协商中信息的不对称性、协商环境的动态性以及QoS属性的不确定性和模糊性,提出基于区间相似度的动态服务协商模型。利用区间相似度和区间估计预测对方的协商策略,以此制定己方的最优反策略。算例分析表明,在动态服务协商环境下,该模型比静态协商模型更贴近现实的协商行为,能有效提高协商效率。     

基于综合安全保护质量的安全服务协商模型

在基于分布式服务的系统体系中,上层应用系统需要确定下层安全服务能够按照要求提供安全服务功能,根据不断变化的实际需要和当前系统状态自适应地调整服务者和服务要求,并同时保障系统的安全性。本文探讨了在应用系统和安全服务之间对安全保护质量进行协商的协议模型,目标是使应用系统所要求达到的安全水平能获得安全服务的支支持,并能得到下层安全服务的有效遵守,使系统的整体安全水平得到保障。     

Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation

Automated negotiation and coalition formation among self-interested agents are playing an increasingly important role in electronic commerce. Such agents cannot be coordinated by externally imposing their strategies. Instead the interaction protocols have to be designed so that each agent is motivated to follow the strategy that the protocol designer wants it to follow. This paper reviews six component technologies that we have developed for making such interactions less manipulable and more efficient in terms of the computational processes and the outcomes: 1. OCSM-contracts in marginal cost based contracting, 2. leveled commitment contracts, 3. anytime coalition structure generation with worst case guarantees, 4. trading off computation cost against optimization quality within each coalition, 5. distributing search among insincere agents, and 6. unenforced contract execution. Each of these technologies represents a different way of battling self-interest and combinatorial complexity simultaneously. This is a key battle when multi-agent systems move into large-scale open settings.     

宏观经济智能决策支持系统MEIDSS

对大型智能软件系统ＭＥＩＤＳＳ的总体结构和功能特征加以论述，重点是人工智能与面向对象技术相结合的系统设计方法，以及ＭＥＩＤＳＳ实现仿真决策问题自动求解的技术。     

Cooperative Mobile Robotics: Antecedents and Directions

There has been increased research interest in systems composed of multiple autonomous mobile robots exhibiting cooperative behavior. Groups of mobile robots are constructed, with an aim to studying such issues as group architecture, resource conflict, origin of cooperation, learning, and geometric problems. As yet, few applications of cooperative robotics have been reported, and supporting theory is still in its formative stages. In this paper, we give a critical survey of existing works and discuss open problems in this field, emphasizing the various theoretical issues that arise in the study of cooperative robotics. We describe the intellectual heritages that have guided early research, as well as possible additions to the set of existing motivations.     

Negotiation decision functions for autonomous agents

We present a formal model of negotiation between autonomous agents. The purpose of the negotiation is to reach an agreement about the provision of a service by one agent for another. The model defines a range of strategies and tactics that agents can employ to generate initial offers, evaluate proposals and offer counter proposals. The model is based on computationally tractable assumptions, demonstrated in the domain of business process management and empirically evaluated.     

可协商的资源预约服务

为了能更好、更方便地使用互联网上的共享资源,论文设计并实现了一种可协商的资源预约服务。此项服务主要以Globus项目的GARA协议为基础和参照,使得用户可以预约网络上的共享资源,并且在整个预约过程中,可与资源的提供者进行协商,随时变更自己的预约请求。论文讨论了此项服务的总体设计和一些技术要点。     

具备隐形协商空间的服务连续双向拍卖策略研究

针对Web服务市场化交易中,买卖双方单一报价交易成功率低的难点,提出了具备隐形协商空间的服务连续双向拍卖策略,定义了由交易双方的成本、报价形成的买卖方报价协商空间,根据不同的服务供需环境,对议价采用不同的快速协商模式。模拟实验表明,该策略提高了服务交易成功率,又使得服务交易双方由传统单一固定的收益转变为根据市场环境获得区间内可变的收益,客观上有利于指导服务双方根据市场变化调整服务报价。     

Bargaining over multiple issues in finite horizon alternating-offers protocol

In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we provide an algorithm to compute it. The equilibrium is determined by making a novel use of backward induction together with convex programming techniques in multi issue settings. We show that the agents reach an agreement immediately and that such an agreement is Pareto efficient. Furthermore, we prove that, when the multi issue utility functions are linear, the problem of computing the equilibrium is tractable and the related complexity is polynomial with the number of issues and linear with the deadline of bargaining.      

开放的分布式人工智能

本文阐明了研究开放分布式人工智能（ＤＡＩ）的重要性，详细讨论了开放ＤＡＩ系统中开放的含义，并指出开放ＤＡＩ系统中两个关键技术问题——自适应和矛盾处理及其研究现状．     

基于人工智能技术的IETM业务规则研究

为有效管理人工智能技术操作步骤的规范性,需要对人工智能技术的IETM业务规则进行研究;而当前已经制定的IETM业务规则,在人工智能技术复杂繁多的操作步骤中,许多细节问题没有得到规范管理;为此,提出一种基于人工智能技术的IETM业务规则研究方法;该方法首先确定人工智能技术的IETM业务规则数据模块,再将所有人工智能数据模块进行分类,并分配给各部门相关技术人员进行IETM业务规则的制定,数据模块ETM业务规则的制定过程将采用PCR技术以层次形式来表述,然后将所有分类数据模块IETM业务规则进行汇总、协商、统一,形成完整的人工智能技术的IETM业务规则,管理人工智能技术操作步骤的规范性;实验仿真证明,所提方法能够有效管理人工智能技术操作步骤的规范性。     

An Automated Teamwork Infrastructure for Heterogeneous Software Agents and Humans

Agent integration architectures enable a heterogeneous, distributed set of agents to work together to address problems of greater complexity than those addressed by the individual agents themselves. Unfortunately, integrating software agents and humans to perform real-world tasks in a large-scale system remains difficult, especially due to three main challenges: ensuring robust execution in the face of a dynamic environment, providing abstract task specifications without all the low-level coordination details, and finding appropriate agents for inclusion in the overall system. To address these challenges, our Teamcore project provides the integration architecture with general-purpose teamwork coordination capabilities. We make each agent team-ready by providing it with a proxy capable of general teamwork reasoning. Thus, a key novelty and strength of our framework is that powerful teamwork capabilities are built into its foundations by providing the proxies themselves with a teamwork model.Given this teamwork model, the Teamcore proxies addresses the first agent integration challenge, robust execution, by automatically generating the required coordination actions for the agents they represent. We can also exploit the proxies' reusable general teamwork knowledge to address the second agent integration challenge. Through team-oriented programming, a developer specifies a hierarchical organization and its goals and plans, abstracting away from coordination details. Finally, KARMA, our Knowledgeable Agent Resources Manager Assistant, can aid the developer in conquering the third agent integration challenge by locating agents that match the specified organization's requirements. Our integration architecture enables teamwork among agents with no coordination capabilities, and it establishes and automates consistent teamwork among agents with some coordination capabilities. Thus, team-oriented programming provides a level of abstraction that can be used on top of previous approaches to agent-oriented programming. We illustrate how the Teamcore architecture successfully addressed the challenges of agent integration in two application domains: simulated rehearsal of a military evacuation mission and facilitation of human collaboration.