Cooperative searching for stochastic targets

Details Cooperative searching for stochastic targets Cooperative searching for stochastic targets

2011-03-25

arxiv.org/abs/1103.4888v1

Computer Science

Information Theory

Journal of Intelligence Community Research and Development, permanently available on Intelink, October 2010

Scientific paper

Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution for spatial searches involving two agents that may or may not choose to share information during a search. For certain classes of tasks, sharing information between multiple searchers makes cooperative searching advantageous. In some examples, agents are able to realize synergy by aggregating information and moving based on local judgments about maximal information gathering expectations. We also explore one- and two-dimensional simplified situations analytically and numerically to provide a framework for analyzing more complex problems. These general considerations provide a guide for designing optimal algorithms for real-world search problems.

Affiliated with

Also associated with

No associations

Rating

Cooperative searching for stochastic targets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cooperative searching for stochastic targets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cooperative searching for stochastic targets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-569880