scholarly journals Online Multi-Agent Pathfinding

Author(s):  
Jiří Švancara ◽  
Marek Vlk ◽  
Roni Stern ◽  
Dor Atzmon ◽  
Roman Barták

Multi-agent pathfinding (MAPF) is the problem of moving a group of agents to a set of target destinations while avoiding collisions. In this work, we study the online version of MAPF where new agents appear over time. Several variants of online MAPF are defined and analyzed theoretically, showing that it is not possible to create an optimal online MAPF solver. Nevertheless, we propose effective online MAPF algorithms that balance solution quality, runtime, and the number of plan changes an agent makes during execution.

2010 ◽  
Vol 13 (04) ◽  
pp. 469-482 ◽  
Author(s):  
ELIO MARCHIONE ◽  
MAURICIO SALGADO ◽  
NIGEL GILBERT

This paper reports the results of a multi-agent simulation designed to study the emergence and evolution of symbolic communication. The novelty of this model is that it considers some interactional and spatial constraints to this process that have been disregarded by previous research. The model is used to give an account of the implications of differences in the agents' behavior, which are embodied in a spatial environment. Two communicational dimensions are identified: the frequency with which agents refer to different topics over time and the spatial limitations on reaching recipients. We use the model to point out some interesting emergent communicational properties when the agents' behavior is altered by considering those two dimensions. We show the group of agents able to reach more recipients and less prone to changing the topic have the highest likelihood of driving the emergence and evolution of symbolic communication.


Author(s):  
F. M. T. BRAZIER ◽  
C. M. JONKER ◽  
J. TREUR ◽  
N. J. E. WIJNGAARDS

Evolution of automated systems, in particular evolution of automated agents based on agent deliberation, is the topic of this paper. Evolution is not a merely material process, it requires interaction within and between individuals, their environments and societies of agents. An architecture for an individual agent capable of (1) deliberation about the creation of new agents, and (2) (run-time) creation of a new agent on the basis of this, is presented. The agent architecture is based on an existing generic agent model, and includes explicit formal conceptual representations of both design structures of agents and (behavioural) properties of agents. The process of deliberation is based on an existing generic reasoning model of design. The architecture has been designed using the compositional development method DESIRE, and has been tested in a prototype implementation.


Overlapping coalition formation is a very active research field in multi-agent systems (MAS). In overlapping coalition, each agent can participate in different coalitions corresponding to multiple tasks at the same time. As each agent has limited resources, resource conflicts will occur. In order to resolve resource conflicts, we develop an improved encoding revision algorithm in this paper which can revise an invalid two-dimensional binary encoding into a valid one by checking the encoding for each row. To verify the effectiveness of the algorithm, differential evolution was used as the experimental platform and compared with Zhang et al. The experimental results show that the algorithm in this paper is superior to Zhang et al. in both solution quality and encoding revision time.


Author(s):  
Chun Wang ◽  
Weiming Shen ◽  
Hamada Ghenniwa

This paper investigates issues in the application of auctions as negotiation mechanisms to agent based manufacturing scheduling. We model the negotiation environments that agents encounter as inter-enterprise environment and intra-enterprise environment. A formulation of intra-enterprise scheduling economy is presented. We proved that at price equilibrium, the solution computed by the agents in the economy is a Pareto optimal. AS our first attempt, we formally formulate automated auction configuration as an optimization problem. By solving the problem adaptive negotiation in multi-agent systems can be achieved. In addition to the theoretical models, we discussed various types of auction mechanisms and their applications to agent based manufacturing scheduling. Heuristics and procedures are proposed for solving the automated auction configuration problem. To validate the analysis and proposed approaches, as a case study, we apply the automated auction configuration heuristics and the procedure to an agent based shop floor scheduling environment. Experimental results show that the auction protocol selected by the proposed heuristics provides correct system functionalities. In addition, we compared the selected mechanism with other candidate mechanisms. We found that the selected one performs better in terms of reducing communication cost and improving solution quality.


Sign in / Sign up

Export Citation Format

Share Document