Developing a Deterministic Patrolling Strategy for Security Agents

Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these systems is the patrolling strategy; namely, the determination of where to move in order to conveniently detect intrusions. While a...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 Vol. 2; pp. 565 - 572
Main Authors: Basilico, Nicola, Gatti, Nicola, Amigoni, Francesco
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 15.09.2009
IEEE
Series:ACM Conferences
Subjects:
Computer systems organization > Embedded and cyber-physical systems > Robotics
Computing methodologies > Artificial intelligence > Control methods > Robotic planning
Computing methodologies > Artificial intelligence > Distributed artificial intelligence > Intelligent agents
Computing methodologies > Artificial intelligence > Planning and scheduling
Computing methodologies > Artificial intelligence > Planning and scheduling > Robotic planning
Computing methodologies > Artificial intelligence > Search methodologies
Computing methodologies > Artificial intelligence > Search methodologies > Discrete space search
Computing methodologies > Artificial intelligence > Search methodologies > Game tree search
Conferences
constraint satisfaction problem
Intelligent agent
Mathematics of computing > Mathematical analysis > Mathematical optimization
Mobile robots
Protection
Robotic patrolling with adversaries
Security
Sensor systems
Theory of computation > Design and analysis of algorithms > Mathematical optimization
traveling salesman problem
Traveling salesman problems
Utility theory
Robotic patrolling with adversaries
constraint satisfaction problem
traveling salesman problem
ISBN:0769538010, 9780769538013
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these systems is the patrolling strategy; namely, the determination of where to move in order to conveniently detect intrusions. While a large part of patrolling strategies proposed so far adopt some kind of random movements, deterministic strategies can be useful in some situations of interest. In this paper, we propose an approach to find a deterministic strategy that allows the patrolling agent to always detect an intruder that attempts to enter an environment. The problem is formulated as the determination of a cyclic path that visits, under temporal constraints, all the vertexes of a graph representing the environment. We propose a solving algorithm, study its properties, and experimentally evaluate it.
ISBN:0769538010
9780769538013
DOI:10.1109/WI-IAT.2009.212