Multi-agent Probabilistic Search in a Sequential Decision-theoretic Framework
Loading...
Authors
Chung, Timothy H.
Burdick, Joel W.
Subjects
Advisors
Date of Issue
2008
Date
Publisher
Language
Abstract
Consider the task of searching a region for the presence or absence of a target using a team of multiple searchers. This paper formulates this search problem as a sequential probabilistic decision, which enables analysis and design of efficient and robust search control strategies. Imperfect detections of the target’s possible locations are made by each search agent and shared with teammates. This information is used to update the evolving decision variable which represents the belief that the target is present in the region. The sequential decision-theoretic formulation presented in this paper provides an analytic framework to evaluate team search systems, as it includes a performance metric (time until decision), a measure of uncertainty (decision confidence thresholds) and imperfect information gathering (detection error). Strategies for cooperative search are evaluated in this context, and comparisons between homogeneous and hybrid search strategies are investigated in numerical studies.
Type
Article
Description
2008 IEEE International Conference on Robotics and Automation, Pasadena, California. 2008.
Series/Report No
Department
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Timothy H. Chung and Joel W. Burdick, "Multi-agent Probabilistic Search in a Sequential Decision-theoretic Framework," 2008 IEEE International Conference on Robotics and Automation, Pasadena, California. 2008.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.