Near-Optimal Finite Solutions to the Three and Four Step Discrete Evasion Games
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
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.
- Attack and Fighter Aircraft
- Statistics and Probability
- Marine Engineering
- Fire Control and Bombing Systems