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
Consensus-based decentralized auctions for robusttask allocation
IEEE Transactions on Robotics
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
Value of incomplete information in mobile target allocation
MATES'11 Proceedings of the 9th German conference on Multiagent system technologies
| Hi-index | 0.00 |
In this paper, the decentralized mobile target allocation problem is researched. We assume the existence of two groups of mobile agents: attackers and targets. Every attacker agent gets allocated to its best target based on the communication and coordination with the rest of the group positioned within a limited communication range (radius) and moves towards it. This is performed through the dynamic iterative auction algorithm with mobility without any insight in the decision-making processes of the other agents. Targets are mobile and combine two strategies to escape from the attacking group: moving linearly and randomly away from the attacker. We explore the dynamics of the allocation solution in respect to the mentioned escape strategies, maximum step size in each run (velocity), and the agents' varying communication range when the latter is not sufficient to maintain a connected communication graph.