On Determining Optimal Strategies in Pursuit Games in the Plane

Lê, Ngoc-Minh

We investigate a dass of differential games, which we call pursuit games. Pursuit games have application to robotics: the pursuer models a moving obstacle and the evader models a robot that tries to reach a goal region without colliding with the moving obstacle, at each moment the robot does not know the future trajectory of the obstacle. The motion of the pursuer and the evader is controlled by its set of permissible velocities, called indicatrices. We allow indicatrices that are more general than the simple motion (i.e., velocities are bounded by an L2-norm circle). We provide sufficient condition for a pursuit game to "have value", in this case we give optimal strategies for the pursuer and the evader. We prove that the pursuit game in which the pursuer and the evader are convex objects moving with simple motion "has value".

Vorschau

Zitieren

Zitierform:

, Ngoc-Minh: On Determining Optimal Strategies in Pursuit Games in the Plane. Hagen 1995. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe