메뉴 건너뛰기




Volumn , Issue , 2007, Pages 2998-3004

Cooperative graph-based model predictive search

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; UNMANNED AERIAL VEHICLES (UAV);

EID: 35948934497     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2007.4435025     Document Type: Conference Paper
Times cited : (24)

References (11)
  • 2
    • 0025251033 scopus 로고
    • An optimal branch-and-bound procedure for the constrained path, moving target search problem
    • J. Eagle and J. Yee. An optimal branch-and-bound procedure for the constrained path, moving target search problem. Operations Research, 28(1), 1990.
    • (1990) Operations Research , vol.28 , Issue.1
    • Eagle, J.1    Yee, J.2
  • 5
    • 0003454134 scopus 로고
    • Search and Screening
    • No. 56, Center for Naval Analyses, Alexandria, VA
    • B. O. Koopman. Search and Screening. Operations Evaluations Group Report No. 56, Center for Naval Analyses, Alexandria, VA, 1946.
    • (1946) Operations Evaluations Group Report
    • Koopman, B.O.1
  • 6
    • 85161221309 scopus 로고
    • Search theory: A differential equations approach
    • Chudnovsky and Chudnovsky, editors, Marcel Dekker, New York
    • M. Mangel. Search theory: A differential equations approach. In Chudnovsky and Chudnovsky, editors, Search Theory: Some Recent Developments, pages 55-101. Marcel Dekker, New York, 1989.
    • (1989) Search Theory: Some Recent Developments , pp. 55-101
    • Mangel, M.1
  • 9
    • 39549094309 scopus 로고    scopus 로고
    • Cooperative graph-based model predictive search
    • Technical report, Dept. of Electrical and Computer Eng, University of California, Santa Barbara, September
    • J. R. Riehl and J. P. Hespanha. Cooperative graph-based model predictive search. Technical report, Dept. of Electrical and Computer Eng., University of California, Santa Barbara, September 2007.
    • (2007)
    • Riehl, J.R.1    Hespanha, J.P.2
  • 11
    • 0022678751 scopus 로고
    • The complexity of the optimal searcher path problem
    • K. E. Trummel and J.R. Weisinger. The complexity of the optimal searcher path problem. Operations Research, 34(2):324-327, 1986.
    • (1986) Operations Research , vol.34 , Issue.2 , pp. 324-327
    • Trummel, K.E.1    Weisinger, J.R.2


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