Solving Patrolling Problems in the Internet Environment

Investor logo

Warning

This publication doesn't include Faculty of Sports Studies. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRÁZDIL Tomáš KUČERA Antonín ŘEHÁK Vojtěch

Year of publication 2018
Type Article in Proceedings
Conference Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden.
MU Faculty or unit

Faculty of Informatics

Citation
Web IJCAI.org
Doi http://dx.doi.org/10.24963/ijcai.2018/17
Keywords patrolling games; strategy synthesis
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info