This paper investigates the multi-agent cooperation problems in Web services domain. For Pareto-optimal Nash equilibrium, reinforcement learning algorithms are used to solve the coordination problem in cooperative env...
详细信息
ISBN:
(纸本)9781509026289
This paper investigates the multi-agent cooperation problems in Web services domain. For Pareto-optimal Nash equilibrium, reinforcement learning algorithms are used to solve the coordination problem in cooperative environments. Most previous works study the deterministic gain of a state. However, in practical service environments, the gain may be nondeterministic due to unstable Quality of Service (QoS). To avoid local optimal solution, we use an improved update function. The experimental results show that proposed reinforcement learning algorithm outperforms other learning methods.
Reliable and efficient distributed algorithms for power restoration are essential for self-healing electrical smart grids. Therefore, this paper presents a Multi-Agent System (MAS) for automatic restoration in power d...
详细信息
ISBN:
(纸本)9781509001910
Reliable and efficient distributed algorithms for power restoration are essential for self-healing electrical smart grids. Therefore, this paper presents a Multi-Agent System (MAS) for automatic restoration in power distribution networks. Moreover, as electrical demand fluctuates on the hourly and daily basis, an ensemble learning algorithm has been adopted for short-term forecasting of electrical energy demand. The prediction methodology is incorporated into the restoration algorithm in order to obtain a capacity-based restoration solution. Experiments carried out in two electrical networks demonstrate the importance and accuracy of the demand prediction algorithm and the feasibility of the MAS for system reconfiguration in decentralized power utilities.
In this paper, we consider each of the nine BDI principles defined by Rao and Georgeff based on Bratman's asymmetry thesis, and we verify which ones are satisfied by Rao's AgentSpeak(L), a logic programming la...
详细信息
In this paper, we consider each of the nine BDI principles defined by Rao and Georgeff based on Bratman's asymmetry thesis, and we verify which ones are satisfied by Rao's AgentSpeak(L), a logic programming language inspired by the BDI architecture for cognitive agents. In order to set the grounds for the proofs, we first introduce a rigorous way in which to define the informational, motivational, and deliberative modalities of BDI logics for AgentSpeak( L) agents, according to its structural operational semantics that we introduced in a recent paper. This computationally grounded semantics for the BDI modalities forms the basis of a framework that can be used to further investigate BDI properties of AgentSpeak( L) agents, and contributes towards establishing firm theoretical grounds for a BDI approach to agent-oriented programming.
b With the most recent advances in bioinformatics, the amount of information available for analysing certain diseases has increased considerably. Specifically, the use of microarrays makes it possible to obtain inform...
详细信息
b With the most recent advances in bioinformatics, the amount of information available for analysing certain diseases has increased considerably. Specifically, the use of microarrays makes it possible to obtain information on genetic patterns. The analysis of this information requires the use of new computational models and the modification of existing models so that it becomes possible to work with such an elevated amount of data. This study will demonstrate the integration of an expression analysis in a case-based reasoning system that can apply data mining techniques to classify and obtain patterns that have been stored in a case database for leukaemia patients.
Modern manufacturing companies are under economic pressure to respond more rapidly to a changing production environment, including short product life cycles, individually customisable products. and the introduction of...
详细信息
Modern manufacturing companies are under economic pressure to respond more rapidly to a changing production environment, including short product life cycles, individually customisable products. and the introduction of new disruptive manufacturing processes. This paper details a new manufacturing philosophy and software architecture for Evolvable Assembly Systems, based on the principles of decentralization, context-awareness and intelligent resources, that is implemented using intelligent agent technology and a data distribution service. We also detail the Smart Manufacturing and Reconfigurable Technology demonstrator - an instantiation of the Evolvable Assembly Systems architecture that implements a proof-of-concept abstract custom pharmaceuticals production line. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
Participating members in a manufacturing supply chain usually make use of an information system like enterprise resources planning (ERP) for planning and scheduling activities independently. Recent research indicates ...
详细信息
Participating members in a manufacturing supply chain usually make use of an information system like enterprise resources planning (ERP) for planning and scheduling activities independently. Recent research indicates that there is a need to handle such distributed activities in an integrated manner, especially under uncertain and fast changing environments. A multiagent system, a branch of distributed artificial intelligence, is a contemporary modelling technique for a distributed system in the manufacturing domain. This distributed modelling technique is suitable for integrating supply chain networks, which have distributed entities within the system, and each of them makes decision locally, i.e. a local information system. By adopting a multiagent modelling technique, supply chain networks can be built efficiently based on an information system. However, with reference to the reported research, which involves distributed modelling of a supply chain, a higher level coordination mechanism is not specified. This paper aims to propose a framework that utilizes a multiagent system with a corresponding coordination mechanism dedicated to manufacturing supply chain networks.
Intelligent Tutoring Systems (ITSs) aim at providing personalized and adaptive tutoring to students by the incorporation of a student modeling component. In the near future, a very interesting scenario will appear whe...
详细信息
ISBN:
(纸本)9781424419692
Intelligent Tutoring Systems (ITSs) aim at providing personalized and adaptive tutoring to students by the incorporation of a student modeling component. In the near future, a very interesting scenario will appear when multiple tutoring systems exchange information in order to learn from its own experiences and improve their student modeling components. In order to get closer to such scenario, in this paper we present a case-based peer-to-peer multi-agent system for collaborative management of student models in ITSs. The goal of the system is twofold: first, to initialize the student model when a new student logs on the tutor system and second, to update the student model depending on the student's interaction with the system and exchanging this information with its peers. The quality of the system is evaluated in terms of its ability for searching similar cases (accuracy) tested under three different strategies. Our results show that increasing the system complexity (number of nodes and/or number of students) and using a committee strategy, the performance of the global system is improved by reducing network traffic, and preserving the quality of the solutions for the new students (cases).
We propose protocol for automated negotiations between multiple agents over multiple and interdependent issues. We consider the situation in which the agents have to agree upon one option (contract) among many possibl...
详细信息
ISBN:
(纸本)9783319074559;9783319074542
We propose protocol for automated negotiations between multiple agents over multiple and interdependent issues. We consider the situation in which the agents have to agree upon one option (contract) among many possible ones (contract space). Interdependency between issues prevents us from applying negotiation protocols that have linear time complexity cost like Hill Climbing implementing mediated text negotiation protocol(HC). As a result most previous works propose methods in which the agents use non linear optimizers like simulated annealing to generate proposals. Then a central mediator can be used to match the proposals in order to find an intersection. But this matching process usually has exponential time cost complexity. We propose multi round HC(MR-HC) for negotiations with multiple and interdependent issues. In each round the normal HC is used to determine a negotiation deal region to be used by the next round. We propose that the agents should cluster their constraints by the cardinality of the constraints in order to get socially optimal contracts before applying MR-HC. To showcase that our proposed clustering technique is an essential one, we evaluate the optimality of our proposed protocol by running simulations at different cluster sizes.
Managing electrical energy is nowadays a challenge of paramount importance in many countries. One of the numerous problems of this challenge is the one that consists in determining (and managing) the power flows betwe...
详细信息
ISBN:
(纸本)9781538674499
Managing electrical energy is nowadays a challenge of paramount importance in many countries. One of the numerous problems of this challenge is the one that consists in determining (and managing) the power flows between consumers and producers in a micro-grid (i.e. a local electrical connected network nearly isolated from the main, national level, electricity network), so as to take advantage of the renewable sources, typically solar panel and wind generator, and solicit the main grid (i.e. the global network) the least possible in order to fulfill the demand, for instance. To manage the power flows, we propose in this paper an approach based on agents that represent consumers and producers. They are moved by attractive and repulsive forces, inspired by Newtonian Physics, whose intensities depend on the amount of electrical power available by the ones and required by the others. Experimental results obtained from simulations show that this approach can manage power flows in an open system by avoiding black-out. Moreover, the results obtained show adaptability skills (i.e. producers can be added and removed in runtime).
This paper presents SemAnt, a novel ant-based multi-agent system designed for distributed query routing. While the ant metaphor has been successfully applied to network routing both in wireless and fixed networks, lit...
详细信息
ISBN:
(纸本)9781424401956
This paper presents SemAnt, a novel ant-based multi-agent system designed for distributed query routing. While the ant metaphor has been successfully applied to network routing both in wireless and fixed networks, little is yet known about its applicability to the task of query routing in distributed environments. We point out the similarities and dissimilarities between routing of data packets and routing of queries, and we present the design of SemAnt, which is based on the Ant Colony Optimization meta-heuristic. For experimental evaluation, we deploy the algorithm in a peer-to-peer environment with a real-world application scenario and compare its performance against the well-known k-random walker approach. As we will show, the benefits of SemAnt are that the routes for queries are optimized according to their popularity, and that the algorithm is highly suitable for volatile environments.
暂无评论