Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.
DOI: 10.1109/robot.2006.1642081
|View full text |Cite
|
Sign up to set email alerts
|

Recursive Bayesian search-and-tracking using coordinated uavs for lost targets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
110
0
2

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 162 publications
(116 citation statements)
references
References 7 publications
0
110
0
2
Order By: Relevance
“…About the movement, a large number researches have a pre-defined assumption that the UAV can not re-planned its movement no matter how the UAVs are distributed [13], [14], [15]. And most of them is associated with the first kind of search such as lane base search, random search, grid based search [16].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…About the movement, a large number researches have a pre-defined assumption that the UAV can not re-planned its movement no matter how the UAVs are distributed [13], [14], [15]. And most of them is associated with the first kind of search such as lane base search, random search, grid based search [16].…”
Section: Related Workmentioning
confidence: 99%
“…The target's occupancy probability is modelled as a Bernoulli Distribution [18], that is X c = 1 (target is in cell c) as probability P c and target is not in cell in c (X c = 0) is probability 1-P c . If cell c have not been searched, Pc = 0.5.…”
Section: Problem Statementmentioning
confidence: 99%
“…Much research has been done based on the early work by Koopman; people have investigated different types of detection functions, different search patterns, more general target prior distributions, moving targets and moving searchers (see e.g., [22][23][24]). There are several recent papers considering a (multi) UAV search for targets using some Bayesian approach, see for instance Bourgault et al [25] and Furukawa et al [26]. A common search approach is to represent the target density by a discrete fixed probability grid, and the goal is to maximize the number of detected targets and the search performance is represented by a cumulative probability of detection.…”
Section: Background and Literature Surveymentioning
confidence: 99%
“…The use of automated task planning for SaT missions has received little attention so far, while probabilistic approaches based on Recursive Bayesian Estimation (RBE) have been explored in more depth. Efficient solutions to SaT have been proposed under restrictive simplifying assumptions such as the search area being small (one/two square km), the temporal horizon being short (a few minutes) and the target's motion model being simple (e.g., targets being stationary or in Markovian motion) (Stone 1975;Bourgault et al 2006;Furukawa et al 2006;Lavis and Furukawa 2008;Lin and Goodrich 2014). Although this purely probabilistic approach is successful for small-scale and simple SaT problems, it fails in the face of all the constraints that characterise realworld SaT operations because it becomes computationally too expensive.…”
Section: Introductionmentioning
confidence: 99%