Optimal search for multiple targets in a built environment

2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS

Volumn , Issue , 2005, Pages 3740-3745

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

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Dynamic programming; Multiple targets; Probability distribution; Target search; Topological map

Indexed keywords

INTELLIGENT ROBOTS; PROBABILITY DISTRIBUTIONS;

ADJACENCY MATRICES; AUTONOMOUS SEARCHES; BUILT ENVIRONMENT; DYNAMIC PROGRAMMING ALGORITHM; MULTIPLE TARGETS; OFFICE ENVIRONMENTS; TARGET SEARCH; TOPOLOGICAL MAP;

DYNAMIC PROGRAMMING;

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

References (13)

1. B. Krishnamachari and S. Iyengar, "Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks," IEEE Transactions on Computers, vol. 53, no. 3, pp. 241-250, 2004.
2. R. R. Murphy, "Biomimetic search for urban search and rescue," IEEE/RSJ International Conference on Intelligent Robots and Systems, vol. 3, pp. 2073-2078, 2000. (Pubitemid 32380018)
3. F. Bourgault, T. Furukawa and H. F. Durrant-Whyte, "Coordinated Decentralized Search for a Lost Target in a Bayesian World," Proceedings of the 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, October, 2003, Las Vegas, Nevada.
4. L. D. Stone, Theory of Optimal Search: Academic Press, 1975.
5. 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, January-February 1990.
6. B. DasGupta, J. Hespanha and E. Sontag, "Aggregation-based Approaches to Honey-pot Searching with Local Sensory Information," Proceedings of the American Control Conf, pp. 1202-1207, Boston, June 2004.
7. U. Lossner and I. Wegener, "Discrete Sequential Search with Positive Switch Cost," Mathematics of Operations Research, vol. 7, no. 3, August 1982.
8. K. E. Trummel and J. R. Weisinger, "The Complexity of the Optimal Searcher Path Problem," Operations Research, vol. 34, no. 2, pp. 324- 327, March-April 1986. (Pubitemid 17461689)
9. A. Sarmiento, R. Murrieta and S. Hutchinson, "An Efficient Strategy for Rapidly Finding an Object in a Polygonal World," IEEE/RSJ International Conference on Intelligent Robots and Systems, vol. 2, pp. 1153-1158, 2003.
10. B. Jung and G. S. Sukhatme, "A Generalized Region-based Approach for Multi-target Tracking in Outdoor Environments," IEEE International Conference on Robotics and Automation, vol. 3, pp. 2189-2195, 2004.
11. A. Murarka and B. Kuipers, "Using CAD drawings for robot navigation," 2001 IEEE International Conference on Systems, Man, and Cybernetics, vol. 3494, pp. 678-683, 2001. (Pubitemid 34210521)
12. B. P. Gerkey, S. Thrun and G. Gordon, "Visibility-based pursuit-evasion with limited field of view," Proceedings of the National Conference on Artificial Intelligence, pp. 20-27, 2004.
13. E. Erkut and J. Zhang, "The Maximum Collection Problem with Time- Dependent Rewards," Naval Research Logistics, vol. 43, pp. 749-763, 1996. (Pubitemid 126568768)