Some Results on Max-Min Pursuit.
Abstract
A pursuer P and an evader E are confined to a subset S of the Euclidean plane. E, whose speed is bounded by = or > 1, wants to maintain the greatest possible distance between himself and P, whose speed is bounded by 1. It is shown that when S is a half-plane or a circle, E can prevent /PE/ from falling below its initial value only if he can do so by using a strategy which keeps /PE/ constant. The result is used to characterize d', the largest value of /PE/ that E can maintain. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 06, 1972
- Accession Number
- AD0752044
Entities
People
- James Flynn
Organizations
- Stanford University