Partial barrier coverage: Using game theory to optimize probability of undetected intrusion in polygonal environments

Stephen Kloder, Seth Hutchinson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we formalize the problem of partial barrier coverage, that is, the problem of using robot sensors (guards) to minimize the probability of undetected intrusion in a particular region by an intruder. We use ideas from noncooperative game theory together with previous results from complete barrier coverage - the problem of completely preventing undetected intrusion - to develop new methods that solve this problem for the specific case of bounded-range line-of-sight sensors in a two-dimensional polygonally-bounded region. Our solution constructs equilibrium strategies for the intruder and guards, and calculates the level of partial coverage.

Original languageEnglish (US)
Title of host publication2008 IEEE International Conference on Robotics and Automation, ICRA 2008
Pages2671-2676
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 IEEE International Conference on Robotics and Automation, ICRA 2008 - Pasadena, CA, United States
Duration: May 19 2008May 23 2008

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
ISSN (Print)1050-4729

Other

Other2008 IEEE International Conference on Robotics and Automation, ICRA 2008
Country/TerritoryUnited States
CityPasadena, CA
Period5/19/085/23/08

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Partial barrier coverage: Using game theory to optimize probability of undetected intrusion in polygonal environments'. Together they form a unique fingerprint.

Cite this