The optimal search for a Markovian target when the search path is constrained: The infinite-horizon case

IEEE Transactions on Automatic Control

Volumn 48, Issue 3, 2003, Pages 493-497

  Singh, Sumeetpal ^a   Krishnamurthy, Vikram ^a,b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Markovian target; Optimal search; Partially observed Markov decision process; Stochastic shortest path problem

Indexed keywords

CONSTRAINT THEORY; DECISION THEORY; DYNAMIC PROGRAMMING; MARKOV PROCESSES; OPTIMAL CONTROL SYSTEMS; STOCHASTIC CONTROL SYSTEMS;

OPTIMAL SEARCH;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0037349372     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2003.809165     Document Type: Article

References (8)

1. D. P. Bertsekas, Dynamic Programming: Deterministic and Stochastic Models. Upper Saddle River, NJ: Prentice-Hall, 1987.
2. D. P. Bertsekas and S. E. Shreve, Stochastic Optimal Control: The Discrete Time Case. New York: Academic, 1978.
3. J. N. Eagle, "The optimal search for a moving target when the search path is constrained," Oper. Res., vol. 32, pp. 1107-1115, 1984.
4. O. Hernandez-Lerma, Adaptive Markov Control Processes. New York: Springer-Verlag, 1989.
5. W. S. Lovejoy, "Computationally feasible bounds for partially observed Markov decision processes," Oper. Res., vol. 39, no. 1, pp. 162-175, 1991.
6. L. C. Thomas and J. N. Eagle, "Criteria and approximate methods for path-constrained moving-target search problems," Naval Res. Log., vol. 42, pp. 27-38, 1995.
7. S. D. Patek, "On partially observed stochastic shortest path problems," presented at the 40th IEEE Conf. Decision Control, Orlando, FL, 2001.
8. S. M. Pollock, "A simple model of search for a moving target," Oper. Res., vol. 18, pp. 883-903, 1970.