期刊
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS
卷 47, 期 4, 页码 2637-2656出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAES.2011.6034656
关键词
-
资金
- Air Force Office of Scientific Research (AFOSR) [FA9550-06-C-0119]
- Institute for Collaborative Biotechnologies through U. S. Army Research Office [W911NF-09-D-0001]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据