Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Multi-Agent Patrolling with Reinforcement Learning
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
A Theoretical Analysis of Multi-Agent Patrolling Strategies
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Multi-agent patrolling: an empirical analysis of alternative architectures
MABS'02 Proceedings of the 3rd international conference on Multi-agent-based simulation II
Probabilistic Multiagent Patrolling
SBIA '08 Proceedings of the 19th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Multi-a(ge)nt Graph Patrolling and Partitioning
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Autonomous multi-agent cycle based patrolling
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Performance based task assignment in multi-robot patrolling
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Multi-agent systems can be used to perform patrolling tasks in various domains. In this work, we compare the results obtained by new negotiation based approaches with previous ones. By splitting the nodes of the world graph, the negotiator agents reduce the path they have to walk and the number of nodes to patrol, making it easier to maintain a low average idleness in world nodes. Auctions are the negotiation mechanisms used to split the nodes of the world, the agents bid on nodes based in their utility function. Empirical evaluation has shown the effectiveness of this distributed approach, as the results obtained are substantially better than those previously achieved by negotiator agents. The agent types presented in this work are more scalable and reactive since they can perform patrolling in worlds of all sizes and topology types. Besides, they are more stable as indicated by the low standard deviation obtained in node idleness.