Download presentation

Presentation is loading. Please wait.

Published byNataly Harkins Modified over 2 years ago

1
Randomized Sensing in Adversarial Environments Andreas Krause Joint work with Daniel Golovin and Alex Roper International Joint Conference on Artificial Intelligence 2011 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAA

2
Motivation Want to manage sensing resources to enable robust monitoring under uncertainty 2 Robotic environmental monitoring Detect survivors after disaster Coordinate cameras to detect intrusions

3
4 Select two cameras to query, in order to detect the most people. 3 People Detected: 2 Duplicates only counted once A Sensor Selection Problem

4
Set V of sensors, |V| = n Select a set of k sensors Sensing quality model NP-hard… 4 A Sensor Selection Problem

5
5 Submodularity Diminishing returns property for adding more sensors. Many objectives are submodular [K, Guestrin ‘07] Detection, coverage, mutual information, and others +2 +1 For all, and a sensor,

6
Greedy algorithm 6 Lets choose sensors S = {v 1, …, v k } greedily [Nemhauser et al ‘78] If F is submodular, greedy algorithm gives constant factor approx.:

7
iF i ({3})F i ({5}) 101 210 Sensing in Adversarial Environments Set I of m intrusion scenarios For scenario i: F i (A) is sensing utility when selecting A Intruder chooses worst-case scenario, knowing the sensors 7 2 1

8
Deterministic minimax solution One approach: Want to solve [K, McMahan, Guestrin, Gupta ’08]: NP-hard Greedy algorithm fails arbitrarily badly S ATURATE algorithm provides near-optimal solution 8

9
Disadvantage of minimax approach Suppose we pick {3} and {5} with probability 1/2 Randomization can perform arbitrarily better! 9 1 2 iF i ({3})F i ({5}) 110 201

10
The randomized sensing problem Given submodular functions F 1,…,F m, want to find NP-hard! Even representing the optimal solution may require exponential space! 10

11
Existing approaches Many techniques for solving matrix games Typically don’t scale to combinatorially large strategy sets Security games [Tambe et al] Solve large scale Stackelberg games for security applications Cannot capture general submodular objective functions LP based approach [Halvorson et al ‘09] Double oracle with approximate best response No polynomial time convergence convergence guarantee 11

12
Randomized sensing Define 12 Thus, can minimize over q instead of over p! Distribution over sensing actions Distribution over intrusions

13
Equivalent problem: Finding q* Want to solve Use multiplicative update algorithm [Freund & Schapire ‘99] Initialize For t = 1:T 13 NP-hard But submodular!

14
The RS ENSE algorithm Initialize For t=1:T Use greedy algorithm to compute based on objective function Update Return 14

15
Performance guarantee Theorem: Let Suppose RS ENSE runs for iterations. For the resulting distribution it holds that 15

16
Handling more general constraints So far: wanted Many application may require more complex constraints: Examples: Informative path planning: Controlling PTZ cameras: Nonuniform cost: Can replace greedy algorithm by - best response RS ENSE guarantees 16

17
17 Example: Lake monitoring Monitor pH values using robotic sensor Position s along transect pH value Observations A True (hidden) pH values Prediction at unobserved locations transect Where should we sense to minimize our maximum error? Use probabilistic model (Gaussian processes) to estimate prediction error (often) submodular [Das & Kempe ’ 08] Var(s | A)

18
Experimental results Randomized sensing outperforms deterministic solutions 18

19
Running time RS ENSE outperforms existing LP based method 19

20
20 pSPIEL Results: Search & Rescue Map from Robocup Research Challenge Coordination of multiple mobile sensors to detect survivors of major urban disaster Buildings obstruct viewfield of camera F i (A) = Expected # of people detected at location i Detection Range Detected Survivors

21
Experimental results Randomization outperforms deterministic solution RS ENSE finds solution faster than existing methods 21

22
22 Worst- vs. average case Given: Possible locations V, submodular functions F 1,…,F m Average-case scoreWorst-case score Strong assumptions!Very pessimistic! Want to optimize both average- and worst-case score! Can modify RS ENSE to solve this problem! Compute best response to

23
Tradeoff results 23 Worst case score Average case score Knee in tradeoff curve Search &rescue Worst case score Average case score Envtl. monitoring Can find good compromise between average- and worst-case score!

24
Conclusions Wish to find randomized strategy for maximizing an adversarially-chosen submodular function Developed RS ENSE, which provides near-optimal performance Performs well on two real applications Search and rescue Environmental monitoring 24

Similar presentations

OK

Online Distributed Sensor Selection Daniel Golovin, Matthew Faulkner, Andreas Krause theory and practice collide 1.

Online Distributed Sensor Selection Daniel Golovin, Matthew Faulkner, Andreas Krause theory and practice collide 1.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Download ppt on search engine Ppt on credit default swaps greece Ppt on movable bridge Mp ppt online counselling 2012 Ppt on history of atom bomb Ppt on green revolution in india and its effects Ppt on earth day 2014 Ppt on fire drill in company Ppt on poet robert frost Ppt on carburetor parts