This paper introduces a new approach for modelling coverage problems, capable of taking into consideration 1) evolving points of interest, 2) environmental dynamics, including the influence of agent actions, and 3) de...
详细信息
ISBN:
(纸本)9781450356497
This paper introduces a new approach for modelling coverage problems, capable of taking into consideration 1) evolving points of interest, 2) environmental dynamics, including the influence of agent actions, and 3) detailed perception models. Such coverage problems requires tight coordination between agents while anticipating the consequences of their actions for maximizing the covered areas over time while avoiding adverse situations (e.g. collisions).
Coordination among multiple autonomous, distributed cognitive agents is one of the most challenging and ubiquitous problems in distributed AI and its applications in general, and in collaborative multi-agent systems i...
详细信息
Coordination among multiple autonomous, distributed cognitive agents is one of the most challenging and ubiquitous problems in distributed AI and its applications in general, and in collaborative multi-agent systems in particular. A particularly prominent problem in multi-agent coordination is that of group, team or coalition formation. A considerable majority of the approaches to this problem found in the literature assume fixed interactions among autonomous agents involved in the coalition formation process. Moreover, most of the prior research where agents are actually able to learn and adapt based on their past interactions mainly focuses on reinforcement learning techniques at the individual agent level. We argue that, in many important applications and contexts, complex large-scale collaborative multi-agent systems need to be able to learn and adapt at multiple organization, hierarchical and logical levels. In particular, the agents need to be able to learn both at the level of individual agents and at the system or agent ensemble levels, and then to integrate these different sources of learned knowledge and behavior, in order to be effective at solving complex tasks in typical dynamic, partially observable and noisy multi-agent environments. In this paper, we describe a conceptual framework for addressing the problem of learning how to coordinate effectively at three qualitatively distinct levels - those of (i) individual agents, (ii) small groups of agents, and (iii) very large agent ensembles (or alternatively, depending on the nature of a multi-agent system, at the system or central control level). We briefly illustrate the applicability and usefulness of the proposed conceptual framework with an example of how it would apply to an important practical coordination problem, namely that of distributed coordination of a large ensemble of unmanned vehicles on a complex multi-task mission. (C) 2010 Published by Elsevier Ltd.
Multi-agent systems often require runtime planning, which remains an open problem due to the existing gap between planning and execution in practice. Extensive research has been carried out in centralised planning for...
详细信息
ISBN:
(纸本)9781510855076
Multi-agent systems often require runtime planning, which remains an open problem due to the existing gap between planning and execution in practice. Extensive research has been carried out in centralised planning for single-agent systems, but so far decentralised multi-agent planning has not been fully explored. In this paper, we extend existing multiagent platforms to enable decentralised planning at runtime. In particular, we put forward a planning and execution framework called Decentralised Online Multi-Agent Planning (DOMAP). Experiments with a planning domain we developed on flooding disaster scenarios show that DOMAP outperforms 4 other state-of-the-art multi-agent planners, particularly in the most di ffi cult problems.
This paper looks to use both centralised and decentralised implementations of Evolutionary Algorithms to solve a dynamic variant of the Multi-Agent Travelling Salesman problem. The problem is allocating an active set ...
详细信息
ISBN:
(纸本)9781450367486
This paper looks to use both centralised and decentralised implementations of Evolutionary Algorithms to solve a dynamic variant of the Multi-Agent Travelling Salesman problem. The problem is allocating an active set of tasks to a set of agents whilst simultaneously planning the route for each agent. The allocation and routing are closely coupled parts of the same problem, this paper attempts to align the real world implementation demands of a decentralised solution by using multiple populations with well defined interactions to exploit the problem structure.
The aim of this work is to elaborate rational interaction between intelligent systems, particularly when these systems have to resolve together a given task. Firstly, inherent problems of distributed problem solving a...
详细信息
Parallel algorithms based on stochastic hill-climbing and parallel algorithms based on simple elements of a genetic algorithm for the one-sided bipartite crossing number problem, used in row-based VLSI layout, were in...
详细信息
ISBN:
(纸本)3540404554
Parallel algorithms based on stochastic hill-climbing and parallel algorithms based on simple elements of a genetic algorithm for the one-sided bipartite crossing number problem, used in row-based VLSI layout, were investigated. These algorithms were run on a PVM cluster. The experiments show that the parallel approach does not bring faster computation but it does, however, much more importantly, bring a better quality solution to the problem, i.e. it generates drawings with lower numbers of pairwise edge crossings.
In many technical systems, such as smart grids, the central issue is to enable multiple devices to solve a resource allocation problem in a cooperative manner. If the devices' ability to change their contribution ...
详细信息
ISBN:
(纸本)9781479953677
In many technical systems, such as smart grids, the central issue is to enable multiple devices to solve a resource allocation problem in a cooperative manner. If the devices' ability to change their contribution is subject to inertia, the problem has to be solved proactively. This means that the allocation of resources is scheduled beforehand, based on predictions of the future demand. Because of the scheduling problem's complexity, schedules should be created rather sporadically for a coarse-grained time pattern. However, because the resource allocation problem has to be solved for all time steps and the demand and provision of resources is uncertain, devices have to reactively adapt their contributions according to the current circumstances. In this paper, we present a mechanism that allows the participants to incorporate the information of proactively created schedules in their reactive decisions in order to steer the system in a stable and efficient way. In particular, the decisions are guided by schedules that already include information about possible uncertainties. While this combination avoids inertia-based problems, it significantly reduces the computational costs of searching for high quality solutions. Throughout the paper, the problem of maintaining the balance between energy production and consumption in decentralized autonomous power management systems serves to illustrate our algorithm and results.
Significant research progress and understanding about the nature of coordination has been made over the years. Development of the DCOP and DEC-MDP frameworks in the past decade has been especially important. Although ...
详细信息
ISBN:
(纸本)9781450327381
Significant research progress and understanding about the nature of coordination has been made over the years. Development of the DCOP and DEC-MDP frameworks in the past decade has been especially important. Although these advances are very important for multi-agent coordination theory, they overlook a set of coordination behaviors and phenomena that have been observed empirically by many researchers since the early years of the field. The goal of this paper is to challenge researchers in multi-agent coordination to develop a comprehensive formal framework that explains these empirical observations.
When the distributed inventory system is considered, which consists of several warehouses based on the coordinating center, the coordinating center plays the role of the management of joint inventory After the custome...
详细信息
ISBN:
(纸本)9781424447541
When the distributed inventory system is considered, which consists of several warehouses based on the coordinating center, the coordinating center plays the role of the management of joint inventory After the customers' order lists are sent to the coordinating center, it designates specific warehouse to supply goods for the customers according to the delivery place, delivery time, the demanded quantity and inventory situation of each warehouse When the overall inventory is lower than overall order, the center will make a joint order to the supplier for each warehouse In order to satisfy the different random distribution of supply and demand side, in the case of limited capital, inventory capacity and supply capacity, and variable costs, for specific customers' satisfaction rate, we propose a practical algorithm to determine the inventory order strategy of each warehouse in order to minimize the total inventory costs by using an immune genetic algorithm
暂无评论