In this paper, we extend the well-studied results of the two-pursuer, single-evader differential game to any number of pursuers. The main objective of this investigation is to exploit the benefits of cooperation amongst the pursuers in order to reduce the capture time of the evader. Computational complexity is a chief concern as this problem would need to be solved in an online fashion, e.g., in the case of autonomous unmanned aerial vehicles. A new geometric approach to solving the game is introduced and analyzed, which changes the problem of optimizing over continuous domains to a discrete combinatoric optimization. While past efforts at solving multiple pursuer problems have suffered from the curse of dimensionality, the geometric algorithms put forth here are shown to be scalable. Categorization and removal of redundant pursuers is the primary means by which scalability is achieved. The solution of this problem serves as a stepping stone to more complex problems such as the M-pursuer N-evader differential game.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Pursuit-evasion of an Evader by Multiple Pursuers


    Beteiligte:


    Erscheinungsdatum :

    01.06.2018


    Format / Umfang :

    1481545 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Pursuit-Evasion Problems Involving Two Pursuers and One Evader

    Makkapati, Venkata Ramana / Sun, Wei / Tsiotras, Panagiotis | AIAA | 2018


    Pursuit-Evasion Problems Involving Two Pursuers and One Evader (AIAA 2018-2107)

    Makkapati, Venkata Ramana / Sun, Wei / Tsiotras, Panagiotis | British Library Conference Proceedings | 2018


    Cooperative Pursuit by Multiple Pursuers of a Single Evader

    Pachter, Meir / Moll, Alexander Von / Garcia, Eloy et al. | AIAA | 2020