Minimax Persistent Monitoring of a network system

Samuel C. Pinto, Shirantha Welikala, Sean B. Andersson, Julien M. Hendrickx, Christos G. Cassandras

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We investigate the problem of optimally observing a finite set of targets using a mobile agent over an infinite time horizon. The agent is tasked to move in a network-constrained structure to gather information so as to minimize the worst-case uncertainty about the internal states of the targets. To do this, the agent has to decide its sequence of target-visits and the corresponding dwell-times at each visited target. For a given visiting sequence, we prove that in an optimal dwelling time allocation the peak uncertainty is the same among all the targets. This allows us to formulate the optimization of dwelling times as a resource allocation problem and to solve it using a novel efficient algorithm. Next, we optimize the visiting sequence using a greedy exploration process, using heuristics inspired by others developed in the context of the traveling salesman problem. Numerical results are included to illustrate the contributions.

Original languageEnglish
Article number110808
JournalAutomatica
Volume149
DOIs
StatePublished - Mar 2023

Keywords

  • Control over network
  • Mobile robots
  • Network systems

Fingerprint

Dive into the research topics of 'Minimax Persistent Monitoring of a network system'. Together they form a unique fingerprint.

Cite this