Nash strategies for pursuit-evasion differential games involving limited observations

A linear-quadratic N-pursuer single-evader differential game is considered. The evader can observe all the pursuers but pursuers have limited observations of themselves and the evader. The evader implements the conventional feedback Nash strategy and the pursuers implement Nash strategies based on a novel concept of best achievable performance indices. This problem has potential applications in situations where a well-equipped unmanned vehicle is evading several weakly equipped pursuing vehicles. An illustrative example is solved, and several scenarios are presented.