An ontology based approach to organize multi-agent assisted supply chain negotiations

Effective supply chain management (SCM) comprises activities involving the demand and supply of resources and services. Negotiation is an essential approach to solve conflicting transaction and scheduling problems among supply chain members. The multi-agent system (MAS) technology has provided the potential of automating supply chain negotiations to alleviate human interactions. Software agents are supposed to perform on behalf of their human owners only when equipped with sophisticated negotiation knowledge. To better organize the negotiation knowledge utilized by agents and facilitate agents’ adaptive negotiation decision making ability, an ontology-based approach is proposed in this paper. Firstly, the multi-agent assisted supply chain negotiation scheme is presented to configure the general design components of the negotiation system, covering the agent intelligence modules, the knowledge organization method and the negotiation protocol. Then, the ontology-based negotiation knowledge organization method is specified. The negotiation knowledge is separated into shared negotiation ontology and private negotiation ontology to ensure both the agent communicative interoperability and the privacy of strategic knowledge. Inference rules are defined on top of the private negotiation ontology to guide agents’ reasoning ability. Through this method, agents’ negotiation behaviors will be more adaptive to various negotiation environments utilizing corresponding negotiation knowledge.     

Continual planning and acting in dynamic multiagent environments

In order to behave intelligently, artificial agents must be able to deliberatively plan their future actions. Unfortunately, realistic agent environments are usually highly dynamic and only partially observable, which makes planning computationally hard. For most practical purposes this rules out planning techniques that account for all possible contingencies in the planning process. However, many agent environments permit an alternative approach, namely continual planning, i.e. the interleaving of planning with acting and sensing. This paper presents a new principled approach to continual planning that describes why and when an agent should switch between planning and acting. The resulting continual planning algorithm enables agents to deliberately postpone parts of their planning process and instead actively gather missing information that is relevant for the later refinement of the plan. To this end, the algorithm explictly reasons about the knowledge (or lack thereof) of an agent and its sensory capabilities. These concepts are modelled in the planning language (MAPL). Since in many environments the major reason for dynamism is the behaviour of other agents, MAPL can also model multiagent environments, common knowledge among agents, and communicative actions between them. For Continual Planning, MAPL introduces the concept of of assertions, abstract actions that substitute yet unformed subplans. To evaluate our continual planning approach empirically we have developed MAPSIM, a simulation environment that automatically builds multiagent simulations from formal MAPL domains. Thus, agents can not only plan, but also execute their plans, perceive their environment, and interact with each other. Our experiments show that, using continual planning techniques, deliberate action planning can be used efficiently even in complex multiagent environments.     

An agent specific planning algorithm

Planning algorithms are often applied by intelligent agents for achieving their goals. For the plan creation, this kind of algorithm uses only an initial state definition, a set of actions, and a goal; while agents also have preferences and desires that should to be taken into account. Thus, agents need to spend time analyzing each plan returned by these algorithms to find one that satisfies their preferences. In this context, we have studied an alternative in which a classical planner could be modified to accept a new conceptual parameter for a plan creation: an agent mental state composed by preferences and constraints. In this work, we present a planning algorithm that extends a partial order algorithm to deal with the agent’s preferences. In this way, our algorithm builds an adequate plan in terms of agent mental state. In this article, we introduce this algorithm and expose experimental results showing the advantages of this adaptation.     

Artificial institutions: a model of institutional reality for open multiagent systems

Software agents’ ability to interact within different open systems, designed by different groups, presupposes an agreement on an unambiguous definition of a set of concepts, used to describe the context of the interaction and the communication language the agents can use. Agents’ interactions ought to allow for reliable expectations on the possible evolution of the system; however, in open systems interacting agents may not conform to predefined specifications. A possible solution is to define interaction environments including a normative component, with suitable rules to regulate the behaviour of agents. To tackle this problem we propose an application-independent metamodel of artificial institutions that can be used to define open multiagent systems. In our view an artificial institution is made up by an ontology that models the social context of the interaction, a set of authorizations to act on the institutional context, a set of linguistic conventions for the performance of institutional actions and a system of norms that are necessary to constrain the agents’ actions.     

Learning to trust in the competence and commitment of agents

For agents to collaborate in open multi-agent systems, each agent must trust in the other agents’ ability to complete tasks and willingness to cooperate. Agents need to decide between cooperative and opportunistic behavior based on their assessment of another agents’ trustworthiness. In particular, an agent can have two beliefs about a potential partner that tend to indicate trustworthiness: that the partner is competent and that the partner expects to engage in future interactions. This paper explores an approach that models competence as an agent’s probability of successfully performing an action, and models belief in future interactions as a discount factor. We evaluate the underlying decision framework’s performance given accurate knowledge of the model’s parameters in an evolutionary game setting. We then introduce a game-theoretic framework in which an agent can learn a model of another agent online, using the Harsanyi transformation. The learning agents evaluate a set of competing hypotheses about another agent during the simulated play of an indefinitely repeated game. The Harsanyi strategy is shown to demonstrate robust and successful online play against a variety of static, classic, and learning strategies in a variable-payoff Iterated Prisoner’s Dilemma setting.     

Automata for Epistemic Temporal Logic with Synchronous Communication

We suggest that developing automata theoretic foundations is relevant for knowledge theory, so that we study not only what is known by agents, but also the mechanisms by which such knowledge is arrived at. We define a class of epistemic automata, in which agents’ local states are annotated with abstract knowledge assertions about others. These are finite state agents who communicate synchronously with each other and information exchange is ‘perfect’. We show that the class of recognizable languages has good closure properties, leading to a Kleene-type theorem using what we call regular knowledge expressions. These automata model distributed causal knowledge in the following way: each agent in the system has a partial knowledge of the temporal evolution of the system, and every time agents synchronize, they update each other’s knowledge, resulting in a more up-to-date view of the system state. Hence we show that these automata can be used to solve the satisfiability problem for a natural epistemic temporal logic for local properties. Finally, we characterize the class of languages recognized by epistemic automata as the regular consistent languages studied in concurrency theory.     

Attitude based teams in a hostile dynamic world

In this paper, we propose a teamwork model based on the concept of a mental attribute called attitude. Our team model presents team as a collective abstract attitude, in which is embedded a novel way of solving problems and conflicts in our domain. We argue that this collective attitude is further decomposed into the individual attitudes of the agents towards various team attributes. We then evaluate the team problem solving behaviours of the agents in a simulated fire world using teams with and without different types of attitudes. The application and implementation of this model to a virtual fire world has revealed a promising prospect in developing team agents.     

A computational model for distributed knowledge systems with learning mechanisms

This paper addresses the issues of machine learning in distributed knowledge systems, which will consist of distributed software agents with problem solving, communication and learning functions. To develop such systems, we must analyze the roles of problem-solving and communication capabilities among knowledge systems. To facilitate the analyses, we propose a computational model: LPC. The model consists of a set of agents with (a) a knowledge base for learned concepts, (b) a knowledge base for problem solving, (c) prolog-based inference mechanisms and (d) a set of beliefs on the reliability of the other agents. Each agent can improve its own problem-solving capabilities by deductive learning from the given problems, by memory-based learning from communications between the agents and by reinforcement learning from the reliability of communications between the other agents. An experimental system of the model has been implemented in Prolog language on a Window-based personal computer. Intensive experiments have been carried out to examine the feasibility of the machine learning mechanisms of agents for problem-solving and communication capabilities. The experimental results have shown that the multiagent system improves the performance of the whole system in problem solving, when each agent has a higher learning ability or when an agent with a very high ability for problem solving joins the organization to cooperate with the other agents in problem solving. These results suggest that the proposed model is useful in analyzing the learning mechanisms applicable to distributed knowledge systems.     

A framework for meta-level control in multi-agent systems

Sophisticated agents operating in open environments must make decisions that efficiently trade off the use of their limited resources between dynamic deliberative actions and domain actions. This is the meta-level control problem for agents operating in resource-bounded multi-agent environments. Control activities involve decisions on when to invoke and the amount to effort to put into scheduling and coordination of domain activities. The focus of this paper is how to make effective meta-level control decisions. We show that meta-level control with bounded computational overhead allows complex agents to solve problems more efficiently than current approaches in dynamic open multi-agent environments. The meta-level control approach that we present is based on the decision-theoretic use of an abstract representation of the agent state. This abstraction concisely captures critical information necessary for decision making while bounding the cost of meta-level control and is appropriate for use in automatically learning the meta-level control policies.     

Framework of agent-based intelligence system with two-stage decision-making process for distributed dynamic scheduling

The advent of multiagent systems, a branch of distributed artificial intelligence, introduced a new approach to problem solving through agents interacting in the problem solving process. In this paper, a collaborative framework of a distributed agent-based intelligence system is addressed to control and resolve dynamic scheduling problem of distributed projects for practical purposes. If any delay event occurs, the self-interested activity agent, the major agent for the problem solving of dynamic scheduling in the framework, can automatically cooperate with other agents in real time to solve the problem through a two-stage decision-making process: the fuzzy decision-making process and the compensatory negotiation process. The first stage determines which behavior strategy will be taken by agents while delay event occurs, and prepares to next negotiation process; then the compensatory negotiations among agents are opened related with determination of compensations for respective decisions and strategies, to solve dynamic scheduling problem in the second stage. A prototype system is also developed and simulated with a case to validate the problem solving of distributed dynamic scheduling in the framework.     

Intentional learning agent architecture

Dealing with changing situations is a major issue in building agent systems. When the time is limited, knowledge is unreliable, and resources are scarce, the issue becomes more challenging. The BDI (Belief-Desire-Intention) agent architecture provides a model for building agents that addresses that issue. The model can be used to build intentional agents that are able to reason based on explicit mental attitudes, while behaving reactively in changing circumstances. However, despite the reactive and deliberative features, a classical BDI agent is not capable of learning. Plans as recipes that guide the activities of the agent are assumed to be static. In this paper, an architecture for an intentional learning agent is presented. The architecture is an extension of the BDI architecture in which the learning process is explicitly described as plans. Learning plans are meta-level plans which allow the agent to introspectively monitor its mental states and update other plans at run time. In order to acquire the intricate structure of a plan, a process pattern called manipulative abduction is encoded as a learning plan. This work advances the state of the art by combining the strengths of learning and BDI agent frameworks in a rich language for describing deliberation processes and reactive execution. It enables domain experts to specify learning processes and strategies explicitly, while allowing the agent to benefit from procedural domain knowledge expressed in plans.     

A multiagent framework for coordinated parallel problem solving

Today’s organizations, under increasing pressure on the effectiveness and the increasing need for dealing with complex tasks beyond a single individual’s capabilities, need technological support in managing complex tasks that involve highly distributed and heterogeneous information sources and several actors. This paper describes CoPSF, a multiagent system middle-ware that simplifies the development of coordinated problem solving applications while ensuring standard compliance through a set of system services and agents. CoPSF hosts and serves multiple concurrent teams of problem solving contributing both to the limitation of communication overheads and to the reduction of redundant work across teams and organizations. The framework employs (i) an interleaved task decomposition and allocation approach, (ii) a mechanism for coordination of agents’ work, and (iii) a mechanism that enables synergy between parallel teams.     

基于多Agent的复合模型求解自适应QoS机制

在基于网络的分布式系统应用基础上，分析了大型复杂问题复合模型协作求解的过程特征描述，提出基于多Agent 的领域问题协作求解的主动控制策略，探讨了用户交互Agent、系统主控Agent、协作Agent以及模型Agent和数据Agent等复合模型协作求解的4种Agent类型。应用多Agent层次结构，提出一种复合模型协作求解的自适应QoS体系结构，通过实现复合模型协作求解的主动调度规划算法对其进行了验证，支持分布式网络环境下实现模型资源和数据资源的共享，以提高协同计算环境分布式问题协作求解的运行效率和服务质量。     

Towards a generic distributed and collaborative digital manufacturing

A framework for distributed manufacturing is proposed to facilitate collaborative product development and production among geographically distributed functional agents using digitalized information. Considering the complexity of products created in a distributed manufacturing scenario, it often requires close collaborations among a number of facilities. In this research work, various functional agents, such as the manufacturability evaluation agent (MEA), manufacturing resource agent (MRA), process-planning agent (PPA), manufacturing scheduling agent (MSA), shop floor agent (SFA), fault diagnosis agent (FDA), etc., can interact coherently for distributed manufacturing. With specific agents having unique functionalities, a manufacturing managing agent (MMA) acts as the centre of this distributed manufacturing system. The MMA agent assists the specific agents’ to work seamlessly and also to collaborate closely with the participating agents. In this way, the production cycle of a part can be optimized from product design to final manufacturing since all the production procedures are considered logically and every procedure is correlated. The agent language based on the knowledge query manipulation language (KQML) includes many pre-defined performatives that ease the participating agents to carry out their tasks intelligently by interpreting commands from one another. Additionally, to ensure the adaptiveness and upgradeability of the system, the internal structure of each functional agent that is based on JATLite is modularized into several components, including a communication interface, central work engine, knowledge base pool, and input/output modifier for possible future methodology enhancements.     

Acquisition of troubleshooting skills in a computer simulation: Worked example vs. conventional problem solving instructional strategies

In a computer-based simulation of a chemical processing plant, the differential effects of three instructional strategies for learning how to troubleshoot the plant’s malfunctions were investigated. In an experiment concerning learners’ transfer performance and mental effort, the simulation presented the three strategies to three groups of learners and measured their performance on the transfer tasks. In this experiment, conventional problem solving was contrasted with two worked example strategies. The results indicated a significant difference between practicing problem solving and using worked examples. Learners who practiced problem solving in an interactive simulation outperformed the learners who studied computer-based worked examples. They also invested lower mental effort in transfer tasks. When accounting for the difference in the learners’ domain knowledge, the strategies were not significantly different among the more experienced learners. For the less experienced learners, those who practiced problem solving significantly outperformed their worked example counterparts. Among all participants and also among less experienced learners the problem solving group invested significantly lower mental effort in the performance of transfer tasks. Based on the results of this study, the authors recommend the use of the conventional problem solving strategy with or without worked examples for learning complex skills.     

一种基于资源约束的Agent组织规则生成机制

Agent组织是多Agent系统的一种求解结构，可以有效地降低求解难度和Agent之间的交互复杂性，对Agent组织的抽象包括组织结构，组织规则和组织模式，Agent组织规则的形成是Agent组织设计的重要问题之一，基于资源约束给出了Agent组织规则的形式描述和产生机制，设计了Agent组织规则形成的静态算法和动态算法，从而改进了Zambonelli和Jennings关于Agent组织规则的研究。     

多Agent系统分布式问题求解的代数模型方法(Ⅰ): 社会行为、社会局势和社会动力学

该组论文提出一种新的代数模型方法，用于多Agent系统超分布超并行社会智能问题求解，该方法通过社会动力学和社会智能，统一地处理各种复杂的并行的社会行为，用于求解用常规方法难以处理的许多社会交互问题，本文是组合论文中第一篇，提出多Agent系统分布式问题求解的代数模型结构，讨论多Agent系统中典型社会行为模式及其性质，建立形式化描述，同时也论述了代数模型中的社会局势和社会动力学。