intelligent patrolling

Intelligent Patrolling Intelligent Patrolling

Sarit KrausDepartment of Computer Science

Bar-Ilan University

Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless

1

2

Physical Security with Physical Security with

Bounded ResourcesBounded Resources• Limited security resources prevent full security

coverage at all times; allows adversaries to observe and exploit patterns in selective patrolling or monitoring.

• Randomized patrolling or monitoring is necessary.

3

Randomized CheckpointsRandomized Checkpoints

Multi-Robot Adversarial Multi-Robot Adversarial PatrolPatrol

• Motivation:

• High security facilities

• Large military bases

• Neighborhood watch

4

Protecting a Parade: Protecting a Parade: route is announcedroute is announced

5

Protecting a Moving Protecting a Moving Target: randomizing the Target: randomizing the

routeroute

6

Why Do We Need Why Do We Need Automated Methods Automated Methods

for Randomizationfor Randomization??• People are not good at randomization

• The randomized strategy should depend on:o the adversary and the defenders’ utilitieso the environment parameters

o the defender’s resources.

7

8

Multi-Robot Multi-Robot Adversarial Patrol: Adversarial Patrol: The EnvironmentThe Environment

• PerimeteroDivided into segmentsoUniform time-distanceoRobot travels through one segment per time

unit

• Adversaryo Tries to penetrate through the perimetero Takes t>0 time units to penetrate

9

Robotic ModelRobotic Model• k homogenous robots

• Robotic movement model:o Robots’ movement is directedo Turning around “costs” τ time units

10

Algorithm FrameworkAlgorithm Framework• Patrol algorithm:

o Continue straight with probability po Turn around with probability 1-p

• PPD: Probability of Penetration Detection

• p depends on the distance between robots and on the penetration time.

11

Robot MovementRobot Movement

• Optimal: Robots are uniformly placed around the perimeter

• Coordinatedo If decide to turn around they do it simultaneouslyo Preserve uniform distance

12

• Optimal: Robots are uniformly placed around the perimeter

• Coordinated

– If decide to turn around they do it simultaneously

– Preserve uniform distance

Robot MovementRobot Movement

13

• Optimal: Robots are uniformly placed around the perimeter

• Coordinated

– If decide to turn around they do it simultaneously

– Preserve uniform distance

Robot MovementRobot Movement

14

• Optimal: Robots are uniformly placed around the perimeter

• Coordinated

– If decide to turn around they do it simultaneously

– Preserve uniform distance

Robot MovementRobot Movement

Handling EventsHandling EventsWhat if a robot needs to inspect the penetration?

•Once a penetration is detected, one robot is extracted from the team to inspect it

•Coordinated attacks are beneficial to the adversary

15

What Happens If What Happens If Penetration DetectedPenetration Detected??

16

What Happens If Penetration What Happens If Penetration

DetectedDetected??• Robot that detected the penetration will inspect it

• Other k-1 robots will spread uniformly o To achieve optimal behavior for k-1 robots

Phase 1: k robots (before event), steady statePhase 2: ReorganizationPhase 3: k-1 robots (after event), steady state

Optimal patrol known

17

Naïve ApproachNaïve Approach• Deterministic:

Each robot goes straight to its final position

18

Randomized Randomized ReorganizationReorganization

• Challenges: o each robot needs to move differentlyo How much time to spend on the reorganization?

• We randomized over possible paths

• Finding the strategy is complex, in theory, but we used heuristics to find it in reasonable time

19

20

Physical Security with Physical Security with

Bounded Resources: SummaryBounded Resources: Summary• Randomized patrolling or monitoring is necessary.

• Automated randomization is important

• Interesting problems? sarit@cs.biu.ac.il