Solving Patrolling Problems in the Internet Environment
Solving Patrolling Problems in the Internet Environment
Tomas Brazdil, Antonin Kucera, Vojtech Rehak
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
Main track. Pages 121-127.
https://doi.org/10.24963/ijcai.2018/17
We propose an algorithm for constructing efficient patrolling strategies in the Internet environment, where the protected targets are nodes connected to the network and the patrollers are software agents capable of detecting/preventing undesirable activities on the nodes. The algorithm is based on a novel compositional principle designed for a special class of strategies, and it can quickly construct (sub)optimal solutions even if the number of targets reaches hundreds of millions.
Keywords:
Agent-based and Multi-agent Systems: Multi-agent Planning
Planning and Scheduling: Distributed;Multi-agent Planning
Planning and Scheduling: Planning and Scheduling
Agent-based and Multi-agent Systems: Algorithmic Game Theory
Agent-based and Multi-agent Systems: Resource Allocation