A Design of Distributed Game Strategies for Networked Agents

In this paper, distributed game strategies are designed and analyzed for the multiple-pursuer single-evader problem. The proposed design is based on the integration of cooperative control theory and differential game theory. It is shown that the proposed game strategies are Nash solutions with respect to an inversely-optimal performance index and that they are fully adaptive with respect to information acquisition/communication patterns. A simple condition on topology changes is found so that performances under the distributed game strategies are comparable with those under global-knowledge game strategies.