IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i19p4162-d1253322.html
   My bibliography  Save this article

Pursuit Problem of Unmanned Aerial Vehicles

Author

Listed:
  • Malafeyev Oleg

    (Department of Modelling in Social and Economical Systems, Saint-Petersburg State University, Universitetskaya Embankment, 7/9, 199034 St. Petersburg, Russia)

  • Kun Zhang

    (Department of Modelling in Social and Economical Systems, Saint-Petersburg State University, Universitetskaya Embankment, 7/9, 199034 St. Petersburg, Russia)

Abstract

The study examines scenarios involving a single pursuer tracking a single evader, as well as situations where multiple pursuers are involved in chasing multiple evaders. We formulate this problem as a search and pursuit problem for unmanned aerial vehicles (UAVs). Game theory offers a mathematical framework to model and examine strategic interactions involving multiple decision-makers. By employing game theory principles to address the search and pursuit problem, our objective is to optimize the efficiency of strategies for detecting and capturing unmanned aerial vehicles (UAVs).

Suggested Citation

  • Malafeyev Oleg & Kun Zhang, 2023. "Pursuit Problem of Unmanned Aerial Vehicles," Mathematics, MDPI, vol. 11(19), pages 1-26, October.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:19:p:4162-:d:1253322
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/19/4162/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/19/4162/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. V. N. Kolokoltsov & O. A. Malafeyev, 2018. "Corruption and botnet defense: a mean field game approach," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(3), pages 977-999, September.
    2. X. V. Grigorieva & Oleg A. Malafeyev, 2011. "Static Multi-Criteria Model of Investing in Innovative Projects on a Set of Coalitional Partitions," DEGIT Conference Papers c016_059, DEGIT, Dynamics, Economic Growth, and International Trade.
    3. J. MacQueen & R. G. Miller, 1960. "Optimal Persistence Policies," Operations Research, INFORMS, vol. 8(3), pages 362-380, June.
    Full references (including those not matched with items on IDEAS)

    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. Zhan (Michael) Shi & T. S. Raghu, 2020. "An Economic Analysis of Product Recommendation in the Presence of Quality and Taste-Match Heterogeneity," Information Systems Research, INFORMS, vol. 31(2), pages 399-411, June.
    2. Churlzu Lim & J. Neil Bearden & J. Cole Smith, 2006. "Sequential Search with Multiattribute Options," Decision Analysis, INFORMS, vol. 3(1), pages 3-15, March.
    3. Bikhchandani, Sushil & Sharma, Sunil, 1996. "Optimal search with learning," Journal of Economic Dynamics and Control, Elsevier, vol. 20(1-3), pages 333-359.
    4. Neumann, Berenice Anne, 2022. "Essential stationary equilibria of mean field games with finite state and action space," Mathematical Social Sciences, Elsevier, vol. 120(C), pages 85-91.
    5. Berenice Anne Neumann, 2020. "A Myopic Adjustment Process for Mean Field Games with Finite State and Action Space," Papers 2008.13420, arXiv.org.
    6. Debarun Bhattacharjya & Léa A. Deleris, 2014. "The Value of Information in Some Variations of the Stopping Problem," Decision Analysis, INFORMS, vol. 11(3), pages 189-203, September.
    7. Georgy Sofronov, 2020. "An Optimal Decision Rule for a Multiple Selling Problem with a Variable Rate of Offers," Mathematics, MDPI, vol. 8(5), pages 1-11, May.
    8. Rebecca Dizon-Ross & Sheldon M. Ross, 2020. "Dynamic search models with multiple items," Annals of Operations Research, Springer, vol. 288(1), pages 223-245, May.
    9. Sofronov, Georgy, 2013. "An optimal sequential procedure for a multiple selling problem with independent observations," European Journal of Operational Research, Elsevier, vol. 225(2), pages 332-336.
    10. Karaliopoulos, Merkouris & Katsikopoulos, Konstantinos & Lambrinos, Lambros, 2017. "Bounded rationality can make parking search more efficient: The power of lexicographic heuristics," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 28-50.
    11. Chun, Young H., 1999. "Selecting the best choice in the full information group interview problem," European Journal of Operational Research, Elsevier, vol. 119(3), pages 635-651, December.
    12. Chun, Young Hak, 1997. "Rank-based selection strategies for the random walk process," European Journal of Operational Research, Elsevier, vol. 96(2), pages 417-427, January.
    13. David, Israel & Levi, Ofer, 2004. "A new algorithm for the multi-item exponentially discounted optimal selection problem," European Journal of Operational Research, Elsevier, vol. 153(3), pages 782-789, March.
    14. Áron Horvath & Aliz McLean, 2013. "Explaining Changes in Transaction Volumes in Hungarian Settlements During the Crisis," ERES eres2013_114, European Real Estate Society (ERES).
    15. Georgy Yu. Sofronov, 2020. "An Optimal Double Stopping Rule for a Buying-Selling Problem," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 1-12, March.
    16. Lim, William W., 1997. "Observing Sunspots at Home," Journal of Housing Economics, Elsevier, vol. 6(3), pages 203-222, 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:gam:jmathe:v:11:y:2023:i:19:p:4162-:d:1253322. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.