In Constraint Satisfaction and Optimization problems ranging from design engineering to economics, there are often multiple design criteria or cost function that govern the decision whereas, the user needs to be provi...
详细信息
ISBN:
(纸本)3540229590
In Constraint Satisfaction and Optimization problems ranging from design engineering to economics, there are often multiple design criteria or cost function that govern the decision whereas, the user needs to be provided with a set of solutions which are the best for all the points of view. In this paper we define a new formalism for multicriteria optimization in constraint satisfaction problems "CSPs" and a multi-agent model solvingproblems in this setting. This approach separately optimizes different criteria in a distributed way by considering them as cooperative agents trying to reach all the non-dominated solutions. It exploits distributedproblems solving together with nogood exchange and negotiation to enhance the overall problem-solving effort. The effectiveness of the approach is discussed on randomly generated examples.
In this paper we present a generic multiagent learning system based on context learning applied in robotics. By applying learning with multiagent systems in robotics, we propose an endogenous self-learning strategy to...
详细信息
ISBN:
(纸本)9789897584848
In this paper we present a generic multiagent learning system based on context learning applied in robotics. By applying learning with multiagent systems in robotics, we propose an endogenous self-learning strategy to improve learning performances. Inspired by constructivism, this learning mechanism encapsulates models in agents. To enhance the learning performance despite the weak amount of data, local and internal negotiation, also called cooperation, is introduced. Agents collaborate by generating artificial learning situations to improve their model. A second contribution is a new exploitation of the learnt models that allows less training. We consider highly redundant robotic arms to learn their Inverse Kinematic Model. A multiagent system learns a collective of models for a robotic arm. The exploitation of the models allows to control the end position of the robotic arm in a 2D/3D space. We show how the addition of artificial learning situations increases the performances of the learnt model and decreases the required labeled learning data. Experimentations are conducted on simulated arms with up to 30 joints in a 2D task space.
from the last two decades, Software agents are playing an important role in the field of Artificial intelligence and the distributed problem solving. The properties of software agents like autonomy, reactivity, pro-ac...
详细信息
ISBN:
(纸本)9781479988907
from the last two decades, Software agents are playing an important role in the field of Artificial intelligence and the distributed problem solving. The properties of software agents like autonomy, reactivity, pro-activity and their social ability make them more center of focus for the real world problems. The accomplishment of any complex task is required to be done by the agents autonomously without any user intervention in order to achieve high reliability and adaptability. This paper mainly concentrates on the task allocation problem in multi-agent systems. Task Allocation is an important and challenging problem. This can be defined as the problem of allocating tasks among agents within a multi-agent system. Main objective of the task allocation problem is to maximize the number of successfully completed task and overall system utility without any conflict. To accomplish any complex task, agents negotiate, cooperate and coordinate with each other. Many researchers are working in the field of task allocation in multiagent systems. In this paper, various approaches of task allocation in multi-agent systems are discussed. The comparison of these approaches is also providing that lead to a discussion and motivation of the task allocation problem for multi-agent systems. This paper presents a hybrid approach for task allocation in dynamic multi-agent systems. The conclusion drawn from this survey is that, for dynamic multi-agent systems, the distributed task allocation is a better approach.
In this paper, we study the problem of task reallocation for load-balancing in distributed data processing models that tackle vast amount of data. We propose a strategy based on cooperative agents used to optimize the...
详细信息
ISBN:
(纸本)9783031101618;9783031101601
In this paper, we study the problem of task reallocation for load-balancing in distributed data processing models that tackle vast amount of data. We propose a strategy based on cooperative agents used to optimize the rescheduling of tasks in multiple jobs which must be executed as soon as possible. It allows agents to determine locally the next tasks to process, to delegate, possibly to swap according to their knowledge, their own belief base and their peer modelling. The novelty lies in the ability of agents to identify opportunities and bottleneck agents, and afterwards to reassign some bundles of tasks thanks to concurrent bilateral negotiations. The strategy adopted by the agents allows to warrant a continuous improvement of the flowtime. Our experimentation reveals that our strategy reaches a flowtime which is better than the one reached by a DCOP resolution, close to the one reached by the classical heuristic approach, and significantly reduces the rescheduling time.
Crowdsourcing is an online, distributedproblem-solving and production model that has emerged in recent years. Notable examples of the model include Threadless, iStockphoto, InnoCentive, the Goldcorp Challenge, and us...
详细信息
Over the last years, the rapid growth of distributed smart cameras has triggered the search for new approaches of smartness of cameras to have better results. As communication among camera entities is becoming more an...
详细信息
ISBN:
(纸本)9781450354875
Over the last years, the rapid growth of distributed smart cameras has triggered the search for new approaches of smartness of cameras to have better results. As communication among camera entities is becoming more and more complex and new ways of modeling communication have been proposed. These new ways have been taking inspiration from different fields such as socio-economic approach or game theory. Moreover, one of the major problems of the camera network is re-identification. However, in most cases, the interaction between cameras presupposes that the latter are able to perform perfect arid unambiguous detections, thus limiting the decision tasks to the Markovian model. Within this paper, we present a new approach of interaction between cameras based on a non-Markovian model. To resolve this issue, we can exploit other types of information rather than visual information to improve re-identification. This information is Spatial, Visual and Temporal (SVT). Temporal information holds the time needed to go from one camera to another, while spatial information contains the path followed by the target which is a key point for the decision-making process. This offers the possibility for the network to learn regularities and then reach a steady state.
A distributed problem solving system can be characterised as a group of individual agents running and co-operating with other agents to solve a problem. As dynamic domains such as stock trading are continuing to grow ...
详细信息
ISBN:
(纸本)0780373421
A distributed problem solving system can be characterised as a group of individual agents running and co-operating with other agents to solve a problem. As dynamic domains such as stock trading are continuing to grow in complexity, it becomes more difficult to control the behaviour of agents in the domains where unexpected events can occur. This paper presented an information and knowledge exchange framework to support the distributed problem solving in the stock trading domain. It addresses two important issues: (1) How individual agents should be interconnected so that their capacities are efficiently used and their goals are accomplished effectively and efficiently;(2) How the information and knowledge transfer should take place among agents to allow them to respond successfully to user requests and unexpected situations in the outside world. The focus of this paper is dynamic knowledge exchange among MASST agents. The co-ordinator agent together with a decision enabling warehouse acting as a dynamic blackboard plus direct intercommunication among the agents enable facts, commands, and rules to be transferred between MASST agents. Knowledge can be exchanged among the agents by using a combination of facts, rules and commands transfers.
In this paper, we study the problem of task reallocation for load-balancing in distributed data processing models that tackle vast amount of data. In this context, we propose a novel strategy based on cooperative agen...
详细信息
ISBN:
(纸本)9789897584848
In this paper, we study the problem of task reallocation for load-balancing in distributed data processing models that tackle vast amount of data. In this context, we propose a novel strategy based on cooperative agents used to optimize the rescheduling of tasks for multiple jobs submitted by users in order to be executed as soon as possible. It allows an agent to determine locally the next task to process and the next task to delegate according to its knowledge, its own belief base and its peer modelling. The novelty of our strategy lies in the ability of agents to identify opportunities and bottleneck agents, and afterwards to reallocate some of the tasks. Our contribution is that, thanks to concurrent bilateral negotiations, tasks are continuously reallocated according to the local perception and the peer modelling of agents. In order to evaluate the responsiveness of our approach, we implement a prototype testbed and our experimentation reveals that our strategy reaches a flowtime which is close to the one reached by the classical heuristic approach and significantly reduces the rescheduling time.
Graphical games introduce a compact representation, where agents' outcomes depend only on their neighbors. A distributed search algorithm for pure Nash equilibria of graphical games is presented. The algorithm use...
详细信息
ISBN:
(纸本)9781450342391
Graphical games introduce a compact representation, where agents' outcomes depend only on their neighbors. A distributed search algorithm for pure Nash equilibria of graphical games is presented. The algorithm uses the analogy of graphical games with asymmetric distributed constraints optimization problems (ADCOPs). The proposed algorithm includes three components - an admissible pruning heuristic;a back-checking mechanism;and a pseudo tree representation of the game. An experimental evaluation of the components of the proposed search algorithm is presented for randomly generated networks of multiple agents. The major speedup over a naive search algorithm is shown to arise from the use of a pseudo tree representation. A simple assessment method of the privacy loss due to back-checking is presented and is shown to result in a tradeoff between the performance of the complete algorithm and its privacy loss.
暂无评论