Optimal Decision-Making in an Opportunistic Sensing Problem

Derek Mikesell, Christopher Griffin

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

In this paper, we consider the problem of sensing a finite set of (moving) objects over a finite planning horizon using a set of sensors in prefixed locations that vary with respect to time over a discretized space. Control in this situation is limited and the problem considered is one of opportunistic sensing. We formulate an integer program that maximizes the quality of sensor return given either deterministic or probabilistic (i.e., forecasted) object routes. We examine the computational complexity of the problem and show it is non-deterministic polynomial-hard. We theoretically and numerically illustrate subclasses of the problem that are computationally simpler, ultimately deriving a heuristic that is strongly polynomial. Real-world and constructed data sets are used in our analysis.

Original languageEnglish (US)
Pages (from-to)3285-3293
Number of pages9
JournalIEEE Transactions on Cybernetics
Volume46
Issue number12
DOIs
StatePublished - Dec 2016

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Information Systems
  • Human-Computer Interaction
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Optimal Decision-Making in an Opportunistic Sensing Problem'. Together they form a unique fingerprint.

Cite this