IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v9y2019i4d10.1007_s13235-019-00319-x.html
   My bibliography  Save this article

Optimal Evading Strategies and Task Allocation in Multi-player Pursuit–Evasion Problems

Author

Listed:
  • Venkata Ramana Makkapati

    (Georgia Institute of Technology)

  • Panagiotis Tsiotras

    (Georgia Institute of Technology)

Abstract

Pursuit–evasion problems involving multiple pursuers and evaders are studied in this paper. The pursuers and the evaders are all assumed to be identical, and the pursuers are assumed to follow either a constant bearing or a pure pursuit strategy, giving rise to two distinct cases. The problem is simplified by adopting a dynamic divide and conquer approach, where at every time instant each evader is assigned to a set of pursuers based on the instantaneous positions of all the players. In this regard, the corresponding multi-pursuer single-evader problem is analyzed first. Assuming that the evader knows the positions of all the pursuers and their pursuit strategy, the time-optimal evading strategies are derived for both constant bearing and pure pursuit cases for the pursuers using tools from optimal control theory. In the case of a constant bearing strategy, and assuming that the evader can follow any strategy, a dynamic task allocation algorithm is proposed for the pursuers. The algorithm is based on the well-known Apollonius circle and allows the pursuers to allocate their resources in an intelligent manner while guaranteeing the capture of the evader in minimum time. For the case of pure pursuit, the algorithm is modified using the counterpart of the Apollonius circle leading to an “Apollonius closed curve.” Finally, the proposed algorithms are extended to assign pursuers in the case of a problem with multiple pursuers and multiple evaders. Numerical simulations are included to demonstrate the performance of the proposed algorithms.

Suggested Citation

  • Venkata Ramana Makkapati & Panagiotis Tsiotras, 2019. "Optimal Evading Strategies and Task Allocation in Multi-player Pursuit–Evasion Problems," Dynamic Games and Applications, Springer, vol. 9(4), pages 1168-1187, December.
    • Handle: RePEc:spr:dyngam:v:9:y:2019:i:4:d:10.1007_s13235-019-00319-x
    DOI: 10.1007/s13235-019-00319-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-019-00319-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13235-019-00319-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ibragimov, Gafurjan I. & Salimi, Mehdi & Amini, Massoud, 2012. "Evasion from many pursuers in simple motion differential game with integral constraints," European Journal of Operational Research, Elsevier, vol. 218(2), pages 505-511.
    2. Dušan M. Stipanović & Arik Melikyan & Naira Hovakimyan, 2010. "Guaranteed Strategies For Nonlinear Multi-Player Pursuit-Evasion Games," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 12(01), pages 1-17.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nikolay N. Petrov, 2023. "On the Problem of Pursuing Two Coordinated Evaders in Linear Recurrent Differential Games," Journal of Optimization Theory and Applications, Springer, vol. 197(3), pages 1011-1023, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Idris Ahmed & Poom Kumam & Gafurjan Ibragimov & Jewaidu Rilwan & Wiyada Kumam, 2019. "An Optimal Pursuit Differential Game Problem with One Evader and Many Pursuers," Mathematics, MDPI, vol. 7(9), pages 1-11, September.
    2. Aleksandr I. Blagodatskikh & Nikolai N. Petrov, 2019. "Simultaneous Multiple Capture of Rigidly Coordinated Evaders," Dynamic Games and Applications, Springer, vol. 9(3), pages 594-613, September.
    3. Idham Arif Alias & Gafurjan Ibragimov & Askar Rakhmanov, 2017. "Evasion Differential Game of Infinitely Many Evaders from Infinitely Many Pursuers in Hilbert Space," Dynamic Games and Applications, Springer, vol. 7(3), pages 347-359, September.
    4. Gafurjan Ibragimov & Massimiliano Ferrara & Marks Ruziboev & Bruno Antonio Pansera, 2021. "Linear evasion differential game of one evader and several pursuers with integral constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(3), pages 729-750, September.
    5. Mehdi Salimi & Gafurjan I. Ibragimov & Stefan Siegmund & Somayeh Sharifi, 2016. "On a Fixed Duration Pursuit Differential Game with Geometric and Integral Constraints," Dynamic Games and Applications, Springer, vol. 6(3), pages 409-425, September.
    6. Gafurjan Ibragimov & Massimiliano Ferrara & Atamurat Kuchkarov & Bruno Antonio Pansera, 2018. "Simple Motion Evasion Differential Game of Many Pursuers and Evaders with Integral Constraints," Dynamic Games and Applications, Springer, vol. 8(2), pages 352-378, June.
    7. Gafurjan Ibragimov & Yusra Salleh & Idham Arif Alias & Bruno Antonio Pansera & Massimiliano Ferrara, 2023. "Evasion from Several Pursuers in the Game with Coordinate-wise Integral Constraints," Dynamic Games and Applications, Springer, vol. 13(3), pages 819-842, September.
    8. Wei Sun & Panagiotis Tsiotras & Anthony J. Yezzi, 2019. "Multiplayer Pursuit-Evasion Games in Three-Dimensional Flow Fields," Dynamic Games and Applications, Springer, vol. 9(4), pages 1188-1207, December.
    9. Mehdi Salimi & Massimiliano Ferrara, 2019. "Differential game of optimal pursuit of one evader by many pursuers," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(2), pages 481-490, June.
    10. Nikolai N. Petrov & Nadezhda A. Solov’eva, 2019. "Capture of Given Number of Evaders in Pontryagin’s Nonstationary Example," Dynamic Games and Applications, Springer, vol. 9(3), pages 614-627, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:dyngam:v:9:y:2019:i:4:d:10.1007_s13235-019-00319-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.