A multi-robot strategy for rapidly searching a polygonal environment

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3315, Issue , 2004, Pages 484-493

  Sarmiento, Alejandro ^a   Murrieta Cid, Rafael ^b   Hutchinson, Seth ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FUNCTIONS; HEURISTIC METHODS; MOBILE ROBOTS; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING; ARTIFICIAL INTELLIGENCE; INDUSTRIAL ROBOTS; MULTIPURPOSE ROBOTS; OBJECT RECOGNITION;

MULTI-ROBOT STRATEGY; POLYGONAL ENVIRONMENT; SEARCH SPACE; UTILITY FUNCTIONS; COMPUTATIONAL COSTS; EXPECTED VALUES; GREEDY ALGORITHMS; MULTIROBOTS; SEARCH SPACES;

OBJECT RECOGNITION; ROBOTS;

EID: 22944437117     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30498-2_48     Document Type: Conference Paper

References (16)

1. Chin, W.P. and S. Ntafos, "Optimum Watchman Routes," Information Processing Letters, Vol. 28, pp. 39-44, 1988.
2. Goodman, J.E. and J. O'Rourke, Handbook of Discrete and Computational Geometry, CRC Press, 1997.
3. Garey, M.R. and D.S. Johnson, Computers and Intractability, W. H. Freeman and Company, 1979.
4. González-Banos, H.H. and J.C. Latombe, "Navigation Strategies for Exploring Indoor Environments," Int. Journal of Robotics Research, 21(10/11), pp. 829-848, Oct-Nov 2002.
5. Greiner, G. and K. Hormann, "Efficient Clipping of Arbitrary Polygons," ACM Transactions on Graphics, Vol. 17, number 2, pp. 71-83, 1998.
6. LaValle, S.M. et al., "Finding an Unpredictable Target in a Workspace with Obstacles," in Proc. IEEE Int. Conf. on Robotics and Automation 1997.
7. Murrieta-Cid, R., A. Sarmiento and S.A. Hutchinson, "On the Existence of a Strategy to Maintain a Moving Target within the Sensing Range of an Observer Reacting with Delay," in Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems 2003.
8. Murrieta-Cid, R., A. Sarmiento, S. Bhattacharya and S.A. Hutchinson, "Maintaining Visibility of a Moving Target at a Fixed Distance: The Case of Observer Bounded Speed," in Proc. IEEE Int. Conf. on Robotics and Automation 2004-
9. O'Rourke, J., Art Gallery Theorems and Algorithms, Oxford University Press, 1987.
10. Rohnert, H., "Shortest Paths in the Plane with Convex Polygonal Obstacles," Information Processing Letters, 23:71-76, 1986.
11. Ross, S.M., Introduction to Probability and Statistics for Engineers and Scientists, Wiley, 1987.
12. Sarmiento A., R. Murrieta and S.A. Hutchinson, "A Strategy for Searching an Object with a Mobile Robot," in Proc. Int. Conf. on Advanced Robotics 2003.
13. Sarmiento A., R. Murrieta and S.A. Hutchinson, "Planning Expected-time Optimal Paths for Searching Known Environments," accepted to IEEE/RSJ Int. Conf. on Intelligent Robots and Systems 2004-
14. Shermer, T.C., "Recent Results in Art Galleries," in Proc. of the IEEE, Vol. 80, issue 9, September 1992.
15. Tovar, B., S.M. LaValle and R. Murrieta-Cid, "Optimal Navigation and Object Finding without Geometric Maps or Localization," in Proc. IEEE Int. Conf. on Robotics and Automation 2003.
16. Vatti, B.R., "A Generic Solution to Polygon Clipping," Communications of the ACM, 35(7), pp. 56-63, July 1992.