The Approximate Solution of a Simple Constrained Search Path Moving Target Problem Using Moving Horizon Policies.

Abstract

A simple moving target problem is approximately solved for that search path minimizing the probability of non-detection subject to specified constraints on the search path. The solution procedure uses moving horizon policies. An 'almost asymptotically geometric' structure is observed in the solution. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1984
Accession Number
ADA142164

Entities

People

  • J. N. Eagle

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computer Programming
  • Computers
  • Detection
  • Dynamic Programming
  • Linear Programming
  • Moving Targets
  • Observation
  • Operations Research
  • Probability
  • Probability Distributions
  • South Africa
  • Target Detection
  • Targets
  • Technical Information Centers
  • Transitions

Readers

  • Calculus or Mathematical Analysis
  • Sensor Fusion and Tracking Systems.
  • Statistical inference.