Role allocation has emerged as one of the key issue in teamwork involving communication. While direct point-to-point communication is expensive and uncertain, access to neighbors is reliable and efficient in scale-fre...
详细信息
ISBN:
(纸本)1932415688
Role allocation has emerged as one of the key issue in teamwork involving communication. While direct point-to-point communication is expensive and uncertain, access to neighbors is reliable and efficient in scale-free networks such as those found in open environments and social networks. This suggests decentralized approaches to role allocation based on communication between neighbors. This paper adapts and evaluates some of the basic types of algorithms in distributed role allocation in open environments using a novel coordination measure in the prey/predator domain. The experiments show that communicating beliefs rather than intentions enhance role-based coordination in open environments.
This paper discusses the application of Open Space Technology as a human swarm methodology and explores options for optimization. Open Space Technology, a self-organizing style of meeting, was applied by Hyland Softwa...
详细信息
ISBN:
(纸本)9781467365222
This paper discusses the application of Open Space Technology as a human swarm methodology and explores options for optimization. Open Space Technology, a self-organizing style of meeting, was applied by Hyland Software as an exercise in distributed problem solving with regards to the function of the company. Two applications by Hyland Software were observed, one with topical guidance and one without, leading to varying levels of perceived engagement. The observations of these Open Space Technology instances have resulted in ideas for the optimization of this approach as a human swarm method for distributed problem solving.
In this paper, we introduce a generic and fresh model for distributed planning called "distributed Planning Through Graph Merging" (DPGM). This model unifies the different steps of the distributed planning p...
详细信息
ISBN:
(纸本)9789896740221
In this paper, we introduce a generic and fresh model for distributed planning called "distributed Planning Through Graph Merging" (DPGM). This model unifies the different steps of the distributed planning process into a single step. Our approach is based on a planning graph structure for the agent reasoning and a CSP mechanism for the individual plan extraction and the coordination. We assume that no agent can reach the global goal alone. Therefore the agents must cooperate, i.e., take in into account potential positive interactions between their activities to reach their common shared goal. The originality of our model consists in considering as soon as possible, i.e., in the individual planning process, the positive and the negative interactions between agents activities in order to reduce the search cost of a global coordinated solution plan.
In Artificial Intelligence, a large number of problems (i.e. distributed resource management, distributed air traffic management, distributed Sensor Network [1]) can be modeled and solved as distributed Constraint Sat...
详细信息
ISBN:
(纸本)9783319279473;9783319279466
In Artificial Intelligence, a large number of problems (i.e. distributed resource management, distributed air traffic management, distributed Sensor Network [1]) can be modeled and solved as distributed Constraint Satisfaction problems (DisCSPs). As many real world problems change continuously and incessantly over time, some methods have been developed (e.g. DynABT), for solvingproblems which exhibit this dynamic behavior. Meanwhile, there was no available framework that helped users to develope intelligent multi-agent systems based on Dynamic and distributed Constraints Reasoning (DCR) techniques. In this paper, we propose a new platform, called JChoc, supporting the dynamic aspect for DisCSPs. JChoc is an easy to use platform, based on an elegant Multi-agent communication sub-platform (e.i JADE). It deals with agents with local complex problems and allows a realistic use of agents on a real distributed and dynamic framework. A real distributedproblem is addressed to illustrate how the platform can be used to solve dynamically changing problems. However, the experimental results show the defectiveness of our platform.
Implementing collective behaviour in cooperative multi-agent systems requires several practical constraints to be addressed. In some environments, communication bandwidth is a critical constraint which may compromise ...
详细信息
ISBN:
(纸本)9781450334136
Implementing collective behaviour in cooperative multi-agent systems requires several practical constraints to be addressed. In some environments, communication bandwidth is a critical constraint which may compromise the intended cooperative behaviour. This paper introduces a bio-inspired model which invokes collective behaviour in a multi-agent system using passive sensing without any explicit inter-agent communication. An agent looks for the majority of its neighbours either in its left or its right half space using two sensors. For a source localization problem, we compare performance of the proposed model using passive sensing against the well known school-of-fish collective behaviour models using ideal explicit inter-agent communication. For different cue strengths and neighbourhood radii, our results show that the proposed strategy boosts higher levels of group cohesion to make up for the information loss and in certain conditions performs better than the other collective behaviour models.
The density classification task is a prototypical consensus problem of distributed solution, usually addressed in the field of cellular automata. In short, this problem consists of finding the most frequent state in a...
详细信息
ISBN:
(纸本)9783030238872;9783030238865
The density classification task is a prototypical consensus problem of distributed solution, usually addressed in the field of cellular automata. In short, this problem consists of finding the most frequent state in a binary sequence, necessarily through a non-global process on which the automaton reaches uniform consensus about such state. In this regard, we formulate the task as an agent-based model, in which agents set up a connectivity pattern, here corresponding to a circulant graph, and update their internal states according to the majority rule. The performance of the model corresponds to the number of correctly classified densities, given a set of binary sequences. Therefore, our goal is to analyze the sensibility of the model's performance in terms of the connectivity pattern associated with it, configured as a circulant graph, under different orders, average degrees and connectivity arrangements.
Supply Chain Formation involves determining the participants and the exchange of goods within a production network. Today's companies operate autonomously, making local decisions, and coordinating with other compa...
详细信息
ISBN:
(纸本)9781450327381
Supply Chain Formation involves determining the participants and the exchange of goods within a production network. Today's companies operate autonomously, making local decisions, and coordinating with other companies to buy and sell goods along their Supply Chains. Such temporal interactions need to be formed rapidly and in a decentralized manner. For sufficiently large problems, current state-of-the-art approaches for Decentralized Supply Chain Formation are only capable of either (i) producing Supply Chains of high value at the expense of high resource requirements;or (ii) require low resources at the expense of producing Supply Chains of low value. In this paper we describe an algorithm that is able to produce Supply Chains of high value while keeping a low resource usage profile. Moreover, our method is able to produce near optimal Supply Chains while using up to four orders of magnitude less resources that the state-of-the-art.
A persistent publish/subscribe messaging model allows the creation of an application-independent fault-tolerant layer for multi-agent systems. We propose a layer which is capable of supporting heterogenous agent platf...
详细信息
ISBN:
(纸本)3540265511
A persistent publish/subscribe messaging model allows the creation of an application-independent fault-tolerant layer for multi-agent systems. We propose a layer which is capable of supporting heterogenous agent platforms from different vendors. This layer is a three-tier application, which is accessible from multi-agent systems via web-services or a persistent publish/subscribe messaging system. We describe the design of the fault-tolerant layer, its messaging system, as well as the algorithm of fault-recovery procedure in the case of agent and/or host death. We also present performance analysis of the proposed solution, to justify its use in systems which demand different levels of reliability.
We study the effectiveness of consensus formation in multi-agent systems where belief updating is an iterative two-part process, consisting of both belief updating based on direct evidence and also belief combination ...
详细信息
ISBN:
(纸本)9781450363099
We study the effectiveness of consensus formation in multi-agent systems where belief updating is an iterative two-part process, consisting of both belief updating based on direct evidence and also belief combination between agents, within the context of a best-of n problem. Agents' beliefs are represented within Dempster-Shafer theory by mass functions and we investigate the macro-level properties of four well-known belief combination operators: Dempster's rule, Yager's rule, Dubois & Prade's operator and the averaging operator. Simulation experiments are conducted for different evidence rates and noise levels. Broadly, Dubois & Prade's operator results in better convergence to the best state, and is more robust to noisy evidence.
暂无评论