IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v13y2023i3d10.1007_s13235-022-00481-9.html
   My bibliography  Save this article

Pure Pursuit with an Effector

Author

Listed:
  • Alexander Moll

    (Air Force Research Laboratory, Wright-Patterson Air Force Base
    University of Cincinnati)

  • Meir Pachter

    (Air Force Institute of Technology, Wright-Patterson Air Force Base)

  • Zachariah Fuchs

    (University of Cincinnati)

Abstract

The study of pursuit curves is valuable in the context of air-to-air combat as pure pursuit guidance (heading directly at the target) is oftentimes implemented. The problems considered in this paper concern a Pursuer, implementing pure pursuit (i.e., line of sight guidance), chasing an Evader who holds course. Previous results are applicable to the case in which capture is defined as the two agents being coincident, i.e., point capture. The focus here is on obtaining results for the more realistic case where the pursuer is endowed with an effector whose range is finite. The scenario in which the Evader begins inside the Pursuer’s effector range is also considered (i.e., escape from persistent surveillance, among other potential applications). Questions herein addressed include: does the engagement end in head-on collision or tail chase, will the Evader be captured or escape, what is the minimum distance the Pursuer will attain, for two Pursuers, is simultaneous capture/escape optimal and, if so, what is the optimal heading for the Evader (max time to capture, or min time to escape), and the feasibility for a fast Evader to escape from many Pursuers. Where possible, closed-form, analytic results are obtained, otherwise attention is given to computability with an eye towards real-time, on-board implementation.

Suggested Citation

  • Alexander Moll & Meir Pachter & Zachariah Fuchs, 2023. "Pure Pursuit with an Effector," Dynamic Games and Applications, Springer, vol. 13(3), pages 961-979, September.
    • Handle: RePEc:spr:dyngam:v:13:y:2023:i:3:d:10.1007_s13235-022-00481-9
    DOI: 10.1007/s13235-022-00481-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-022-00481-9
    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-022-00481-9?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. Sergey S. Kumkov & Stéphane Ménec & Valerii S. Patsko, 2017. "Zero-Sum Pursuit-Evasion Differential Games with Many Objects: Survey of Publications," Dynamic Games and Applications, Springer, vol. 7(4), pages 609-633, December.
    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. 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.
    2. Valerii Patsko & Marc Quincampoix, 2019. "Preface: DGAA Special Issue on Pursuit-Evasion Games and Differential Games with Incomplete Information," Dynamic Games and Applications, Springer, vol. 9(3), pages 569-572, September.
    3. Liudmila Kamneva, 2019. "Computation of Solvability Set for Differential Games in the Plane with Simple Motion and Non-convex Terminal Set," Dynamic Games and Applications, Springer, vol. 9(3), pages 724-750, September.
    4. Alexander Moll & Meir Pachter & Eloy Garcia & David Casbeer & Dejan Milutinović, 2020. "Robust Policies for a Multiple-Pursuer Single-Evader Differential Game," Dynamic Games and Applications, Springer, vol. 10(1), pages 202-221, March.
    5. Meir Pachter & Sean Coates, 2019. "The Classical Homicidal Chauffeur Game," Dynamic Games and Applications, Springer, vol. 9(3), pages 800-850, September.
    6. Olga Yufereva, 2019. "Lion and Man Game in Compact Spaces," Dynamic Games and Applications, Springer, vol. 9(1), pages 281-292, March.
    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.

    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:13:y:2023:i:3:d:10.1007_s13235-022-00481-9. 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.