Parallel stochastic hill-climbing with small teams

Multi-Robot Systems. From Swarms to Intelligent Automata - Proceedings from the 2005 International Workshop on Multi-Robot Systems

Volumn 3, Issue , 2005, Pages 65-77

  Gerkey, Brian P ^a   Thrun, Sebastian ^a   Gordon, Geoff ^b  

^a STANFORD UNIVERSITY   (United States)

^b Carnegie Mellon University ^*  (United States)

Author keywords

Coordination; Multi robot systems; Pursuit evasion

Indexed keywords

HUMAN RESOURCE MANAGEMENT; INDUSTRIAL ROBOTS; INTELLIGENT ROBOTS; ROBOT LEARNING; STOCHASTIC SYSTEMS;

COORDINATION; COORDINATION ALGORITHMS; COORDINATION PROBLEMS; EXPONENTIAL COMPUTATION; HIGH-QUALITY SOLUTIONS; MULTI-ROBOT SYSTEMS; PURSUIT EVASION; STOCHASTIC HILL-CLIMBING;

MULTIPURPOSE ROBOTS;

EID: 33645676125     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/1-4020-3389-3_6     Document Type: Conference Paper

References (11)

1. Adler, M., Räcke, H., Sivadasan, N., Sohler, C., and Vöcking, B. (2003). Randomized PursuitEvasion in Graphs. Combinatorics, Probability and Computing, 12(3):225-244.
2. Dias, M. B. and Stentz, A. (2003). TraderBots: A Market-Based Approach for Resource, Role, and Task Allocation in Multirobot Coordination. Technical Report CMU-RI-TR-03-19, Robotics Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania.
3. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
4. Gerkey, B. P. and Matarić, M. J. (2002). Sold!: Auction methods for multi-robot coordination. IEEE Transactions on Robotics and Automation, 18(5):758-768.
5. Gerkey, B. P., Thrun, S., and Gordon, G. (2004). Visibility-based pursuit-evasion with limited field of view. In Proc. of the Natl. Conf. on Artificial Intelligence (AAAI), pages 20-27, San Jose, California.
6. Gerkey, B. P., and Vaughan., R. T., and Howard, A. (2003). The Player/Stage Project: Tools for MultiRobot and Distributed Sensor Systems. In Proc. of the Intl. Conf. on Advanced Robotics (ICAR), pages 317-323, Coimbra, Portugal.
7. Guibas, L. J., Latombe, J.-C., and LaValle., S. M., Lin, D., and Motwani, R. (1999). A Visibility-Based Pursuit-Evasion Problem. Intl. J. of Computational Geometry & Applications, 9(4 & 5):471-493.
8. Isler, V., Kannan, S., and Khanna, S. (2003). Locating and capturing an evader in a polygonal environment. Technical Report MS-CIS-03-33, Dept. of Computer Science, Univ. of Pennsylvania.
9. Lee, J.-H., Park, S.-M., and Chwa, K.-Y. (2002). Simple algorithms for searching a polygon with flashlights. Information Processing Letters, 81:265-270.
10. Parsons, T. (1976). Pursuit-evasion in a graph. In Alavi, Y. and Lick, D., editors, Theory and Applications of Graphs, Lecture Notes in Mathematics 642, pages 426-441. Springer-Verlag, Berlin.
11. Suzuki, I. and Yamashita, M. (1992). Searching for a mobile intruder in a polygonal region. SIAM J. on Computing, 21(5):863-888.