Abstract
This paper studies a Simultaneous Search and Monitoring (SSM) problem between an aerial pursuer and multiple evasive ground targets. The adversarial target behaviours and the partial observation by the pursuer make this problem a Partially Observable Stochastic Game (POSG). Because of the intractability of obtaining an exact solution, we applied some assumptions on the information available to the targets. These assumptions simplify the game playing into a dynamic Guaranteed Search problem. A policy planning algorithm was designed for the pursuer, which achieved efficient Simultaneous Search and Monitoring and reduced the total uncertainty level. The comparative study validated the advantages of our policy planning over conventional fixed-pattern Guaranteed Search method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
