This paper addresses the robust cooperative pursuit-evasion problem for multiple evaders and pursuers in a bounded area with measuring noise. First, by considering the priorities of the evaders and the distances between the evaders and the pursuers, a choosing strategy is proposed for the pursuers to choose an appropriate evader as target in each period. Then, set-membership filter technique is used to deal with the measuring noise effect and the evader’s true position is estimated in an updated ellipsoid area. In particular, the ellipsoid area will reduce gradually when the pursuers come near to the evader. Finally, optimal control law is designed for each pursuer with the area-minimization policy, which guarantees that the evaders could be captured one by one in finite time. Simulation results verify the effectiveness of cooperative pursuit algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Robust Cooperative Pursuit-Evasion Problem for Multiple Evaders and Pursuers with Measuring Noise


    Additional title:

    Lect. Notes Electrical Eng.


    Contributors:
    Yan, Liang (editor) / Duan, Haibin (editor) / Yu, Xiang (editor) / Shi, Weixiang (author) / Wang, Chunyan (author) / Wang, Jianan (author) / Shan, Jiayuan (author)


    Publication date :

    2021-10-30


    Size :

    10 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English






    Pursuit-evasion of an Evader by Multiple Pursuers

    Von Moll, Alexander / Casbeer, David W. / Garcia, Eloy et al. | IEEE | 2018


    Pursuit-Evasion Problems Involving Two Pursuers and One Evader

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


    Cooperative Pursuit by Multiple Pursuers of a Single Evader

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