Hostname: page-component-89b8bd64d-z2ts4 Total loading time: 0 Render date: 2026-05-08T03:56:13.516Z Has data issue: false hasContentIssue false
  • English
  • Français

Discrete Search for an Intelligent Object: The Leprechaun's Problem

Published online by Cambridge University Press:  27 July 2009

Scott Berry
Scott Berry
Affiliation:
Department of Statistics, Texas A&M University, College Station, Texas 77843–3143
Get access Rights & Permissions [Opens in a new window]

Abstract

An optimal search among discrete cells for a Markovian object has been labeled the leprechaun problem. This paper discusses the leprechaun's problem: How should the leprechaun behave in order to maximize the probability of being found? A subjective Bayesian approach is taken in modeling the leprechaun.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 10 , Issue 3 , July 1996 , pp. 363 - 375
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Alpern, S. (1995). The rendezvous search problem. SIAM Journal of Control & Optimization 33: 673–683.CrossRefGoogle Scholar
2.Alpern, S. & Gal, S. (1995). Rendezvous search on the line with distinguishable players. SIAM Journal of Control & Optimization 33: 1271–1277.CrossRefGoogle Scholar
3.Anderson, E.J. & Weber, R.R. (1990). The rendezvous problem on discrete locations. Journal of Applied Probability 28: 839–851.CrossRefGoogle Scholar
4.Berry, S.M. (1994). Discrete search and rescue for an intelligent object. Ph.D. thesis, Carnegie Mellon University, Pittsburgh.Google Scholar
5.Kan, Y.C. (1977). Optimal search of a moving target. Operations Research 25: 864–870.CrossRefGoogle Scholar
6.MacPhee, I.M. & Jordan, B.P. (1995). Optimal search for a moving target. Probability in the Engineering and the Informational Sciences 9: 159–182.CrossRefGoogle Scholar
7.Pollock, S.M. (1970). A simple model of search for a moving target. Operations Research 18: 883–903.CrossRefGoogle Scholar
8.Ross, S.M. (1983). Introduction to stochastic dynamic programming. New York: Academic Press.Google Scholar