A probabilistic analysis for the range assignment problem in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Analysis of Dynamic Task Allocation in Multi-Robot Systems
International Journal of Robotics Research
Auction-based multi-robot task allocation in COMSTAR
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
On the connectivity of dynamic random geometric graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Repeated auctions for robust task execution by a robot team
Robotics and Autonomous Systems
Expert Systems with Applications: An International Journal
On the communication range in auction-based multi-agent target assignment
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
On mobile target allocation with incomplete information in defensive environments
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
| Hi-index | 0.00 |
In this paper, we consider a decentralized approach to the multi-agent target allocation problem where agents are partitioned in two groups and every member of each group is a possible target for the members of the opposite group. Each agent has a limited communication range (radius) and individual preferences for the target allocation based on its individual local utility function. Furthermore, all agents are mobile and the allocation is achieved through a proposed dynamic iterative auction algorithm. Every agent in each step finds its best target based on the auction algorithm and the exchange of information with connected agents and moves towards it without any insight in the decision-making processes of other agents in the system. In the case of connected communication graph among all agents, the algorithm results in an optimal allocation solution. We explore the deterioration of the allocation solution in respect to the decrease of the quantity of the information exchanged among agents and agents' varying communication range when the latter is not sufficient to maintain connected communication graph.