메뉴 건너뛰기




Volumn , Issue , 2008, Pages 146-151

Multi-agent probabilistic search in a sequential decision-theoretic framework

Author keywords

[No Author keywords available]

Indexed keywords

UNCERTAINTY ANALYSIS;

EID: 51649110148     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2008.4543200     Document Type: Conference Paper
Times cited : (36)

References (28)
  • 1
    • 0000714322 scopus 로고
    • The theory of search, part III. the optimum distribution of searching effort
    • B. O. Koopman, "The theory of search, part III. the optimum distribution of searching effort." Operations Research, vol. 5, pp. 613-626, 1957.
    • (1957) Operations Research , vol.5 , pp. 613-626
    • Koopman, B.O.1
  • 2
  • 6
    • 85193228906 scopus 로고    scopus 로고
    • Learning Multi-Agent Search Strategies
    • M. Strens, "Learning Multi-Agent Search Strategies," AISB Journal, vol. 1, no. 4, pp. 7-11, 2003.
    • (2003) AISB Journal , vol.1 , Issue.4 , pp. 7-11
    • Strens, M.1
  • 7
    • 15244352522 scopus 로고    scopus 로고
    • Optimal eye movement strategies in visual search
    • J. Najemnik and W. S. Geisler, "Optimal eye movement strategies in visual search," Nature, vol. 434, pp. 387-391, 2005.
    • (2005) Nature , vol.434 , pp. 387-391
    • Najemnik, J.1    Geisler, W.S.2
  • 11
    • 0036817348 scopus 로고    scopus 로고
    • Probabilistic pursuit-evasion games: Theory, implementation and experimental evaluation
    • Oct
    • R. Vidal, O. Shakernia, H. Kim, D. Shim, and S. Sastry, "Probabilistic pursuit-evasion games: Theory, implementation and experimental evaluation," IEEE Transactions on Robotics and Automation, vol. 18, no. 5, pp. 662-669, Oct 2002.
    • (2002) IEEE Transactions on Robotics and Automation , vol.18 , Issue.5 , pp. 662-669
    • Vidal, R.1    Shakernia, O.2    Kim, H.3    Shim, D.4    Sastry, S.5
  • 14
    • 0015094174 scopus 로고
    • Optimal Whereabouts Search
    • J. Kadane, "Optimal Whereabouts Search," Operations Research, vol. 19, no. 4, pp. 894-904, 1971.
    • (1971) Operations Research , vol.19 , Issue.4 , pp. 894-904
    • Kadane, J.1
  • 19
    • 0003503387 scopus 로고
    • New York, NY: John Wiley and Sons, Inc
    • A. Wald, Sequential Analysis. New York, NY: John Wiley and Sons, Inc., 1947.
    • (1947) Sequential Analysis
    • Wald, A.1
  • 20
    • 36348998104 scopus 로고
    • Bayes solutions of sequential decision problems
    • A. Wald and J. Wolfowitz, "Bayes solutions of sequential decision problems," PNAS, vol. 35, pp. 99-102, 1949.
    • (1949) PNAS , vol.35 , pp. 99-102
    • Wald, A.1    Wolfowitz, J.2
  • 21
    • 58149404021 scopus 로고
    • A theory of memory retrieval
    • R. Ratcliff, "A theory of memory retrieval," Psychological Review, vol. 85, no. 2, pp. 59-108, 1978.
    • (1978) Psychological Review , vol.85 , Issue.2 , pp. 59-108
    • Ratcliff, R.1
  • 23
    • 0022678751 scopus 로고
    • The complexity of the optimal searcher path problem
    • Mar, Apr
    • K. E. Trummel and J. R. Weisinger, "The complexity of the optimal searcher path problem," Operations Research, vol. 34, no. 2, pp. 324-327, Mar. - Apr. 1986.
    • (1986) Operations Research , vol.34 , Issue.2 , pp. 324-327
    • Trummel, K.E.1    Weisinger, J.R.2
  • 24
    • 0018689571 scopus 로고
    • An algorithm for tracking multiple targets
    • Dec
    • D. B. Reid, "An algorithm for tracking multiple targets," IEEE Tran. on Automatic Control, vol. 24, no. 6, pp. 843- 854, Dec 1979.
    • (1979) IEEE Tran. on Automatic Control , vol.24 , Issue.6 , pp. 843-854
    • Reid, D.B.1
  • 25
    • 85193293673 scopus 로고    scopus 로고
    • V. Isler, S. Khanna, J. Spletzer, and C. Taylor, Target tracking with distributed sensors: The focus of attention problem, Computer Vision and Image Understanding Journal, Special Issue on Attention and Performance in Computer Vision, p. accepted, 2005, accepted.
    • V. Isler, S. Khanna, J. Spletzer, and C. Taylor, "Target tracking with distributed sensors: The focus of attention problem," Computer Vision and Image Understanding Journal, vol. Special Issue on Attention and Performance in Computer Vision, p. accepted, 2005, accepted.
  • 26
    • 33846688584 scopus 로고    scopus 로고
    • Discrete search allocation game with false contacts
    • R. Hohzaki, "Discrete search allocation game with false contacts," Naval Research Logistics, vol. 54, no. 1, pp. 46-58, 2006.
    • (2006) Naval Research Logistics , vol.54 , Issue.1 , pp. 46-58
    • Hohzaki, R.1
  • 27
    • 11144248838 scopus 로고
    • Optimal Search Density for a Stationary Target among Stationary False Targets
    • D. Kalbaugh, "Optimal Search Density for a Stationary Target among Stationary False Targets," Operations Research, vol. 41, no. 2, pp. 310-318, 1993.
    • (1993) Operations Research , vol.41 , Issue.2 , pp. 310-318
    • Kalbaugh, D.1
  • 28
    • 0027577361 scopus 로고
    • Recontamination does not help to search a graph
    • A. LaPaugh, "Recontamination does not help to search a graph," Journal of the ACM (JACM), vol. 40, no. 2, pp. 224-245, 1993.
    • (1993) Journal of the ACM (JACM) , vol.40 , Issue.2 , pp. 224-245
    • LaPaugh, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.