Ants: agents on networks, trees, and subgraphs
Future Generation Computer Systems
Multi-Agent Patrolling with Reinforcement Learning
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Theoretical Analysis of the Multi-agent Patrolling Problem
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Swarm Approaches for the Patrolling Problem, Information Propagation vs. Pheromone Evaporation
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Self-Organization of Patrolling-Ant Algorithms
SASO '09 Proceedings of the 2009 Third IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Multi-agent patrolling: an empirical analysis of alternative architectures
MABS'02 Proceedings of the 3rd international conference on Multi-agent-based simulation II
Proceedings of the 2010 ACM Symposium on Applied Computing
Multi-robot area patrol under frequency constraints
Annals of Mathematics and Artificial Intelligence
Negotiator agents for the patrolling task
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Multirobot systems: a classification focused on coordination
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 12.05 |
The multi-robot patrolling problem is defined as the activity of traversing a given environment. In this activity, a fleet of robots visits some places at irregular intervals of time for security purpose. To date, this problem has been solved with different approaches. However, the approaches that obtain the best results are unfeasible for security applications because they are centralized and deterministic. To overcome the disadvantages of previous work, this paper presents a new distributed and non-deterministic approach based on a model from game theory called Smooth Fictitious Play. To this end, the multi-robot patrolling problem is formulated by using concepts of graph theory to represent an environment. In this formulation, several normal-form games are defined at each node of the graph. This approach is validated by comparison with best suited literature approaches by using a patrolling simulator. The results for the proposed approach turn out to be better than previous literature approaches in as many as 88% of the cases of study. Moreover, the novel approach presented in this work has many advantages over other approaches of the literature such distribution, robustness, scalability, and dynamism. The achievements obtained in this work validate the potential of game theory to protect infrastructures.