Paper Info
Title
On the communication range in auction-based multi-agent target assignment
Abstract
In this paper, we consider a decentralized approach to the multi-agent target assignment problem and explore the deterioration of the quality of assignment solution in respect to the decrease of the quantity of the information exchanged among communicating agents and their communication range when the latter is not sufficient to maintain the connected communication graph. The assignment is achieved through a dynamic iterative auction algorithm in which agents (robots) assign the targets and move towards them in each period. In the case of static targets and connected communication graph, the algorithm results in an optimal assignment solution. The assignment results are compared with two benchmark cases: a centralized one in which all the global information is known and therefore, the optimal assignment can be found, and the greedy one in which each agent moves towards the target with the highest benefit without communication with any other agent.
Year
DOI
Venue
2011
10.1007/978-3-642-19167-1_4
Lecture Notes in Computer Science
Keywords
Field
DocType
optimal assignment solution,algorithm result,communication range,assignment result,auction-based multi-agent target assignment,multi-agent target assignment problem,optimal assignment,connected communication graph,assignment solution,dynamic iterative auction algorithm,agent move,assignment problem,random geometric graph,information exchange
Weapon target assignment problem,Mathematical optimization,Computer science,Quadratic assignment problem,Generalized assignment problem,Assignment problem,Random geometric graph,Robot,Auction algorithm,Linear bottleneck assignment problem,Distributed computing
Conference
Volume
ISSN
Citations 
6557
0302-9743
4
PageRank 
References 
Authors
0.42
14
2
Name
Order
Citations
PageRank
Marin Lujak19815.72
Stefano Giordani218317.55