Locally Optimizing Strategies for Approaching the Furthest Evader

Igor Shevchenko

Authors

Igor Shevchenko Paciﬁc Fisheries Research Center; Far East Federal University

Abstract

We describe a method for constructing feedback strategies based on minimizing/maximizing state evaluation functions with use of steepest descent/ascent conditions. For a speciﬁc kinematics, not all control variables may be presented implicitly in the corresponding optimality conditions and some additional local conditions are to be invoked to design strategies for these controls. We apply the general technics to evaluate a chance for the pursuer P to approach the real target that uses decoys by a kill radius r. Assumed that P cannot classify the real and false targets. Therefore, P tries to come close to the furthest evader, and thereby to guarantee the capture of all targets including the real one. We setup two-person zero-sum diﬀerential games of degree with perfect information of the pursuing, P,and several identical evading, E ₁,..., E _N, agents. The P’s goal is to approach the furthest of E ₁,..., E _N as closely as possible. Euclidean distances to the furthest evader at the current state or their smooth approximations are used as evaluation functions. For an agent with simple motion, the method allows to specify the strategy for heading angle completely. For an agent that drives a Dubins or Reeds-Shepp car, ﬁrst we deﬁne his targeted trajectory as one that corresponds to the game where all agents has simple motions and apply the locally optimal strategies for heading angles. Then, to design strategies for angular and ordinary velocities, local conditions under which the resulting trajectories approximate the targeted ones are invoked. Two numerical examples of the pursuit simulation when one or two decoys launched at the initial instant are given.

Keywords:

Conservative pursuit strategy, Lyapunov-type function, steepest descent/ascent condition, smooth approximation for min/max, Dubins car, Reeds-Shepp car, decoy

Downloads

Download data is not yet available.

References

Abramyants, T.G., E.P. Maslov and E.Y. Rubinovich (1980). An Elementary Diﬀerential Game of Alternate Pursuit. Autom. Remote Control, 40 (8), 1043–1052.

Armo K.R. (2000). The Relationship Between a Submarine’s Maximum Speed and Its Evasive Capability. Master’s Thesis of Naval Postgraduate School: Monterey, CA, USA.

Breakwell, J.V. and P. Hagedorn (1979). Point Capture of Two Evaders in Succession. J. Optim. Theory Appl., 27 (1), 90–97.

Cho, D.-Y. et al. (2007). Analysis of a submarine’s evasive capability against an antisubmarine warfare torpedo using DEVS modeling and simulation. In: Proceedings of the 2007 spring simulation multiconference SpringSim ’07, Norfolk, Virginia. Society for Computer Simulation International: San Diego, CA, 307–315.

Dem’yanov, V.F. and L.V. Vasilev (1985). Non-diﬀerentiable Optimization. Springer-Verlag: Berlin.

Friedman, A. (1999). Diﬀerential Games. John Wiley: New York.

La Valle, S.M. (2006). Planning Algorithms. Cambridge University Press.

Lewin, J. (1973). Decoy in Pursuit Evasion Games. Ph. D. Dissertation, Department of Aeronautics and Astronautics, Stanford University.

Pang, J.-E. (2007). Pursuit-evasion with Acceleration, Sensing Limitation, and Electronic Counter Measures. MS Dissertation, Graduate School, Clemson University.

Patsko, V.S. and V.L. Turova (2009). Homicidal Chauﬀeur Game: History and Recent Findings. Institute of Mathematics and Mechanics: Ekaterinburg (in Russian).

Shevchenko, I.I. (1982). An Elementary Model of Successive Pursuit. Automat. Remote Control, 43 (4), 456–460.

Shevchenko, I.I. (2008). Guaranteed Approach with the Farthest of the Runaways.Automat. Remote Control, 69 (5), 828–844.

Shevchenko, I. (1997). Successive Pursuit with a Bounded Detection Domain. J.Optim. Theory Appl., 95 (1), 25–48.

Shevchenko, I. (2004a). Approaching Coalitions of Evaders on the Average. In: Proceedings of the Eleventh International Symposium on Dynamic Games and Applications (Vincent, T. L., ed.), Lowes Ventana Canyon Resort: Tucson, Arizona, 828–840.

Shevchenko, I. (2004b). Minimizing the Distance to One Evader While Chasing Another. Computers and Mathematics with Applications, 47 (12), 1827–1855.

Shevchenko, I. (2009). Guaranteed Strategies for Successive Pursuit with Finite Sensor Range. In: Collected abstracts of papers presented on the Third International Conference on Game Theory and Management. (Petrosyan, L. A. and N. A. Zenkevich, eds), School of Management: SPb., 239–240.

Stipanovi´c, D., A. Melikyan and N. Hovakimyan (2009). Some Suﬃcient Conditions for Multi-Player Pursuit-Evasion Games with Continuous and Discrete Observations.Annals of the International Society of Dynamic Games, 10, 133–145.

Sticht, D.J., T.L. Vincent and D.G. Schultz (1975). Suﬃciency Theorems for Target Capture. J. Optim. Theory Appl., 17 (5/6) , 523–543.

Subbotin, A.I. and A.G. Chentsov (1981). Optimization of guarantee in control problems. Nauka: Moscow (in Russian).