Cooperative graph search using fractal decomposition

Proceedings of the American Control Conference

Volumn , Issue , 2007, Pages 2557-2562

  Riehl, James R ^a   Hespanha, João P ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(ALGORITHMIC) COMPLEXITY; DECOMPOSED PROBLEM; DECOMPOSITION LEVELS; FRACTAL DECOMPOSITION; GRAPH SEARCH; HIERARCHICAL DECOMPOSITIONS; OPTIMAL REWARD; OPTIMAL SEARCH; TEST CASES; UPPER AND LOWER BOUNDS; WORST-CASE INSTANCES;

CALCULATIONS; COMPUTATIONAL COMPLEXITY; CONTROL THEORY; FRACTALS; GRAPH THEORY; MILITARY DATA PROCESSING;

STABILIZERS (AGENTS);

EID: 46449109463     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2007.4282776     Document Type: Conference Paper

References (13)

1. B. DasGupta, J. Hespanha, J. Riehl, and E. Sontag. Honey-pot constrained searching with local sensory information. Nonlinear Analysis: Hybrid Systems and Applications, 65(9): 1773-1793, Nov. 2006.
2. J. Eagle and J. Yee. An optimal branch-and-bound procedure for the constrained path, moving target search problem. Operations Research, 28(1), 1990.
3. J. R. Frost and L. D. Stone. Review of search theory: Advances and applications to search and rescue decision support. Technical report, U.S. Coast Guard Research and Development Center, Groton, CT, Sept. 2001.
4. K. B. Haley and L. D. Stone, editors. Search Theory and Applications. Plenum Press, New York.
5. J. P. Hespanha. An efficient matlab algorithm for graph partitioning. Technical report, University of California, Santa Barbara, CA, Oct. 2004. Available at http://www.ece.ucsb.edu/~hespanha/techreps.html.
6. B. O. Koopman. Search and Screening. Operations Evaluations Group Report No. 56, Center for Naval Analyses, Alexandria, VA, 1946.
7. B. O. Koopman. Search and Screening: General Principles and Historical Applications. Pergamon Press, New York, 1980.
8. M. Mangel. Search theory: A differential equations approach. In D. V. Chudnovsky and G. V. Chudnovsky, editors, Search Theory: Some Recent Developments, pages 55-101. Marcel Dekker, New York, 1989.
9. M. M. Polycarpou, Y. Yang, and K. M. Passino. A cooperative search framework for distributed agents. In Proc. of the IEEE International Symposium on Intelligent Control, 2001.
10. J. R. Riehl and J. P. Hespanha. Fractal graph optimization algorithms. In Proceedings of the 44th Conference on Decision and Control, 2005.
11. T. J. Stewart. Experience with a branch and bound algorithm for constrained searcher motion. In K. B. Haley and L. D. Stone, editors, Search Theory and Applications, pages 247-254. Plenum Press, New York, 1980.
12. L. D. Stone. Theory of Optimal Search. Academic Press, New York, 1975.
13. K. E. Trummel and J. R. Weisinger. The complexity of the optimal searcher path problem. Operations Research, 34(2):324-327, 1986.