Deploying PAWS: Field Optimization of the Protection Assistant for Wildlife Security Fang et al.

Slides:



Advertisements
Similar presentations
F. Amigoni, N. Basilico, N. Gatti DEI, Politecnico di Milano Finding the Optimal Strategies in Robotic Patrolling with Adversaries in Topologically-Represented.
Advertisements

Markov Decision Process
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Games & Adversarial Search Chapter 5. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent’s reply. Time.
Two-Player Zero-Sum Games
Markov Game Analysis for Attack and Defense of Power Networks Chris Y. T. Ma, David K. Y. Yau, Xin Lou, and Nageswara S. V. Rao.
Regret Minimizing Audits: A Learning-theoretic Basis for Privacy Protection Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha Carnegie Mellon.
Games & Adversarial Search
CSE 380 – Computer Game Programming Pathfinding AI
Applications of Single and Multiple UAV for Patrol and Target Search. Pinsky Simyon. Supervisor: Dr. Mark Moulin.
Regret Minimizing Audits: A Learning-theoretic Basis for Privacy Protection Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha Carnegie Mellon.
Artificial Intelligence in Game Design Introduction to Learning.
Markov Decision Processes
Planning under Uncertainty
The Cat and The Mouse -- The Case of Mobile Sensors and Targets David K. Y. Yau Lab for Advanced Network Systems Dept of Computer Science Purdue University.
x – independent variable (input)
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
Duality Lecture 10: Feb 9. Min-Max theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum Cut Both.
Solving the Protein Threading Problem in Parallel Nocola Yanev, Rumen Andonov Indrajit Bhattacharya CMSC 838T Presentation.
Continuum Crowds Adrien Treuille, Siggraph 王上文.
Games & Adversarial Search Chapter 6 Section 1 – 4.
Computer vision: models, learning and inference Chapter 10 Graphical Models.
Commitment without Regrets: Online Learning in Stackelberg Security Games Nika Haghtalab Carnegie Mellon University Joint work with Maria-Florina Balcan,
Improved results for a memory allocation problem Rob van Stee University of Karlsruhe Germany Leah Epstein University of Haifa Israel WADS 2007 WAOA 2007.
Introduction to variable selection I Qi Yu. 2 Problems due to poor variable selection: Input dimension is too large; the curse of dimensionality problem.
The Multiplicative Weights Update Method Based on Arora, Hazan & Kale (2005) Mashor Housh Oded Cats Advanced simulation methods Prof. Rubinstein.
Game Playing.
When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing Fei Fang 1, Peter Stone 2, Milind Tambe 1 University.
Bill Payment Optimization Algorithms. Purpose To find and/or construct algorithms that will optimize the decision process of paying bills from an account.
Online Algorithms By: Sean Keith. An online algorithm is an algorithm that receives its input over time, where knowledge of the entire input is not available.
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
Artificial Intelligence in Game Design Dynamic Path Planning Algorithms.
Adrian Treuille, Seth Cooper, Zoran Popović 2006 Walter Kerrebijn
Jumping, Climbing, and Tactical Reasoning Section 2.5 Tom Schaible CSE 497 – AI & Game Programming.
Copyright 2010, The World Bank Group. All Rights Reserved. Testing and Documentation Part II.
© 2009 Ilya O. Ryzhov 1 © 2008 Warren B. Powell 1. Optimal Learning On A Graph INFORMS Annual Meeting October 11, 2009 Ilya O. Ryzhov Warren Powell Princeton.
CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.
Game tree search Chapter 6 (6.1 to 6.3 and 6.6) cover games. 6.6 covers state of the art game players in particular. 6.5 covers games that involve uncertainty.
Course Code #IDCGRF001-A 5.1: Searching and sorting concepts Programming Techniques.
Maps & Compasses (Part 2)
Extensive-Form Game Abstraction with Bounds
SLOPE FIELDS & EULER’S METHOD
SLOPE FIELDS & EULER’S METHOD
Tools for Decision Analysis: Analysis of Risky Decisions
C. Kiekintveld et al., AAMAS 2009 (USC) Presented by Neal Gupta
DS595/CS525 Team#2 - Mi Tian, Deepan Sanghavi, Dhaval Dholakia
Markov Decision Processes
Communication Complexity as a Lower Bound for Learning in Games
Extensive-form games and how to solve them
Application of network flow: Protecting coral reef ecosystems
Games with Chance Other Search Algorithms
When Security Games Go Green
Chapter 6 : Game Search 게임 탐색 (Adversarial Search)
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 2 Bayesian Games Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Instructor: Shengyu Zhang
Take Notes as you view the slides
Presented By Aaron Roth
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Instructor: Vincent Conitzer
ML – Lecture 3B Deep NN.
A Near-Optimal Sensor Placement Algorithm to Achieve Complete Coverage/Discrimination in Sensor Networks Authors : Frank Y. S. Lin and P. L. Chiu, Student.
CS 416 Artificial Intelligence
15th Scandinavian Workshop on Algorithm Theory
Games & Adversarial Search
Topographic Maps.
Software Development Techniques
Normal Form (Matrix) Games
Games & Adversarial Search
Dr. Arslan Ornek MATHEMATICAL MODELS
Multiobjective Optimization
Presentation transcript:

Deploying PAWS: Field Optimization of the Protection Assistant for Wildlife Security Fang et al.

The Problem Poaching is a big problem! Tigers, elephants, rhinos, and many more Patrols can be used to combat poaching Limited resources How can we allocate patrols optimally?

PAWS-Initial First attempt: PAWS-Initial Game theoretic approach to planning patrol routes Models poaching as repeated Stackelberg security game Poachers are attackers and patrollers are defenders Produces suggested areas to protect Uses data from previous patrols to optimize

PAWS-Initial: Stackelberg Security Game Conservation area modeled as a grid 1km x 1km Each cell is a potential target Payoff of a cell is determined by animal density Defender chooses a strategy, can be mixed, of which cells to protect Attacker observes defender’s strategy, then attacks a target Attack: snare, poacher, poaching camp, etc Zero-sum game Attacker uses bounded rationality for decisions SUQR model

PAWS-Initial: Gathering Data Patrollers gather data and photos from patrol route Human signs and animal signs This data is used to infer human activity and animal density Patrols improve over time

PAWS-Initial: What it Did Well Information from previous patrols/rounds used in subsequent rounds Effectiveness improves over time Bounded rationality better models real attackers Attackers are not completely rational

PAWS-Initial: Issues Didn’t account for topography “completely unanticipated” - Really? Patrol routes crossed large bodies of water, extreme slopes, etc Didn’t account for uncertainty in animal locations We don’t always know where they are Not scalable Too slow for large areas Chooses targets but not routes Set of targets not necessarily practical

Accounting for Topography Divide each cell into 50m x 50 m “Raster Pieces” These record topographic information Elevation, water, etc Derived from topographical map input Account for elevation changes using standard hiking difficulty functions Account for extra difficulty as added distance, bound total distance Identify and prioritize “preferred terrain features” Ridgelines, river banks Easier to traverse, often followed by animals and poachers Route distance limits

Improving Scalability “Street map” approach Map area as set of nodes and edges Nodes are small groups of raster pieces with significance Edges are easiest topographical path between them Allows scalability while still providing 50m resolution

Accounting for Uncertainty Interval uncertainty used to model unknown animal locations Payoffs are known to lie within a certain interval Cells patrolled more frequently have less uncertainty More information gathered

Making it All Work Together: ARROW ARROW algorithm for payoff uncertainty and bounded rationality Behavioral minimax regret Naive Solution: Find route that minimizes maximum regret for defenders But there are too many routes Instead, find optimal set of targets to protect WITHOUT considering route Coverage vector: List of targets and probability of defending them Then, check if coverage vector is satisfiable. If so, done! If not, refine solution.

Making it All Work Together: BLADE Given coverage vector, check if there is a valid route that satisfies it. Iteratively generate routes until: We find a constraint verifying it’s impossible We have enough valid routes to match the coverage vector probabilities with a mixed strategy Avoids enumerating all routes Scalable If not possible, return a constraint to ARROW This is a cutting plane through This allows ARROW to refine its solution Routes generated using S-algorithm for orienteering Local search over large number of possible routes Approximates optimal route

ARROW BLADE S-Algorithm

PAWS: Real-World Results “PAWS patrols are now regularly deployed at a conservation area in Malaysia.” “The patrollers mostly followed PAWS’s suggested route, indicating that the route generated by PAWS is easy to follow.” “In addition, patrollers commented that PAWS is able to guide them towards poaching hotspots”

PAWS: Real-World Results PAWS-Initial PAWS

PAWS: Real-World Results

Conclusion A pure game theoretic approach was a good start. Real-world problems are often messy. Field experience was needed to make this tool useful. Now it is deployed and getting real results! Management of PAWS was turned over to ARMORWAY according to paper Not sure if this actually happened