Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators:...

20
Intelligent Intelligent Patrolling Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1

Transcript of Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators:...

Page 1: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

Intelligent Patrolling Intelligent Patrolling

Sarit KrausDepartment of Computer Science

Bar-Ilan University

Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless

1

Page 2: Intelligent Patrolling Sarit Kraus Department 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.

Page 3: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

3

Randomized CheckpointsRandomized Checkpoints

Page 4: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

Multi-Robot Adversarial Multi-Robot Adversarial PatrolPatrol

• Motivation:

• High security facilities

• Large military bases

• Neighborhood watch

4

Page 5: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

5

Page 6: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

routeroute

6

Page 7: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

Page 8: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

Page 9: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

9

Robotic ModelRobotic Model• k homogenous robots

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

Page 10: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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.

Page 11: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

Page 12: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

Page 13: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

Page 14: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

Page 15: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

Page 16: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

What Happens If What Happens If Penetration DetectedPenetration Detected??

16

Page 17: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

Page 18: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

Naïve ApproachNaïve Approach• Deterministic:

Each robot goes straight to its final position

18

Page 19: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

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

Page 20: Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.

20

Physical Security with Physical Security with

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

• Automated randomization is important

• Interesting problems? [email protected]