2009-current

My lab's page for this project can be found here.

Given a general notion of the structure of a city, how can a police force best protect a set of high-profile targets? What is the safest route between multiple points in a metropolitan area, given only a general notion of potential adversarial attack vectors?

We believe that a satisfactory answer to either of these questions will require a thorough understanding of strategies used by both agents under our control (the "good guys") and their adversaries (the "bad guys").

In this project, we present and analyze novel methods for both attacking and defending targets. Our algorithms use a general graph-based model that translates easily to the real world. We explore the notion of optimality and, in the cases when computation of optimal strategies proves intractible, present algorithms for good approximate solutions.

Once a rigorous analysis of our model and its algorithms are complete, we plan to venture into the world of serious games, with the hope of learning how real world adversaries compare against our theoretically optimal constructions.

For additional information, please contact Dr. V.S. Subrahmanian.

My lab's page for this project can be found here.

J.P. Dickerson, G.I. Simari, V.S. Subrahmanian, Sarit Kraus. A Graph-Theoretic Approach to Protect Static and Moving Targets from Adversaries. (Under review for AAMAS 2010!)

This research funded in part by the University of Maryland Institute for Advanced Computer Studies (UMIACS) and the Bar-Ilan Department of Computer Science (CS@BIU).