Milind Tambe

Dr. Milind Tambe


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 June 2018
Verified
Conference Paper
Open access
PDF file
EBElizabeth Bondi
Elizabeth Bondi
DDDebadeepta Dey
Debadeepta Dey
AKAshish Kapoor
Ashish Kapoor
JPJim Piavis
Jim Piavis
SSShital Shah
Shital Shah
MTMilind Tambe
Milind Tambe
Increases in poaching levels have led to the use of unmanned aerial vehicles (UAVs or drones) to count animals, locate animals in parks, and even find poachers. Finding poachers is often done at night through the use of long wave thermal infrared cameras mounted on these UAVs. Unfortunately, monitoring the live video stream from the conservation UAVs all night is an arduous task. In order to assist in this monitoring task, new techniques in computer vision have been developed. This work is based on a dataset which took approximately six months to label. However, further improvement in detection and future testing of autonomous flight require not only more labeled training data, but also an environment where algorithms can be safely tested. In order to meet both goals efficiently, we present AirSim-W, a simulation environment that has been designed specifically for the domain of wildlife conservation. This includes (i) creation of an African savanna environment in Unreal Engine, (ii) integration of a new thermal infrared model based on radiometry, (iii) API code expansions to follow objects of interest or fly in zigzag patterns to generate simulated training data, and (iv) demonstrated detection improvement using simulated data generated by AirSim-W. With these additional simulation features, AirSim-W will be directly useful for wildlife conservation research.

12 December 2011
Verified
Book Chapter
Closed access
CKChristopher Kiekintveld
Christopher Kiekintveld
JMJanusz Marecki
Janusz Marecki
MTMilind Tambe
Milind Tambe
Introduction Stackelberg games are increasingly important for informing real-world decision making, including a growing body of work that applies these techniques in security domains such as critical infrastructure protection (Bier, 2007; Sandler and D. G. A. M., 2003), computer networks (Alpcan and Basar, 2003; Nguyen and Basar 2009), and robot patrolling strategies (Agmon et al., 2009; Basilico, Gatti, and Amigoni, 2009; Gatti, 2008). Two software systems that use this type of game modeling are in use by the the Los Angeles International Airport (LAX) (Pita et al., 2008) and the Federal Air Marshals Service (FAMS) (Tsai et al., 2009) to assist with resource allocation decision. A key issue that has arisen in these applications is whether the models can accurately represent the uncertainty that domain experts have about the inputs used to construct the game models, including the preferences and capabilities of terrorist adversaries. To apply game-theoretic reasoning, the first step in the analysis is to construct a precise game model. The typical approach (e.g., in the LAX and FAMS applications) is to construct a model using a combination of the available data and expert opinions. Unfortunately, the data is often limited or imprecise, especially in regard to information about the terrorist adversaries. For example, it can be difficult to predict precisely how attackers will weigh casualties, economic consequences, media exposure, and other factors when selecting targets.

12 December 2011
Verified
Book Chapter
Closed access
JTJason Tsai
Jason Tsai
SRShyamsunder Rathi
Shyamsunder Rathi
CKChristopher Kiekintveld
Christopher Kiekintveld
FOFernando Ordóñez
Fernando Ordóñez
MTMilind Tambe
Milind Tambe
Introduction Transportation networks such as buses, trains, and airplanes carry millions of people per day and from to their destinations, making them a prime target for terrorists and extremely difficult for law enforcement agencies to protect. In 2001, the 9/11 attack on the World Trade Center in New York City with commercial airliners resulted in $27.2 billion of direct short term costs (Looney 2002) as well as a government-reported 2,974 lives lost. The 2004 Madrid commuter train bombings resulted in 191 lives lost, 1755 people wounded, and an estimated cost of 212 million Euros (Blanco et al., 2007). Finally, in the 2005 London subway and bus bombings, 52 innocent lives were lost, 700 others were injured, and the estimated economic cost was 2 billion pounds (Thornton, 2005). In addition to preboarding security checkpoints patrols aboard the vehicles are another key defensive measure used by many organizations in these domains (Billante, 2003; Kenney, 1989). In all these networks, there are hundreds or thousands of vehicles to protect, making it difficult to create patrol schedules. Furthermore, since motivated aggressors will attempt to observe law-enforcement patterns and try to exploit the schedule, law-enforcement organizations have embraced the use of randomization in their scheduling practices. Also, in all these networks, it is not possible to simply assign law-enforcement personnel to vehicles in isolation, without considering the route the vehicle takes as well as departure and arrival times.

27 June 2016 in Games
Verified
Journal Article
Open access
PDF file
CZChao Zhang
Chao Zhang
SGShahrzad Gholami
Shahrzad Gholami
DKDebarun Kar
Debarun Kar
ASArunesh Sinha
Arunesh Sinha
MJManish Jain
Manish Jain
MTMilind Tambe
Milind Tambe
Game theoretic approaches have recently been used to model the deterrence effect of patrol officers’ assignments on opportunistic crimes in urban areas. One major challenge in this domain is modeling the behavior of opportunistic criminals. Compared to strategic attackers (such as terrorists) who execute a well-laid out plan, opportunistic criminals are less strategic in planning attacks and more flexible in executing well-laid plans based on their knowledge of patrol officers’ assignments. In this paper, we aim to design an optimal police patrolling strategy against opportunistic criminals in urban areas. Our approach is comprised by two major parts: learning a model of the opportunistic criminal (and how he or she responds to patrols) and then planning optimal patrols against this learned model. The planning part, by using information about how criminals responds to patrols, takes into account the strategic game interaction between the police and criminals. In more detail, first, we propose two categories of models for modeling opportunistic crimes. The first category of models learns the relationship between defender strategy and crime distribution as a Markov chain. The second category of models represents the interaction of criminals and patrol officers as a Dynamic Bayesian Network (DBN) with the number of criminals as the unobserved hidden states. To this end, we: (i) apply standard algorithms, such as Expectation Maximization (EM), to learn the parameters of the DBN; (ii) modify the DBN representation that allows for a compact representation of the model, resulting in better learning accuracy and the increased speed of learning of the EM algorithm when used for the modified DBN. These modifications exploit the structure of the problem and use independence assumptions to factorize the large joint probability distributions. Next, we propose an iterative learning and planning mechanism that periodically updates the adversary model. We demonstrate the efficiency of our learning algorithms by applying them to a real dataset of criminal activity obtained from the police department of the University of Southern California (USC) situated in Los Angeles, CA, USA. We project a significant reduction in crime rate using our planning strategy as compared to the actual strategy deployed by the police department. We also demonstrate the improvement in crime prevention in simulation when we use our iterative planning and learning mechanism when compared to just learning once and planning. Finally, we introduce a web-based software for recommending patrol strategies, which is currently deployed at USC. In the near future, our learning and planning algorithm is planned to be integrated with this software. This work was done in collaboration with the police department of USC.

12 December 2011
Verified
Book Chapter
Closed access
CKChristopher Kiekintveld
Christopher Kiekintveld
MJManish Jain
Manish Jain
JTJason Tsai
Jason Tsai
JPJames Pita
James Pita
FOFernando Ordóñez
Fernando Ordóñez
MTMilind Tambe
Milind Tambe
Introduction Providing security for transportation systems, computer networks, and other critical infrastructure is a large and growing problem. Central to many of these security problems is a resource allocation task. For example, a police force may have limited personnel to conduct patrols, operate checkpoints, and conduct random searches. Other scarce resources including bomb-sniffing canines, vehicles, and security cameras. The key question is how to efficiently allocate these resources to protect against a wide variety of potential threats. The adversarial aspect of security domains poses unique challenges for resource allocation. A motivated attacker can gather information about security measures using surveillance and plan more effective attacks. Predictable resource allocations may be exploited by an attacker, greatly reducing resource effectiveness. A better approach for deploying security resources is to use randomization to increase the uncertainty of potential attackers. We develop new computational methods that use game-theoretic analysis to generate optimal randomized resource allocations for security domains. Game theory offers a more sophisticated approach to randomization than simply “rolling dice.” It allows the analyst to factor differential risks and values into the game model, and incorporates game-theoretic predictions of how the attacker will respond to a given security policy. Recent work by Paruchuri et al. uses a game-theoretic approach to create randomized security policies for traffic checkpoints and canine patrols at the Los Angeles International Airport (LAX), which are deployed in the daily airport-security operations (Paruchuri et al., 2008; Pita et al., 2008).

1 January 2004 in Autonomous Agents and Multi-Agent Systems
Verified
Journal Article
Closed access
PDF file
RNRanjit Nair
Ranjit Nair
MTMilind Tambe
Milind Tambe
SMStacy Marsella
Stacy Marsella
TRTaylor Raines
Taylor Raines