Probabilistic search for a moving target in an indoor environment

IEEE International Conference on Intelligent Robots and Systems

Volumn , Issue , 2006, Pages 3393-3398

  Lau, Haye ^a   Huang, Shoudong ^a   Dissanayake, Gamini ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Branch and bound; Optimal searcher path problem; Target search

Indexed keywords

MOTION PLANNING; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

BOUNDING METHODS; OPTIMAL SEARCHER PATH PROBLEM (OSP); TARGET LOCATION; TARGET SEARCH;

TARGET TRACKING;

EID: 34250673906     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2006.282575     Document Type: Conference Paper

References (11)

1. H. Lau, S. Huang, and G. Dissanayake, "Optimal search for multiple targets in a built environment," Proc. IEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 3740-3745, August 2005.
2. A. Sarmiento, R. Murrieta, S. A. Hutchinson, "An efficient strategy for rapidly finding an object in a polygonal world," Proc. IEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 1153-1158, October 2003.
3. K. E. Trummel and J. R. Weisinger, "The complexity of the optimal searcher path problem," Operations Research, vol. 34, no. 2, 1986.
4. J. N. Eagle and J. R. Yee. "An optimal branch-and-bound procedure for the constrained path, moving target search problem," Operations Research, vol. 38, no. 1, pp. 110-114, 1990.
5. A. R. Washburn, "Branch and bound methods for a search problem," Naval Research Logistics, vol. 45, 1998.
6. G. H. A. Martins, "A new branch-and-bound procedure for computing optimal search paths," Master's Thesis, Naval Postgraduate School, 1993.
7. H.Lau, S. Huang, and G. Dissanayake, "Probabilistic search for a moving target in structured environments", submitted to European J. Oper. Res.
8. A. Sarmiento, R. Murrieta-Sid, S. Hutchinson, "Planning expected-time optimal paths for searching known environments," Proc. IEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 872-878, 2004.
9. F. Bourgault, T. Furukawa, H. F. Durrant-Whyte, "Process model, constraints, and the coordinated search strategy," Proc. IEE Int. Conf. on Robotics and Automation, pp. 5256-5261, April-May 2004.
10. R. F. Dell, J. N. Eagle, G. H. A. Martins and A. G. Santos, "Using multiple searchers in constrained-path, moving-target search problems," Naval Research Logistics, vol. 43, 1996, pp. 463-480.
11. S. S. Brown, "Optimal search for a moving target in discrete time and space," Operations Research, vol. 28, no. 2, pp. 1275-1289, 1980.