Abstract
Abstract : A pursuit-evasion process with uncertain state dependent measurements, in finite discrete time, and in a finite discrete state space is considered. Three types of strategies which might be employed in such a process are compared, and attention is concentrated on the behavior strategy, the least well known of the three types, but often the simplest optimal strategy to employ. A variation of the Brown-Robinson fictitious play algorithm is presented, which can be used to compute behavior strategies in the case of perfect recall processes. Two examples are given in which optimal behavior strategies are computed using the algorithm, and compared with a type of plausible but non-optimal 'separation' strategy. (Author)
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
