Abstract
A receding-horizon cooperative search algorithm is presented that jointly optimizes routes and sensor orientations for a team of autonomous agents searching for a mobile target in a closed and bounded region. By sampling this region at locations with high target probability at each time step, we reduce the continuous search problem to a sequence of optimizations on a finite, dynamically updated graph whose vertices represent waypoints for the searchers and whose edges indicate potential connections between the waypoints. Paths are computed on this graph using a receding-horizon approach, in which the horizon is a fixed number of graph vertices. To facilitate a fair comparison between paths of varying length on nonuniform graphs, the optimization criterion measures the probability of finding the target per unit travel time. Using this algorithm, we show that the team discovers the target in finite time with probability one. Simulations verify that this algorithm makes effective use of agents and outperforms previously proposed search algorithms. We have successfully hardware tested this algorithm in two small unmanned aerial vehicles (UAVs) with gimbaled video cameras.
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 callMore From: IEEE Transactions on Aerospace and Electronic Systems
Disclaimer: 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.
