Decentralized Search and Track with Multiple Autonomous Agents

Abstract

In this paper we study the problem of cooperative searching and tracking (SAT) of multiple moving targets with a group of autonomous mobile agents that exhibit limited sensing capabilities. We assume that the actual number of targets is not known a priori and that target births/deaths can occur anywhere inside the surveillance region. For this reason efficient search strategies are required to detect and track as many targets as possible. To address the aforementioned challenges we augment the classical Probability Hypothesis Density (PHD) filter with the ability to propagate in time the search density in addition to the target density. Based on this, we develop decentralized cooperative look-ahead strategies for efficient searching and tracking of an unknown number of targets inside a bounded surveillance area. The performance of the proposed approach is demonstrated through simulation experiments.

Cited by in corpus (7)

• Towards Automated 3D Search Planning for Emergency Response Missions
• Integrated Guidance and Gimbal Control for Coverage Planning With Visibility Constraints
• Cooperative Simultaneous Tracking and Jamming for Disabling a Rogue Drone
• 3D Trajectory Planning for UAV-based Search Missions: An Integrated Assessment and Search Planning Approach
• Downing a Rogue Drone with a Team of Aerial Radio Signal Jammers
• UAV-based Receding Horizon Control for 3D Inspection Planning
• Integrated Ray-Tracing and Coverage Planning Control using Reinforcement Learning