Robotic surveillance and Markov chains with minimal first passage time

We propose stochastic surveillance strategies for quickest detection of anomalies in discrete network environments. Our surveillance strategy is determined by optimizing the mean first passage time also known as the Kemeny constant of a Markov chain. We generalize the notion of the Kemeny constant to environments with heterogeneous travel and service times, denote this generalization as the weighted Kemeny constant, and characterize its properties. For reversible Markov chains, we show that both the Kemeny constant and its heterogeneous counterpart can be formulated as convex optimization problems and, moreover, can be expressed as semidefinite programs (SDPs). We numerically illustrate the proposed design: compared with other well-known Markov chains, the performance of our Kemeny-based strategies are always better and in many cases substantially so.

[1]  J. Kaufman,et al.  Response time effectiveness: comparison of response time and survival in an urban emergency medical services system. , 2002, Academic emergency medicine : official journal of the Society for Academic Emergency Medicine.

[2]  Lada A. Adamic,et al.  The role of social networks in information diffusion , 2012, WWW.

[3]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[4]  Steve Kirkland,et al.  Fastest expected time to mixing for a Markov chain on a directed graph , 2010 .

[5]  Mark Levene,et al.  Kemeny's Constant and the Random Surfer , 2002, Am. Math. Mon..

[6]  Jeffrey J. Hunter,et al.  Mathematical Techniques of Applied Probability. Volume 1: Discrete Time Models; Basic Theory , 1983 .

[7]  Lin Chen,et al.  A Game Theoretical Framework on Intrusion Detection in Heterogeneous Networks , 2009, IEEE Transactions on Information Forensics and Security.

[8]  Antonio Franchi,et al.  On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms , 2011, IEEE Transactions on Robotics.

[9]  Antonio Franchi,et al.  On optimal cooperative patrolling , 2010, 49th IEEE Conference on Decision and Control (CDC).

[10]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[11]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[12]  A. Patcha,et al.  A game theoretic approach to modeling intrusion detection in mobile ad hoc networks , 2004, Proceedings from the Fifth Annual IEEE SMC Information Assurance Workshop, 2004..

[13]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[14]  L.E. Parker,et al.  Intruder detection using a wireless sensor network with an intelligent mobile robot response , 2008, IEEE SoutheastCon 2008.

[15]  Francesco Bullo,et al.  Stochastic surveillance strategies for spatial quickest detection , 2011, IEEE Conference on Decision and Control and European Control Conference.

[16]  Zonghua Liu,et al.  How community structure influences epidemic spread in social networks , 2008 .

[17]  Jeffrey J. Hunter,et al.  Mathematical techniques of applied probability , 1985 .

[18]  Giorgio Cannata,et al.  A Minimalist Algorithm for Multirobot Continuous Coverage , 2011, IEEE Transactions on Robotics.

[19]  Raffaello D'Andrea,et al.  Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses , 2007, AI Mag..

[20]  J. Baillieul,et al.  Stochastic Strategies for Autonomous Robotic Surveillance , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[21]  J. Hunter.  The Role of Kemeny's Constant in Properties of Markov Chains , 2012, 1208.4716.

[22]  Dusan M. Stipanovic,et al.  On a stochastic robotic surveillance problem , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.