Near-Optimal Finite Solutions to the Three and Four Step Discrete Evasion Games

Abstract

A review of discrete pursuer-evader games and known solutions is presented. A method is given for obtaining a finite memory, near-optimal evader strategy for the three-step game, which greatly reduces data storage requirements from previous near-optimal strategies. Additionally near-optimal evader strategies for the four-step game are discussed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1983
Accession Number
ADA136811

Entities

People

  • Scott W. Goodson

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • California
  • Corporations
  • Data Storage Systems
  • Detonations
  • Game Theory
  • Hit Probabilities
  • Kill Probabilities
  • Linear Programming
  • Maneuvers
  • Motivation
  • Operations Research
  • Probability
  • Schools
  • Sequences
  • Transitions
  • United States
  • United States Naval Academy

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Game Theory.
  • Mycotoxin ecology in Amazonian ecosystems.