Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment

05/08/2018
by   Tomáš Brázdil, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2021

The Value of Information When Deciding What to Learn

All sequential decision-making agents explore so as to acquire knowledge...
research
03/03/2022

Uncertainty with UAV Search of Multiple Goal-oriented Targets

This paper considers the complex problem of a team of UAVs searching tar...
research
05/21/2021

Bounds on Optimal Revisit Times in Persistent Monitoring Missions with a Distinct & Remote Service Station

Persistent monitoring missions require an up-to-date knowledge of the ch...
research
05/17/2023

Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems

We consider the problem of synthesizing resilient and stochastically sta...
research
02/18/2021

Smart Build Targets Batching Service at Google

Google has a monolithic codebase with tens of millions build targets. Ea...
research
12/19/2020

Experimental evaluation of complete safe coordination of astrobots for Sloan Digital Sky Survey V

The data throughput of massive spectroscopic surveys in the course of ea...
research
05/05/2023

Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding

This study extends the recently-developed LaCAM algorithm for multi-agen...

Please sign up or login with your details

Forgot password? Click here to reset