Single Sensor Scheduling for Multi-Site Surveillance (PREPRINT)

Abstract

This paper is concerned with scheduling a single sensor to visit a number of sites with possibly time-variant dynamics. The paper motivates and presents a mathematical model for a sensor scheduling problem arising in the context of military operations research. The contributions made in the paper include the development and comparison of both deterministic and stochastic sensor scheduling methods. Results obtained in the paper show that the proposed heuristic methods can be used in real-time. A computational study is also provided. A deterministic greedy method produces the lowest cost solutions among the heuristics tested. The greedy methods produce the most predictable schedules, while the stochastic methods produce solutions that are less predictable in terms of site revisit times.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2007
Accession Number
ADA474426

Entities

People

  • David E. Jeffcoat
  • Mesut Yavuz

Organizations

  • Air Force Research Laboratory

Tags

Communities of Interest

  • Sensors
  • Space

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Artificial Satellites
  • Cameras
  • Computer Science
  • Detectors
  • Heuristic Methods
  • Image Processing
  • Improvised Explosive Devices
  • Mathematical Models
  • Military Operations
  • Models
  • Operations Research
  • Probability
  • Sensor Networks
  • Theoretical Computer Science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Operations Research
  • Software Engineering.