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.

Developing a deterministic patrolling strategy for security agents / N. Basilico, N. Gatti, F. Amigoni - In: Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT '09. IEEE/WIC/ACM International Joint Conferences on[s.l] : IEEE, 2009. - ISBN 9780769538013. - pp. 565-572 (( convegno IEEE/WIC/ACM International Conferences on Web Intelligence (WI)/Intelligent Agent Technologies (IAT) tenutosi a Milano nel 2009 [10.1109/WI-IAT.2009.212].

Developing a deterministic patrolling strategy for security agents

N. Basilico
;
2009

Abstract

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.
Robotic patrolling with adversaries; traveling salesman problem; constraint satisfaction problem
Settore INF/01 - Informatica
2009
Book Part (author)
File in questo prodotto:
File Dimensione Formato  
05285118.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 315.91 kB
Formato Adobe PDF
315.91 kB Adobe PDF [it] Default value:   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I metadati presenti in AIR sono rilasciati con licenza CCO mentre i file delle pubblicazioni sono rilasciati con licenza CC BY-SA, salvo diversa indicazione. In caso di violazione di copyright, contattare l'assistenza di AIR

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/454855
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? 14
  • OpenAlex ND
social impact