Distributed online patrolling with multi-agent teams of sentinels and searchers
Chung, Timothy H.
MetadataShow full item record
We consider the problem of patrolling an assigned area using a team of heterogeneous robots consisting of sentinels and searchers in the presence of stochastic arrivals of attacks. Sentinels and searchers operate using a different sensor model featuring a tradeoff between accuracy and the sensed area. Using an approach based on queuing theory, we derive an accurate analytic characterization of the patrolling performance that can be used to predict the behavior of a given configuration or inform the composition of a team in order to meet a desired target performance. Extensive simulation results corroborate our theoretical findings.
Showing items related by title, author, creator and subject.
Royset, J.O.,; Sato, H. (2010);We consider a discrete time-and-space route-optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically mov- ing targets. The paper formulates a novel convex ...
Mobile sensor networks a discrete event simulation of WMD threat detection in urban traffic schemes Hyink, Jeffrey F. (Monterey, California. Naval Postgraduate School, 2007-03);The rise of the threat of WMD attack on American soil necessitates new and innovative approaches to homeland security. A layered security model has been proposed in which an attacker must successfully penetrate multiple ...
Lohr, William J. (Monterey, California. Naval Postgraduate School, 1992-09);This thesis develops a model, called Area Motion Search (AMS), that determines the detection probability for a patrolling sensor searching for a randomly moving target in a fixed area. The AMS model reduces to exhaustive ...